CN102149210A - Cognitive cooperation multiple access method - Google Patents
Cognitive cooperation multiple access method Download PDFInfo
- Publication number
- CN102149210A CN102149210A CN2011101228488A CN201110122848A CN102149210A CN 102149210 A CN102149210 A CN 102149210A CN 2011101228488 A CN2011101228488 A CN 2011101228488A CN 201110122848 A CN201110122848 A CN 201110122848A CN 102149210 A CN102149210 A CN 102149210A
- Authority
- CN
- China
- Prior art keywords
- frame
- node
- neighbors
- cooperation
- 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.)
- Granted
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, the cognitive cooperation of multi-user during particularly heterogeneous network merges, a kind of specifically cognitive collaboration multi-address access method can be used in the heterogeneous network secondary user's to the competition of cooperation identity and channel.
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 present industry is paid close attention to.Yet, in the face of so complicated heterogeneous network, IMS technology in the conventional cellular network is hard to carry on, this has just facilitated the combination of the cognitive and cooperation technology of two emerging technologies, seek, excavate the available resources in the network by cognitive techniques on the one hand, come the utilization ratio of maximum resource on the other hand 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 main user's transmission performance by relaying master user's data, self also obtains more channel simultaneously and uses chance, and then reach the situation of " doulbe-sides' victory ".This core concept is that the research of isomery cooperation UNE is laid a good foundation.Fig. 1 is that several main pattern of the resource share method and the coordination strategy of current main user and cognitive user: Fig. 1 (a) is the most original " private network special use " resource occupation mode, there is not resource-sharing between network, the user of this network exclusively enjoys Internet resources, so leaving unused of resource also just must appear when light in traffic carrying capacity; Fig. 1 (b) is traditional cognitive style, and the user of other networks is as the operating position of secondary user's by these Internet resources of perception, in not disturbing this network under the prerequisite of main user's resources use right, and the slack resources of this network of use that can the chance formula.For secondary user's, this is a kind of passive type, the resource-sharing pattern of not having guarantee, and therefore institute can a loaded service type also be restricted greatly, and this situation can improve in the resource-sharing mode of collaboration type; Fig. 1 (c) has provided a kind of BE collaboration mode, and this moment, secondary user's just helped main user to transmit data as possible as long as main user has data.Secondary user's is compressed main user's transmission time also by relaying master user's data, brings the right to use of own service to resource.As can be seen, secondary user's has presented active resource-sharing situation under this pattern, but not strong to the QoS supportability of secondary user's.
Summary of the invention
The present invention be directed to the limitation and the imperfection of multiple access method in the present cognitive collaborative network, propose a kind of cognitive collaborative network multiple access method, strengthen the QoS supportability of secondary user's.
To achieve these goals, the present invention includes following steps:
When (1) source node sends data, at first judge according to the direct transmission rate of self and destination node and professional service quality QoS demand, whether need to carry out cooperation transmission, if do not need then utilize IEEE 802.11b DCF protocol transmission data, otherwise execution in step 2 starts cognitive cooperation multiple access access process;
(2) source node sends cognitive cooperation request transmit frame to destination node, and promptly the CCoopRTS frame begins to preengage channel, and the neighbors of source node carries out network allocation vector according to the duration field in the CCoopRTS frame of receiving to be upgraded;
When (3) destination node correctly receives the CCoopRTS frame that sends to oneself and self is in idle condition, reply cooperation to source node and allow transmit frame, be the CCTS frame, the neighbors of destination node carries out network allocation vector according to the duration field in the CCTS frame of receiving to be upgraded;
(4) after all neighborss around the source node correctly receive the CCTS frame, if these neighborss can satisfy the desired cooperation speed of CCTS frame, and be in idle condition, then calculate the back off time of each neighbors according to own service demand and primary and secondary user identity, the neighbors that back off time finishes at first is cooperative node, cooperative node sends cooperation request transmit frame to source node, it is the HRTS frame, to inform that source node oneself can help relay data, the neighbors of cooperative node carries out network allocation vector according to the duration field in the HRTS frame of receiving to be upgraded; Otherwise there is not cooperative node;
When (5) source node correctly receives the CCTS that sends to oneself and HRTS frame, show there is cooperative node that source node sends Frame to cooperative node; Source node is only received the CCTS frame, when not receiving the HRTS frame, shows there is not cooperative node that 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 around the source node and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in the Frame;
When (6) having cooperative node, cooperative node correctly receives after source node sends to the Frame of oneself, transmits the Frame of being received to destination node, otherwise does 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, main user data sends and finishes, and receives the ACK frame around the destination node and does 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 RTS request transmit frame, be ready for sending data to the cooperation destination node; The neighbors of cooperative node carries out network allocation vector according to the duration field in the RTS frame of receiving to be upgraded;
(9) after the cooperation destination node correctly receives the RTS frame that sends to oneself, reply permission to cooperative node and send the CTS frame, prepare to receive the data that cooperative node sends; The neighbors of cooperation destination node carries out network allocation vector according to the duration field in the CTS frame of receiving to be upgraded;
(10) after cooperative node correctly receives the CTS frame that sends to oneself, send data to the cooperation destination node;
(11) after the cooperation destination node correctly receives the Frame that sends to oneself, send the ACK frame, finish cognitive cooperating process to cooperative node.
The present invention compared with prior art has following advantage:
1), reduced the user's data transmission time than the multiple access technique of traditional cognitive mode.
Traditional cognitive multiple access technique does not adopt cooperation mode at present, and the present invention has compressed main user's transmission time by introducing cooperation mode, also for secondary user's has won the more transmission time, has improved the resource utilization of network.
2), improved the QoS supportability than the multiple access technique of BE collaboration mode.
In the multiple access technique of BE collaboration mode, after having only main user data transmission to finish, 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 has been transmitted data and divided into groups, transmit oneself a grouping at once, this QoS to secondary user's has stronger guarantee power, and it can the loaded service type also will be expanded to some extent.
Description of drawings
Fig. 1 is the main pattern of existing cognition and cooperation technology;
Fig. 2 is the cognitive collaborative network scene graph that the present invention uses;
Fig. 3 is the flow chart that multiple access of the present invention inserts.
Embodiment
With reference to Fig. 2, the transfer of data scene of the cognitive collaborative network that the present invention uses comprises source node 1, destination node 2, secondary cooperative node 3, secondary cooperation destination node 4.Because node 1 is relatively poor to the channel condition of node 2, directly transmission can't be satisfied the service quality QoS demand of node 1, so needing to seek, node 1 cooperates to node 1 and all good intermediate node of node 2 channel qualities simultaneously, and the so just node of node 3, 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, then can satisfy 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 use Internet resources, and need could use Internet resources to send the business of self after cooperating for main 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 comprises the steps:
Step 1: when source node 1 has business to send to destination node 2, at first judge according to the direct transmission rate of self and destination node and professional QoS demand, whether need to carry out cooperation transmission, if do not need cooperation transmission then utilize IEEE 802.11b DCF protocol transmission data, otherwise execution in step 2 starts cognitive cooperation multiple access access process.
Step 2: source node 1 sends the CCoopRTS frame to destination node 2, begins to preengage channel.
Whether described CCoopRTS frame comprises: need to cooperate, the QoS demand of the transport service of applying for and the minimum of resources information of cooperating required, and the duration thresholding of CCoopRTS frame is set to:
In the formula, T
SIFSBe the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, T
CCTSBe the transmission time of CCTS frame, T
HRTSBe the transmission time of HRTS frame, T
MBWBe the maximum back off time of cooperative node, L
1Be the data length that source node sends, unit is a byte, R
SDBe the transmission rate of the Frame between source node and the destination node, T
ACKBe the transmission time of ACK frame.
Source node sends the CCoopRTS frame and just means that it begins 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 network allocation vector to upgrade, update mode is that the duration thresholding in the CCoopRTS frame is composed network allocation vector to the neighbors A of source node 1.
Because the duration thresholding is set to the required time of direct transmission that Frame adopts low speed in the CCoopRTS frame, therefore its network allocation vector value was provided with bigger than normal after the neighbors A of source node received the CCoopRTS frame, after finishing, main user data transmission still has residue, shown in the shadow region among Fig. 3.
Step 3: when destination node 2 is received the CCoopRTS frame that source node 1 sends and self is in idle condition, reply the CCTS frame to source node 1.
The duration thresholding of described CCTS frame is set to:
In the formula, T
SIFSBe the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, T
HRTSBe the transmission time of HRTS frame, T
MBWBe the maximum back off time of cooperative node, L
1Be the data length that source node sends, unit is a byte, R
SDBe the transmission rate of the Frame between source node and the destination node, T
ACKBe 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, carry out network allocation vector by the duration field of CCTS frame and upgrade, update mode is that the duration thresholding in the CCTS frame is composed network allocation vector to 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 satisfy the desired collaborative speed of CCTS frame, and be in idle condition, then be considered to have collaboration capabilities, these neighborss can calculate the back off time of each neighbors according to own service demand and primary and secondary user identity, 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, finish at first and keep out of the way and become secondary cooperative node, begin to send the HRTS frame, application cooperation identity.
Back off time herein, relevant with node primary and secondary user identity, node resource with the own service amount, promptly main user's back off time is shorter than secondary user's, and the back off time of the node that resource is many is shorter than the few node of resource, and the back off time of the node that traffic carrying capacity is many is shorter than the few node of traffic carrying capacity.
Other neighbors is received after the HRTS frame of secondary cooperative node 3, returns silent status again, no longer competition cooperation identity.
The duration thresholding of described HRTS frame is set to:
In the formula, T
SIFSBe the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, L
1Be the data length that source node sends, unit is a byte, R
SHBe the transmission rate of the Frame between source node and the cooperative node, R
HDBe the transmission rate of the Frame between cooperative node and the destination node, T
RTSBe the transmission time of RTS frame in the IEEE 802.11b agreement, T
CTSBe the transmission time of CTS frame in the IEEE 802.11b agreement, T
ACKBe the transmission time of ACK frame, L
2Be the data length that cooperative node sends, R
HSDBe the transmission rate of cooperative node with the Frame between the destination node of cooperating.
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 composed the network allocation vector to 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 there is cooperative node that then 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 there is not cooperative node that then 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, then source node 1 carries out data re-transmission.
Because wireless transmission is carried out with the forms of broadcasting, receive Frame around the 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 the source node 1 and not receiving the HRTS frame is received Frame, carry out network allocation vector by the duration field of Frame and upgrade, update mode is that the duration thresholding in the Frame is composed network allocation vector to neighbors.
Step 6: after secondary cooperative node 3 is received the Frame of source node 1 transmission, transmit the Frame of receiving to destination node 2, 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 main user's transmission finishes.
Because wireless transmission is carried out with the forms of broadcasting, receive the ACK frame around the 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 the 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 the Frame is composed the network allocation vector to neighbors.
Step 8: after secondary cooperative node 3 is received the ACK frame of destination node 2 transmissions, send the RTS frames to secondary cooperation destination node 4.
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 composed the network allocation vector to 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, send the CTS frames to secondary cooperative node 3.
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 composed the network allocation vector to 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, send Frames to secondary cooperation destination node 4.
Step 11: after secondary cooperation destination node 4 is received the Frame of secondary cooperative node 3 transmissions, send the ACK frames to secondary cooperative node 3, whole cognitive cooperation transmission process finishes.
Terminological interpretation
IMS:IP Multimedia Subsystem, expression IP multimedia system;
BE:Best Effort, the collaboration mode of expression " doing one's best ";
DCF:Distributed Coordination Function, the expression distributed coordination function;
QoS:Quality of Service, expression service quality;
NAV:Network Allocation Vector, the expression network allocation vector;
DIFS:Distributed Inter-Frame Space, the expression distributed inter-frame space;
SIFS:Short Inter-Frame Space, the short interFrameGap of expression;
RTS:Request-To-Send, expression request transmit frame;
CCoopRTS:Cognitive Cooperative Request-To-Send, the cognitive cooperation request of expression transmit frame;
CTS:Clear To Send, expression allows transmit frame;
CCTS:Cooperative Clear To Send, the expression cooperation allows transmit frame;
HRTS:Help Request To Send, expression cooperation request transmit frame;
ACK:ACKnowledge Character, acknowledgement frame is confirmed in expression.
Claims (10)
1. the multiple access method in the cognitive collaborative network comprises the steps:
When (1) source node sends data, at first judge according to the direct transmission rate of self and destination node and professional service quality QoS demand, whether need to carry out cooperation transmission, if do not need then utilize IEEE 802.11b DCF protocol transmission data, otherwise execution in step 2 starts cognitive cooperation multiple access access process;
(2) source node sends cognitive cooperation request transmit frame to destination node, and promptly the CCoopRTS frame begins to preengage channel, and the neighbors of source node carries out network allocation vector according to the duration field in the CCoopRTS frame of receiving to be upgraded;
When (3) destination node correctly receives the CCoopRTS frame that sends to oneself and self is in idle condition, reply cooperation to source node and allow transmit frame, be the CCTS frame, the neighbors of destination node carries out network allocation vector according to the duration field in the CCTS frame of receiving to be upgraded;
(4) after all neighborss around the source node correctly receive the CCTS frame, if these neighborss can satisfy the desired collaborative speed of CCTS frame, and be in idle condition, then calculate the back off time of each neighbors according to own service demand and primary and secondary user identity, the neighbors that back off time finishes at first is cooperative node, cooperative node sends cooperation request transmit frame to source node, it is the HRTS frame, to inform that source node oneself can help relay data, the neighbors of cooperative node carries out network allocation vector according to the duration field in the HRTS frame of receiving to be upgraded; Otherwise there is not cooperative node;
When (5) source node correctly receives the CCTS that sends to oneself and HRTS frame, show there is cooperative node that source node sends Frame to cooperative node; Source node is only received the CCTS frame, when not receiving the HRTS frame, shows there is not cooperative node that 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 around the source node and do not receive that the neighbors of HRTS frame carries out the network allocation vector renewal according to the duration field in the Frame;
When (6) having cooperative node, cooperative node correctly receives after source node sends to the Frame of oneself, transmits the Frame of being received to destination node, otherwise does 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, main user data sends and finishes, and receives the ACK frame around the destination node and does 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 RTS request transmit frame, be ready for sending data to the cooperation destination node; The neighbors of cooperative node carries out network allocation vector according to the duration field in the RTS frame of receiving to be upgraded;
(9) after the cooperation destination node correctly receives the RTS frame that sends to oneself, reply permission to cooperative node and send the CTS frame, prepare to receive the data that cooperative node sends; The neighbors of cooperation destination node carries out network allocation vector according to the duration field in the CTS frame of receiving to be upgraded;
(10) after cooperative node correctly receives the CTS frame that sends to oneself, send data to the cooperation destination node;
(11) after the cooperation destination node correctly receives the Frame that sends to oneself, send the ACK frame, finish cognitive cooperating process to cooperative node.
2. cognitive collaborative network multiple access according to claim 1 inserts method for designing, the CCoopRTS frame that sends of the related source node of step (2) wherein, comprise whether need to cooperate, the QoS demand of the transport service of applying for and the minimum of resources information of cooperating required, and the duration thresholding in the CCoopRTS frame is set to:
In the formula, T
SIFSBe the size of the short-and-medium interFrameGap of IEEE 802.11b agreement, T
CCTSBe the transmission time of CCTS frame, T
HRTSBe the transmission time of HRTS frame, T
MBWBe the maximum back off time of cooperative node, L
1Be the data length that source node sends, unit is a byte, R
SDBe the transmission rate of the Frame between source node and the destination node, T
ACKBe the transmission time of ACK frame.
3. cognitive collaborative network multiple access according to claim 1 inserts method for designing, the CCTS frame that sends of the related destination node of step (3) wherein, and its duration thresholding is set to:
4. cognitive collaborative network multiple access according to claim 1 inserts method for designing, the HRTS frame that sends of the related cooperative node of step (4) wherein, and its duration thresholding is set to:
In the formula, R
SHBe the transmission rate of the Frame between source node and the cooperative node, R
HDTransmission rate for the Frame between cooperative node and the destination node.T
RTSBe the transmission time of IEEE 802.11b RTS frame, T
CTSBe the transmission time of IEEE 802.11b CTS frame, L
2Be the data length that cooperative node sends, R
HSDBe the transmission rate of cooperative node with the Frame between the destination node of cooperating.
5. cognitive collaborative network multiple access according to claim 1 inserts method for designing, the related back off time of step (4) wherein, relevant with node primary and secondary user identity, node resource with the own service amount, promptly main user's back off time is shorter than secondary user's, the back off time of the node that resource is many is shorter than the few node of resource, and the back off time of the node that traffic carrying capacity is many is shorter than the few node of traffic carrying capacity.
6. cognitive collaborative network multiple access according to claim 1 inserts method for designing, wherein the neighbors of the described source node of step (2) carries out network allocation vector according to the duration field in the CCoopRTS frame of receiving and upgrades, and is the duration thresholding in the CCoopRTS frame is composed network allocation vector to the neighbors of source node; The neighbors of receiving Frame around the described source node of step (5) and not receiving the HRTS frame carries out network allocation vector according to the duration field in the Frame to be upgraded, and is the duration thresholding in the Frame is composed to receiving Frame around the source node and not receiving the network allocation vector of the neighbors of HRTS frame.
7. cognitive collaborative network multiple access according to claim 1 inserts method for designing, wherein the neighbors of the described destination node of step (3) carries out network allocation vector according to the duration field in the CCTS frame of receiving and upgrades, and is the duration thresholding in the CCTS frame is composed network allocation vector to the neighbors of destination node; The neighbors of wherein receiving the ACK frame around the described destination node of step (7) and not receiving the HRTS frame carries out network allocation vector according to the duration field in the ACK frame to be upgraded, and is the duration thresholding in the ACK frame is composed to receiving the ACK frame around the destination node and not receiving the network allocation vector of the neighbors of HRTS frame.
8. cognitive collaborative network multiple access according to claim 1 inserts method for designing, wherein the neighbors of the described cooperative node of step (4) carries out network allocation vector according to the duration field in the HRTS frame of receiving and upgrades, and is the duration thresholding in the HRTS frame is composed network allocation vector to the neighbors of cooperative node.
9. cognitive collaborative network multiple access according to claim 1 inserts method for designing, wherein the neighbors of the described cooperative node of step (8) carries out network allocation vector according to the duration field in the RTS frame of receiving and upgrades, and is the duration thresholding in the RTS frame is composed network allocation vector to the neighbors of cooperative node.
10. cognitive collaborative network multiple access according to claim 1 inserts method for designing, wherein the neighbors of the described cooperation destination node of step (9) carries out network allocation vector according to the duration field in the CTS frame of receiving and upgrades, and is the duration thresholding in the CTS frame is composed network allocation vector to 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 true CN102149210A (en) | 2011-08-10 |
CN102149210B 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) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102833761A (en) * | 2012-08-15 | 2012-12-19 | 上海交通大学 | Method for secondary users assisting master users to relay in multichannel multi-master user cognitive network |
CN112188565A (en) * | 2020-09-24 | 2021-01-05 | 江苏中利电子信息科技有限公司 | Mobile ad hoc network multi-user cooperative transmission method based on network allocation vector |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080171565A1 (en) * | 2007-01-12 | 2008-07-17 | Samsung Electronics Co., Ltd. | Apparatus and method for joint power control in a wireless communication system |
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 |
-
2011
- 2011-05-12 CN CN 201110122848 patent/CN102149210B/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080171565A1 (en) * | 2007-01-12 | 2008-07-17 | Samsung Electronics Co., Ltd. | Apparatus and method for joint power control in a wireless communication system |
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 |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102833761A (en) * | 2012-08-15 | 2012-12-19 | 上海交通大学 | Method for secondary users assisting master users to relay in multichannel multi-master user cognitive network |
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 |
Also Published As
Publication number | Publication date |
---|---|
CN102149210B (en) | 2013-12-25 |
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) | |
US20110317569A1 (en) | Method and Apparatus for Device-to-Device Network Coordination | |
WO2015169025A1 (en) | Parallel data transmission processing method and device, and computer storage medium | |
US20120250632A1 (en) | Distributed scheduler design for multiuser detection enabled wireless mobile ad-hoc networks | |
TW200814808A (en) | Resource exchange discovery in a cellular communication system | |
CN103763076B (en) | Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks | |
WO2021180091A1 (en) | Method for cooperative communication, and device applied to cooperative communication | |
CN106664727A (en) | Methods and systems for protection and bandwidth selection for downlink and uplink frequency division multiple access communications | |
Maksymyuk et al. | Cooperative channels allocation in unlicensed spectrum for D2D assisted 5G cellular network | |
TW201210361A (en) | Coexistence of multiple wireless networks | |
US10021710B2 (en) | System and method for supporting coexistence of multiple radio | |
CN105119680B (en) | Multi-channel MAC protocols implementation method in the intensive In-vehicle networking of service | |
WO2015058411A1 (en) | Method and device for joint transmission | |
CN104904302A (en) | Methods, devices and computer program products improving device-to-device communication | |
CN102036389A (en) | Multichannel diversity-based cognitive medium access control realizing method | |
CN109673028A (en) | A kind of multi-cell cooperating method, access point and website | |
CN103354663A (en) | Distributed time slot distribution interference coordination method in wireless local area network | |
kumar Gupta et al. | Design and analysis of IEEE 802.11 based full duplex WLAN MAC protocol | |
CN105704723B (en) | Spectrum sharing method and communication station | |
Li et al. | A spatial clustering group division-based OFDMA access protocol for the next generation WLAN | |
Xu et al. | Device-to-device communication underlaying cellular networks: Connection establishment and interference avoidance | |
CN104837211B (en) | A kind of multi-channel multi-address access method based on MIMO transmission mechanism | |
TWI547113B (en) | Mimo wireless communication method and system | |
CN102149210B (en) | Cognitive cooperation multiple access method |
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 |