CN102149210B - Cognitive cooperation multiple access method - Google Patents
Cognitive cooperation multiple access method Download PDFInfo
- Publication number
- CN102149210B CN102149210B CN 201110122848 CN201110122848A CN102149210B CN 102149210 B CN102149210 B CN 102149210B CN 201110122848 CN201110122848 CN 201110122848 CN 201110122848 A CN201110122848 A CN 201110122848A CN 102149210 B CN102149210 B CN 102149210B
- Authority
- CN
- China
- Prior art keywords
- frame
- node
- cooperation
- neighbors
- sends
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a cognitive cooperation multiple access method, which is mainly used for solving the problem that the service quality of secondary users is low in an existing cognitive cooperation network. The method mainly comprises the steps as follows: 1, a master user carries information whether other users are required to provide cooperation in a cognitive cooperative request-to-send (CCoopRTS) in an appointed channel; 2, the secondary users with the cooperation capacity withdraw and keep off in accordance with self-resources and service conditions before transmitting the cooperation request, so that the secondary user with the maximum cooperation willingness acquires the cooperation right; and 3, the secondary cooperation user appoints a channel for self-services at the same time of sending help request to send (HRTS), so that the secondary cooperation user uses the channel to transmit the self-services after the master user finishes the transmission. The method is applied to the multiple access in the cognitive cooperation network, and can be used to improve the transmission performance of the master user, and the quality of service (QoS) of the secondary users.
Description
Technical field
The present invention relates to wireless communication field, particularly multi-user's Cognitive-Cooperation in heterogeneous network converged, a kind of cognitive cooperation multiple access method, can be used on the competition of secondary user's to cooperation identity and channel in heterogeneous network specifically.
Background technology
Along with the develop rapidly of wireless communication technology, the new generation of wireless network is just gradually towards diversification, isomerization, intelligent direction development, and interconnecting of heterogeneous wireless communication networks also just becomes the focus that current industry is paid close attention to.Yet, in the face of so complicated heterogeneous network, IMS technology in conventional cellular network is hard to carry on, this has just facilitated the combination of the cognitive and cooperation technology of two emerging technologies, find, excavate the available resources in network by cognitive techniques on the one hand, carry out on the other hand the utilization ratio of maximum resource by cooperation, thereby discharge more available resources, both complement each other, have complementary advantages.
Along with progressively going deep into of cognitive and cooperation technology combination, researchers propose cognitive user can improve by relaying primary user's data primary user's transmission performance, self also obtains more channel simultaneously and uses chance, and then reach the situation of " doulbe-sides' victory ".The research that this core concept is isomery cooperation UNE is laid a good foundation.Several Main Patterns of the resource share method that Fig. 1 is current primary user and cognitive user and coordination strategy: Fig. 1 (a) is the most original " private network special use " resource using mode, there do not is resource-sharing between network, the user of this network exclusively enjoys Internet resources, so the idle of resource also just must appear when lighter in traffic carrying capacity; Fig. 1 (b) is traditional cognitive style, the user of other networks is the service condition by these Internet resources of perception as secondary user's, in not disturbing this network under the prerequisite of primary user's resources use right, the slack resources of this network of use that can the chance formula.For secondary user's, this is the model of document resource sharing that a kind of passive type, nothing ensure, the type of service that therefore can carry also is restricted greatly, and this situation can improve in the Modes of Sharing Resources of collaboration type; Fig. 1 (c) has provided a kind of BE collaboration mode, and now as long as the primary user has data, secondary user's just helps the primary user to transmit data as possible.Secondary user's, also by relaying primary user's data, in compression primary user's transmission time, brings the right to use of own service to resource.Can find out, under this pattern, secondary user's has presented active resource-sharing situation, but not strong to the QoS supportability of secondary user's.
Summary of the invention
The present invention be directed to limitation and the imperfection of multiple access method in current Cognitive-Cooperation network, propose a kind of Cognitive-Cooperation network multiple access method, strengthen the QoS supportability of secondary user's.
To achieve these goals, the present invention includes following steps:
(1) when source node sends data, at first according to self and the direct transmission rate of destination node and the service quality QoS demand estimation of business, whether need to carry out cooperation transmission, if do not need utilize IEEE 802.11b DCF protocol transmission data, otherwise perform step 2, start Cognitive-Cooperation multiple access access process;
(2) source node sends the Cognitive-Cooperation request to destination node and sends frame, and the CCoopRTS frame, start to preengage channel, and the neighbors of source node carries out the network allocation vector renewal according to the duration field in the CCoopRTS frame of receiving;
(3) destination node correctly receives the CCoopRTS frame that sends to oneself and self is when idle condition, reply cooperation to source node and allow to send frame, be the CCTS frame, the neighbors of destination node carries out the network allocation vector renewal according to the duration field in the CCTS frame of receiving;
(4) after all neighborss around source node correctly receive the CCTS frame, if these neighborss can meet the desired cooperation speed of CCTS frame, and in idle condition, according to own service demand and primary and secondary user identity, calculate the back off time of each neighbors, the neighbors that back off time finishes at first is cooperative node, cooperative node sends the cooperation request to source node and sends frame, it is the HRTS frame, to inform that source node oneself can help relay data, the neighbors of cooperative node carries out the network allocation vector renewal according to the duration field in the HRTS frame of receiving, otherwise there do not is cooperative node,
(5) when source node correctly receives the CCTS that sends to oneself and HRTS frame, show to exist cooperative node, source node sends Frame to cooperative node; Source node is only received the CCTS frame, while not receiving the HRTS frame, shows not exist cooperative node, and source node sends Frame to destination node; When source node is not received the CCTS frame, show bust this, source node carries out data re-transmission; Receive Frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in Frame around source node;
(6), while having cooperative node, after cooperative node correctly receives the Frame that source node sends to oneself, forward the Frame of receiving to destination node, otherwise do not send any information;
(7) after destination node correctly receives the data that send to oneself, confirm to reply the ACK frame to source node and cooperative node transmission simultaneously, primary user's data send and finish, and around destination node, receive the ACK frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in the ACK frame;
(8) after cooperative node correctly receives the ACK frame that sends to oneself, send the RTS request to the cooperation destination node and send frame, be ready for sending data; The neighbors of cooperative node carries out the network allocation vector renewal according to the duration field in the RTS frame of receiving;
(9) after the cooperation destination node correctly receives the RTS frame that sends to oneself, to cooperative node, reply and allow to send the CTS frame, prepare to receive the data that cooperative node sends; The neighbors of cooperation destination node carries out the network allocation vector renewal according to the duration field in the CTS frame of receiving;
(10), after cooperative node correctly receives the CTS frame that sends to oneself, to the cooperation destination node, send data;
(11) after the cooperation destination node correctly receives the Frame that sends to oneself, to cooperative node, send the ACK frame, finish the Cognitive-Cooperation process.
The present invention compared with prior art has following advantage:
1), than the multiple access technique of traditional cognitive mode, reduced user's data transmission period.
Traditional cognitive multiple access technique does not adopt cooperation mode at present, and the present invention, by introducing cooperation mode, has compressed primary user's transmission time, also, for secondary user's has won the more transmission time, has improved the resource utilization of network.
2), than the multiple access technique of BE collaboration mode, improved the QoS supportability.
In the multiple access technique of BE collaboration mode, after only having primary user's DTD, secondary user's could be transmitted the data of oneself, and in the present invention, secondary user's become more initiatively, after the every head of a secret society user of secondary user's transfers a data grouping, transmit at once oneself a grouping, this QoS to secondary user's has stronger guarantee power, and its type of service that can carry also will be expanded to some extent.
The accompanying drawing explanation
Fig. 1 is the Main Patterns of existing cognition and cooperation technology;
Fig. 2 is the Cognitive-Cooperation network scenarios figure that the present invention uses;
Fig. 3 is the flow chart of multiple access access of the present invention.
Embodiment
With reference to Fig. 2, the transfer of data scene of the Cognitive-Cooperation network that the present invention uses, comprise source node 1, destination node 2, secondary cooperative node 3, secondary cooperation destination node 4.Because node 1 is poor to the channel condition of node 2, directly transmission can't meet the service quality QoS demand of node 1, so node 1 need to find simultaneously to node 1 and node 2 channel qualities all good intermediate node cooperated, and node 3 such node just, it is all fine to the channel quality of node 1 and node 2 on the one hand, if it provides cooperation for node 1, can meet the QoS of survice demand of node 1; Node 3 self also has business will issue node 4 on the other hand, but as secondary user's, node 3 can not directly be used Internet resources, and need to could send with Internet resources the business of self after being cooperated for the primary user, so node 3 has very strong cooperation wish, but it must be after obtaining the cooperation identity could competitive channel the right to use.
With reference to Fig. 3, the application of multiple access method of the present invention in above-mentioned scene, comprise the steps:
Step 1: when source node 1 has business to send to destination node 2, at first according to self and the direct transmission rate of destination node and the QoS demand estimation of business, whether need to carry out cooperation transmission, if do not need cooperation transmission utilize IEEE 802.11b DCF protocol transmission data, otherwise perform step 2, start Cognitive-Cooperation multiple access access process.
Step 2: source node 1 sends the CCoopRTS frame to destination node 2, starts to preengage channel.
Described CCoopRTS frame comprises: whether need cooperation, the QoS demand of the transport service of applying for and the minimum of resources information that cooperates required, and the duration thresholding of CCoopRTS frame is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, T
cCTSfor the transmission time of CCTS frame, T
hRTSfor the transmission time of HRTS frame, T
mBWfor the maximum back off time of cooperative node, L
1for the data length that source node sends, unit is byte, R
sDfor the transmission rate of the Frame between source node and destination node, T
aCKfor the transmission time of ACK frame.
Source node sends the CCoopRTS frame and just means that it starts to preengage channel.
Because wireless transmission is carried out with the forms of broadcasting, the neighbors A of source node 1 can listen to the CCoopRTS frame that source node 1 sends, after the neighbors A of source node 1 receives the CCoopRTS frame, press the duration field of CCoopRTS frame, be that Frame adopts the required time of direct transmission of low speed to carry out the network allocation vector renewal, update mode is the duration thresholding in the CCoopRTS frame to be assigned to the network allocation vector of the neighbors A of source node 1.
Because duration thresholding in the CCoopRTS frame is set to the required time of direct transmission that Frame adopts low speed, therefore after the neighbors A of source node receives the CCoopRTS frame, its network allocation vector value arranges bigger than normal, still have residue after primary user's DTD, as shown in the shadow region in Fig. 3.
Step 3: destination node 2 receives the CCoopRTS frame that source node 1 sends and self is when idle condition, to source node 1 reply CCTS frame.
The duration thresholding of described CCTS frame is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, T
hRTSfor the transmission time of HRTS frame, T
mBWfor the maximum back off time of cooperative node, L
1for the data length that source node sends, unit is byte, R
sDfor the transmission rate of the Frame between source node and destination node, T
aCKfor the transmission time of ACK frame.
Because wireless transmission is carried out with the forms of broadcasting, the neighbors B of destination node 2 can listen to the CCTS frame that destination node 2 sends, after the neighbors B of destination node 2 receives the CCTS frame, duration field by the CCTS frame carries out the network allocation vector renewal, and update mode is the duration thresholding in the CCTS frame to be assigned to the network allocation vector of the neighbors B of destination node 2.
Step 4: the node competition cooperation identity that collaboration capabilities is arranged.
A plurality of neighborss of destination node 2 have all been received the CCTS frame, if these neighborss can meet the desired collaborative speed of CCTS frame, and in idle condition, be considered to have collaboration capabilities, these neighborss can calculate according to own service demand and primary and secondary user identity the back off time of each neighbors, entering the cooperation request keeps out of the way the stage, because secondary nodes 3 is better than the channel condition of other neighbors, and self there is business to send, so the back off time of secondary nodes 3 is the shortest, complete at first and keep out of the way and become secondary cooperative node, start to send the HRTS frame, application cooperation identity.
Back off time herein, relevant with the own service amount to node primary and secondary user identity, node resource, the back off time that is the primary user is shorter than secondary user's, and the back off time of the node that resource is many is shorter than the node that resource is few, and the back off time of the node that traffic carrying capacity is many is shorter than the node that traffic carrying capacity is few.
Other neighbors returns to silent status after receiving the HRTS frame of secondary cooperative node 3, no longer competition cooperation identity.
The duration thresholding of described HRTS frame is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, L
1for the data length that source node sends, unit is byte, R
sHfor the transmission rate of the Frame between source node and cooperative node, R
hDfor the transmission rate of the Frame between cooperative node and destination node, T
rTSfor the transmission time of RTS frame in IEEE 802.11b agreement, T
cTSfor the transmission time of CTS frame in IEEE 802.11b agreement, T
aCKfor the transmission time of ACK frame, L
2for the data length that cooperative node sends, R
hSDfor the transmission rate of cooperative node with the Frame between destination node that cooperates.
Because wireless transmission is carried out with the forms of broadcasting, the neighbors C of secondary cooperative node 3 can listen to the HRTS frame that secondary cooperative node 3 sends, after the neighbors C of secondary cooperative node 3 receives the HRTS frame, duration field by the HRTS frame carries out the network allocation vector renewal, and soon the duration thresholding in the HRTS frame is assigned to the network allocation vector of the neighbors C of secondary cooperative node 3.
Step 5: source node sends data by cooperation mode to cooperative node.
When source node 1 is received the HRTS frame that CCTS frame that destination node 2 sends and secondary cooperative node 3 send, show to exist cooperative node, source node 1 sends Frames by cooperation mode to secondary cooperative node 3 again; If, when source node 1 is only received the CCTS frame that destination node 2 sends and do not received the HRTS frame of secondary cooperative node 3 transmissions, show not exist cooperative node, source node 1 sends Frames to destination node 2; If, when source node 1 is not received the CCTS frame of destination node 2 transmissions, show bust this, source node 1 carries out data re-transmission.
Because wireless transmission is carried out with the forms of broadcasting, receive Frame around source node 1 and do not receive that the neighbors of HRTS frame can listen to the Frame that source node 1 sends, after the neighbors of receiving Frame around source node 1 and not receiving the HRTS frame is received Frame, duration field by Frame carries out the network allocation vector renewal, and update mode is the duration thresholding in Frame to be assigned to the network allocation vector of neighbors.
Step 6: after secondary cooperative node 3 is received the Frame of source node 1 transmission, forward to destination node 2 Frame of receiving, otherwise do not send any information.
Step 7: destination node 2 sends the ACK frames to source node 1 and secondary cooperative node 3 after receiving the Frame that source node 1 sends, and shows that the primary user is transmitted to complete.
Because wireless transmission is carried out with the forms of broadcasting, receive the ACK frame around destination node 2 and do not receive that the neighbors of HRTS frame can listen to the ACK frame that destination node 2 sends, after the neighbors of receiving the ACK frame around destination node 2 and not receiving the HRTS frame is received the ACK frame, duration field by the ACK frame carries out the network allocation vector renewal, and soon the duration thresholding in Frame is assigned to the network allocation vector of neighbors.
Step 8: after secondary cooperative node 3 is received the ACK frame of destination node 2 transmissions, to secondary cooperation destination node 4, send the RTS frames.
Because wireless transmission is carried out with the forms of broadcasting, the neighbors C of secondary cooperative node 3 can listen to the RTS frame that secondary cooperative node 3 sends, after the neighbors C of secondary cooperative node 3 receives the RTS frame, duration field by the RTS frame carries out the network allocation vector renewal, and soon the duration thresholding in the RTS frame is assigned to the network allocation vector of the neighbors C of secondary cooperative node 3.
Step 9: after secondary cooperation destination node 4 is received the RTS frame of secondary cooperative node 3 transmissions, to secondary cooperative node 3, send the CTS frames.
Because wireless transmission is carried out with the forms of broadcasting, the neighbors D of secondary cooperation destination node 4 can listen to the CTS frame that secondary cooperation destination node 4 sends, after the neighbors D of secondary cooperation destination node 4 receives the CTS frame, duration field by the CTS frame carries out the network allocation vector renewal, and soon the duration thresholding in the CTS frame is assigned to the network allocation vector of the neighbors D of secondary cooperation destination node 4.
Step 10: after secondary cooperative node 3 is received the CTS frame of secondary cooperation destination node 4 transmissions, to secondary cooperation destination node 4, send Frames.
Step 11: after secondary cooperation destination node 4 is received the Frame of secondary cooperative node 3 transmissions, to secondary cooperative node 3, send the ACK frames, whole Cognitive-Cooperation transmitting procedure finishes.
Terminological interpretation
IMS:IP Multimedia Subsystem, mean the IP multimedia system;
BE:Best Effort, the collaboration mode of expression " doing one's best ";
DCF:Distributed Coordination Function, mean distributed coordination function;
QoS:Quality of Service, mean service quality;
NAV:Network Allocation Vector, mean network allocation vector;
DIFS:Distributed Inter-Frame Space, mean distributed inter-frame space;
SIFS:Short Inter-Frame Space, mean short interFrameGap;
RTS:Request-To-Send, mean that request sends frame;
CCoopRTS:Cognitive Cooperative Request-To-Send, mean that the Cognitive-Cooperation request sends frame;
CTS:Clear To Send, mean to allow to send frame;
CCTS:Cooperative Clear To Send, mean that cooperation allows to send frame;
HRTS:Help Request To Send, mean that the cooperation request sends frame;
ACK:ACKnowledge Character, mean to confirm acknowledgement frame.
Claims (7)
1. the multiple access method in a Cognitive-Cooperation network, comprise the steps:
(1) when source node sends data, at first according to self and the direct transmission rate of destination node and the service quality QoS demand estimation of business, whether need to carry out cooperation transmission, if do not need utilize IEEE802.11b DCF protocol transmission data, otherwise perform step 2, start Cognitive-Cooperation multiple access access process;
(2) source node sends the Cognitive-Cooperation request to destination node and sends frame, and the CCoopRTS frame, start to preengage channel, and the neighbors of source node carries out the network allocation vector renewal according to the duration field in the CCoopRTS frame of receiving,
The CCoopRTS frame that described source node sends comprises and whether need cooperation, the QoS demand of the transport service of applying for and the minimum of resources information that cooperates required, and the duration thresholding in the CCoopRTS frame is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE802.11b agreement, T
cCTSfor the transmission time of CCTS frame, T
hRTSfor the transmission time of HRTS frame, T
mBWfor the maximum back off time of cooperative node, L
1for the data length that source node sends, unit is byte, R
sDfor the transmission rate of the Frame between source node and destination node, T
aCKsend the transmission time of ACK frame to source node for destination node;
(3) destination node correctly receives the CCoopRTS frame that sends to oneself and self is when idle condition, reply cooperation to source node and allow to send frame, be the CCTS frame, the neighbors of destination node carries out the network allocation vector renewal according to the duration field in the CCTS frame of receiving
The CCTS frame that described destination node sends, its duration thresholding is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE802.11b agreement, T
hRTSfor the transmission time of HRTS frame, T
mBWfor the maximum back off time of cooperative node, L
1for the data length that source node sends, unit is byte, R
sDfor the transmission rate of the Frame between source node and destination node, T
aCKsend the transmission time of ACK frame to source node for destination node;
(4) after all neighborss around source node correctly receive the CCTS frame, if these neighborss can meet the desired collaborative speed of CCTS frame, and in idle condition, according to own service demand and primary and secondary user identity, calculate the back off time of each neighbors, the neighbors that back off time finishes at first is cooperative node, cooperative node sends the cooperation request to source node and sends frame, it is the HRTS frame, to inform that source node oneself can help relay data, the neighbors of cooperative node carries out the network allocation vector renewal according to the duration field in the HRTS frame of receiving, otherwise there do not is cooperative node,
The HRTS frame that described cooperative node sends, its duration thresholding is set to:
In formula, T
sIFSfor the size of the short-and-medium interFrameGap of IEEE802.11b agreement, L
1for the data length that source node sends, R
sHfor the transmission rate of the Frame between source node and cooperative node, R
hDfor the transmission rate of the Frame between cooperative node and destination node, T
rTSfor the transmission time of IEEE802.11b RTS frame, T
cTSfor the transmission time of IEEE802.11b CTS frame, 2*T
aCKthe transmission time that sends the ACK frame for destination node to source node sends the transmission time sum of ACK frame, L with the destination node that cooperates to cooperative node
2for the data length that cooperative node sends, R
hSDfor the transmission rate of cooperative node with the Frame between destination node that cooperates;
(5) when source node correctly receives the CCTS that sends to oneself and HRTS frame, show to exist cooperative node, source node sends Frame to cooperative node; Source node is only received the CCTS frame, while not receiving the HRTS frame, shows not exist cooperative node, and source node sends Frame to destination node; When source node is not received the CCTS frame, show bust this, source node again sends the CCoopRTS frame to destination node and preengages channel; Receive Frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in Frame around source node;
(6), while having cooperative node, after cooperative node correctly receives the Frame that source node sends to oneself, forward the Frame of receiving to destination node, otherwise do not send any information;
(7) after destination node correctly receives the data that send to oneself, confirm to reply the ACK frame to source node and cooperative node transmission simultaneously, primary user's data send and finish, and around destination node, receive the ACK frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in the ACK frame;
(8) after cooperative node correctly receives the ACK frame that sends to oneself, send the RTS request to the cooperation destination node and send frame, be ready for sending data; The neighbors of cooperative node carries out the network allocation vector renewal according to the duration field in the RTS frame of receiving;
(9) after the cooperation destination node correctly receives the RTS frame that sends to oneself, to cooperative node, reply and allow to send the CTS frame, prepare to receive the data that cooperative node sends; The neighbors of cooperation destination node carries out the network allocation vector renewal according to the duration field in the CTS frame of receiving;
(10), after cooperative node correctly receives the CTS frame that sends to oneself, to the cooperation destination node, send data;
(11) after the cooperation destination node correctly receives the Frame that sends to oneself, to cooperative node, send the ACK frame, finish the Cognitive-Cooperation process.
2. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, the related back off time of step (4) wherein, relevant with the own service amount to node primary and secondary user identity, node resource, the back off time that is the primary user is shorter than secondary user's, the back off time of the node that resource is many is shorter than the node that resource is few, and the back off time of the node that traffic carrying capacity is many is shorter than the node that traffic carrying capacity is few.
3. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, wherein the neighbors of the described source node of step (2) carries out the network allocation vector renewal according to the duration field in the CCoopRTS frame of receiving, is the duration thresholding in the CCoopRTS frame to be assigned to the network allocation vector of the neighbors of source node; Receiving Frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in Frame around the described source node of step (5), is that the duration thresholding in Frame is assigned to the network allocation vector that source node is received Frame on every side and do not received the neighbors of HRTS frame.
4. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, wherein the neighbors of the described destination node of step (3) carries out the network allocation vector renewal according to the duration field in the CCTS frame of receiving, is the duration thresholding in the CCTS frame to be assigned to the network allocation vector of the neighbors of destination node; Wherein around the described destination node of step (7), receiving the ACK frame and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in the ACK frame, is that the duration thresholding in the ACK frame is assigned to the network allocation vector that destination node is received the ACK frame on every side and do not received the neighbors of HRTS frame.
5. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, wherein the neighbors of the described cooperative node of step (4) carries out the network allocation vector renewal according to the duration field in the HRTS frame of receiving, is the duration thresholding in the HRTS frame to be assigned to the network allocation vector of the neighbors of cooperative node;
6. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, wherein the neighbors of the described cooperative node of step (8) carries out the network allocation vector renewal according to the duration field in the RTS frame of receiving, is the duration thresholding in the RTS frame to be assigned to the network allocation vector of the neighbors of cooperative node.
7. the multiple access method in Cognitive-Cooperation network as claimed in claim 1, wherein the neighbors of the described cooperation destination node of step (9) carries out the network allocation vector renewal according to the duration field in the CTS frame of receiving, is the duration thresholding in the CTS frame to be assigned to the network allocation vector of the neighbors of cooperation destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110122848 CN102149210B (en) | 2011-05-12 | 2011-05-12 | Cognitive cooperation multiple access method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110122848 CN102149210B (en) | 2011-05-12 | 2011-05-12 | Cognitive cooperation multiple access method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102149210A CN102149210A (en) | 2011-08-10 |
| CN102149210B true CN102149210B (en) | 2013-12-25 |
Family
ID=44423124
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110122848 Expired - Fee Related CN102149210B (en) | 2011-05-12 | 2011-05-12 | Cognitive cooperation multiple access method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102149210B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102833761B (en) * | 2012-08-15 | 2015-08-19 | 上海交通大学 | In multichannel many primary users cognition network, time user assists the method for primary user's relaying |
| CN112188565A (en) * | 2020-09-24 | 2021-01-05 | 江苏中利电子信息科技有限公司 | Mobile ad hoc network multi-user cooperative transmission method based on network allocation vector |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364847A (en) * | 2008-09-25 | 2009-02-11 | 上海交通大学 | Cooperative communication method in cognitive radio |
| CN101931478A (en) * | 2010-09-02 | 2010-12-29 | 西安交通大学 | Relay transmission-based cognitive network spectrum sensing method |
| CN101977391A (en) * | 2010-10-15 | 2011-02-16 | 北京邮电大学 | Multiple terminal cooperative communication method in cognition wireless network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100944682B1 (en) * | 2007-01-12 | 2010-02-26 | 삼성전자주식회사 | Apparatus and method for joint power control in wireless communication system |
-
2011
- 2011-05-12 CN CN 201110122848 patent/CN102149210B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364847A (en) * | 2008-09-25 | 2009-02-11 | 上海交通大学 | Cooperative communication method in cognitive radio |
| CN101931478A (en) * | 2010-09-02 | 2010-12-29 | 西安交通大学 | Relay transmission-based cognitive network spectrum sensing method |
| CN101977391A (en) * | 2010-10-15 | 2011-02-16 | 北京邮电大学 | Multiple terminal cooperative communication method in cognition wireless network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102149210A (en) | 2011-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105722236B (en) | Resource allocation method for supporting full-duplex D2D communication in cellular network | |
| CN101651969B (en) | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) | |
| CN103763076B (en) | Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks | |
| EP2586267A1 (en) | Method and apparatus for device-to-device network coordination | |
| CN102036389B (en) | Multichannel diversity-based cognitive medium access control realizing method | |
| CN101754242B (en) | Access method of opportunistic cognitive multi-carrier link layer protocol | |
| TW201210361A (en) | Coexistence of multiple wireless networks | |
| WO2021180091A1 (en) | Method for cooperative communication, and device applied to cooperative communication | |
| Liu et al. | A cooperative MAC protocol with rapid relay selection for wireless ad hoc networks | |
| CN109451571B (en) | Joint resource allocation method in NOMA relay system | |
| CN102056325A (en) | Multiple access method based on multiple-input multiple-output antenna | |
| CN109673028A (en) | A kind of multi-cell cooperating method, access point and website | |
| WO2019001433A1 (en) | Multicast data transmission method, apparatus, device, and storage medium | |
| CN104486838A (en) | Multi-channel cooperative MAC (media access control) access method based on RSU (road side unit) assistance | |
| CN104754746A (en) | Cluster based multi-channel coordination MAC protocol achievement method of vehicle-mounted self-organizing network | |
| kumar Gupta et al. | Design and analysis of IEEE 802.11 based full duplex WLAN MAC protocol | |
| Wang et al. | Joint relay selection and resource allocation in cooperative device-to-device communications | |
| CN102149210B (en) | Cognitive cooperation multiple access method | |
| CN104145516B (en) | A kind of up channel disturbance coordination method, base station and centralized device | |
| Huang et al. | SAM-MAC: An efficient channel assignment scheme for multi-channel ad hoc networks | |
| Mumtaz et al. | Introduction to D2D communication | |
| Alonso-Zarate et al. | Multi-Radio Cooperative ARQ in wireless cellular networks: a MAC layer perspective | |
| CN104837211A (en) | Multi-channel multiple access method based on MIMO transmission mechanism | |
| Khalid et al. | Coherence time-based cooperative mac protocol 1 for wireless ad hoc networks | |
| Sun et al. | Multi-channel MAC Protocol in Cognitive Radio Networks. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131225 Termination date: 20200512 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |