CN101754399B - Multi-channel collaboration multi-address access method and system - Google Patents
Multi-channel collaboration multi-address access method and system Download PDFInfo
- Publication number
- CN101754399B CN101754399B CN200910242562A CN200910242562A CN101754399B CN 101754399 B CN101754399 B CN 101754399B CN 200910242562 A CN200910242562 A CN 200910242562A CN 200910242562 A CN200910242562 A CN 200910242562A CN 101754399 B CN101754399 B CN 101754399B
- Authority
- CN
- China
- Prior art keywords
- channel
- groups
- node
- control channel
- data channel
- 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
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a multi-channel collaboration multi-address access method and a system. The method comprises the following steps: a source node selects a data channel from a channel state table and sends a CRTS packet on a control channel; when a target node which receives the CRTS packet judges that the data channel is available, the target node sends a CCTS packet on the control channel; when a neighbor node judges that the data channel is available and meets the collaboration conditions; the neighbor node sends a HA packet on the control channel and sends an RTH packet as a collaborative node; when the source node and the target node receive the RTH packet on the control channel, the source node and the target node respectively send an SCA packet and a DCA packet on the control channel, and the source node sends the data packet to the target node through the collaborative node on the data channel; and the target node sends a busy tone after receiving the data packet. On the one hand, the invention can solve the technical defects of low transmission reliability and the like of the existing data transmission due to conflicts, on the other hand, the invention can greatly reduce the application complexity and the cost.
Description
Technical field
The present invention relates to a kind of multiple access method and system, particularly a kind of multi-channel collaboration multi-address access method and system.
Background technology
Multiple access insert (be the medium access control, be called for short MAC) method be used to solve a plurality of nodes or user how fast, efficient, fair, the problem of shared channel resources reliably.In the radio communication, multipath fading is the key factor that influences communication quality.Extensively adopt diversity technique to reduce the influence of multipath fading in traditional radio communication.The so-called collection that divides just is meant to guaranteeing transmission quality; Transmitting terminal takes certain mode to transmit a plurality of copies of same signal through separate fading channel; Because the decline in each path is separate, thereby as long as has the signal of a paths enough just can guarantee reliable communication by force.Collaboration multi-address access method is to utilize collaboration diversity reasonably to arrange user's shared channel in the advantage that physical layer provides, thereby improves network performance.According to the initiation mode of cooperation, collaboration multi-address access method can be divided into the originating party initiation, the debit initiates and cooperative node is initiated three types.
The originating party initiating method generally is to send RTS (ready to send) grouping through modification by originating party to initiate cooperating relay; For example cooperation is ready for sending (cooperative RTS; CRTS) divide into groups, contain the address of a cooperative node that is chosen during CRTS divides into groups.The cooperative node that is chosen judges whether and can improve transmission performance (as improving speed, increasing transmission success rate etc.) through cooperating relay is provided according to communications status and self channel condition of peripheral neighbors; If could would send respective packets confirm the cooperation; For example cooperate clear to send (cooperative clear to send, CCTS).Debit's initiating method is different from before transfer of data the originating party initiating method of selected cooperative node, but at originating party after the debit sends packet, feed back reception result by the debit.If take defeat, the result of debit's feedback then means the initiation cooperation.The cooperative node initiating method be node after the mutual control information of receiving-transmitting sides, judge whether to participate in cooperation according to self instant messages.
Transfer of data adopts single channel mostly in the prior art said method; Process is set up in cooperation between the node and transfer of data afterwards all is on a channel, to accomplish; The collision that this will cause between packet and control grouping even packet and the packet causes bust this.Have multichannel multiple access access protocol now and after the success rate of data packet transmission reception, all directly reply the ACK grouping, also may cause ACK to divide into groups correctly to receive or other node reception grouping of ACK grouping interference at data channel.
For example, send to node A when Node B has packet, when node C has packet to send to node D, node C and Node B be exposed terminal each other, and all is the exposed terminal that is caused by the RTS transmitted in packets that Node B or node C send.At this moment,, will cause the collision between packet and the control grouping, cause bust this if other communication node uses identical data channel transmission packet to node C with node D with node A, other communication node to Node B.
And for example; Node B is sent packet to node A, node C to node D simultaneously; Wherein Node B and node A insert successfully prior to node C and node D, and send EOP posterior nodal point A in Node B when Node B is sent the ACK grouping to node A, and node C is also sending packet to node D; That certain time period the Node B place will clash, cause Node B to receive the ACK failure of dividing into groups.
For another example, when adopting the single channel transmission, node A possibly also not listen to the CTS grouping that node C sends, and just judges channel idle, sends RTS and divides into groups to Node B.If these two communication nodes to all shaking hands successfully, then are engraved in node C place at node A and clash when Node B begins to send packet, the data packet failure that causes node C receiving node D to send.It is thus clear that, even receiving-transmitting sides is shaken hands successfully in the single channel transmission, the conflict of packet still may take place, transmission reliability is low.
In addition, prior art adopts two and all need other supplementary technology support with the collaboration methods of upper signal channel, like directional antenna etc., has greatly increased application complexity and cost.
Summary of the invention
The purpose of this invention is to provide a kind of multi-channel collaboration multi-address access method and system, effectively solve technological deficiencies such as there being bigger conflict in the existing single channel cooperation technology transmitted in packets.
To achieve these goals, the invention provides a kind of multi-channel collaboration multi-address access method, comprising:
Step 1, according to storage and the Channel Status Table safeguarded, source node is selected a data channel, and on control channel, sends CRTS and divide into groups;
But step 2, receive the destination node that said CRTS divides into groups and judge the said data channel time spent, on control channel, send CCTS and divide into groups;
Said source node selects a data channel to comprise:
Whether step 11, judge and be 0 or be in transmit status the remaining time of transmitting employed data channel last time, be then to select to transmit employed data channel last time execution in step 2, otherwise execution in step 12 for use;
Whether, be then select j data channel, execution in step 2, otherwise execution in step 15 if step 14, judging and be 0 or be in transmit status the remaining time of j data channel;
Also comprise between said step 1 and the step 2: the neighbors of source node receives said CRTS and divides into groups; Said neighbors judges whether said data channel is available for source node; On control channel, sending CB when unavailable divides into groups; Source node receives said CB and divides into groups, and wait for execution in step 1 when next time transmitting after keeping out of the way a period of time, but the time spent continues to intercept control channel; Wait for that receiving CCTS divides into groups execution in step 2.
Said step 2 comprises: after destination node receives said CRTS grouping; Judge according to the Channel Status Table of its storage and maintenance whether the data channel in the said CRTS grouping is available; Do not send the CCTS grouping when unavailable and continue to intercept control channel, but the time spent is sent the CCTS grouping on control channel.
Said step 2 comprises: after destination node receives said CRTS grouping; Intercept the data channel in the said CRTS grouping, when on listening to said data channel, having node to send, judge that said data channel is unavailable; Do not send CCTS and divide into groups, and continue to intercept control channel; When on not listening to said data channel, having node to send, judge that said data channel can use, on control channel, send CCTS and divide into groups.
On the technique scheme basis; Neighbors listens on control channel that said CRTS divides into groups to divide into groups with CCTS that the back said data channel of judgement can be used and when self satisfying the cooperation condition; On control channel, send HA and divide into groups, and send RTH as cooperative node and divide into groups to comprise:
To achieve these goals, the present invention also provides a kind of multi-channel collaboration multiple access system, comprising:
Source node is used for selecting a data channel according to the Channel Status Table of storage and maintenance, and on control channel, sends CRTS and divide into groups;
Destination node is used to receive said CRTS and divides into groups, but judges the said data channel time spent, on control channel, sends CCTS and divides into groups;
Neighbors is used for dividing into groups and CCTS divides into groups according to the CRTS that listens to, judges that said data channel can be used and when self satisfying the cooperation condition, on control channel, sends HA and divide into groups, and send the RTH grouping as cooperative node;
Said source node also is used for: after receiving said RTH grouping on the control channel, on control channel, send SCA and divide into groups, on data channel, send packet through cooperative node to destination node; Said destination node also is used for: after receiving said RTH grouping on the control channel, on control channel, send DCA and divide into groups, after correctly receiving said packet, send busy tone.
Said source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table; Said selection module is used for selecting a data channel according to said Channel Status Table; Said first sending module is used to send said CRTS grouping, SCA divides into groups or packet; Said first receiver module is used to receive said CCTS grouping, HA divides into groups and RTH divides into groups, and said first sending module is connected with said selection module respectively with first receiver module.
Said destination node comprises second sending module and second receiver module; Said second receiver module is used to receive said CRTS grouping, RTH divides into groups or packet; Said second sending module is used to send said CCTS grouping, DCA divides into groups and busy tone, and said second sending module is connected with second receiver module.
Said neighbors comprises the 3rd sending module, the 3rd receiver module and judge module; Said the 3rd receiver module is used to receive said CRTS grouping, CCTS divides into groups or packet; Said second sending module is used to send said HA grouping, RTH divides into groups or packet; Said judge module is used to judge that said data channel is whether available and self whether satisfy the cooperation condition, and said the 3rd sending module is connected with said judge module respectively with the 3rd receiver module.
The present invention proposes a kind of multi-channel collaboration multi-address access method and system; Through in collaboration multi-address access method, using a plurality of data channel channels; Solved on the one hand to divide into groups to exist between the packet of existing single channel cooperation multiple access technique and with control and bigger the conflict caused technological deficiencies such as transmission reliability is low, improved network throughput on the other hand.The present invention sends SCA grouping, RTH grouping and DCA respectively through source node, cooperative node and destination node and divides into groups; Make neighbors its Channel Status Table that upgrades in time; Select corresponding data channel with the time-division situation; Effectively reduce the probability of data channel conflict, thereby guaranteed the successful transmission of packet; Send busy tone after successfully receiving packet through destination node,, therefore effectively avoided prior art ACK to divide into groups and to be divided into groups to disturb other node to receive the situation of dividing into groups by normal reception or ACK because busy tone does not take or take very little system bandwidth.
Description of drawings
Fig. 1 is the flow chart of multi-channel collaboration multi-address access method of the present invention;
Fig. 2 selects the flow chart of data channel for source node of the present invention;
Fig. 3 sends the flow chart that RTH divides into groups for neighbors of the present invention as cooperative node.
Embodiment
Through accompanying drawing and embodiment, technical scheme of the present invention is done further detailed description below.
Fig. 1 is the flow chart of multi-channel collaboration multi-address access method of the present invention, comprising:
Step 1, according to storage and the Channel Status Table safeguarded, source node is selected a data channel, and on control channel, sends CRTS and divide into groups;
But step 2, receive the destination node that said CRTS divides into groups and judge the said data channel time spent, on control channel, send CCTS and divide into groups;
The present invention is in technique scheme, and in order to realize cooperation, each node must be known channel quality each other; This just requires to listen to the grouping that other node sends; Therefore multichannel of the present invention is divided into two parts, control channel CCH and M data channel (be numbered CH1 respectively ...; CHM); Each node all has a unique ID in the network, and a Channel Status Table CSL (channel status list), the operating position of channel status table record channel are all stored and safeguarded to each node simultaneously; Node comes the maintenance channel state table alternately through intercept other internodal control grouping information at control channel, and the part form of Channel Status Table is as shown in the table:
| Channel | Remaining time (μ s) | Reiving/transmitting state |
| CH1 | 200 | 1 |
| CH2 | 15 | -1 |
| … | … | … |
| CHM | 0 | 1 |
Wherein reiving/transmitting state is respectively reception (1), sends (1), receives and dispatches (0), also records in the Channel Status Table in addition and transmits last time employed data channel and concluding time thereof.Node can obtain the information about channel occupancy from control is divided into groups when intercepting control channel, can judge that from different packet types this channel is used for receiving or is used for sending, and for cooperative node, data channel not only receives but also send.Accomplish confirmation of receipt through destination node with corresponding busy tone among the present invention; Avoided adjacent two sending nodes or two receiving nodes to use same channel to cause affirmation to divide into groups and the packet collision; Thereby adjacent two sending nodes or two receiving nodes can multipling channels, can improve the channel multiplexing rate so reiving/transmitting state is set in the Channel Status Table.Node always is updated to bigger value to less value remaining time through intercepting, and can guarantee the accuracy of channel status like this.If node need send (or reception) data at data channel CHK, this data channel remaining time is 0, and perhaps this channel is when sending (or reception) state; Show that this channel is available; For cooperative node, need be on data channel transceive data, so can not with the neighbors multipling channel; Can only use the data channel that is not used, promptly be 0 remaining time.
Transmission course of the present invention can be divided into two stages: channel obtains with the cooperative node choice phase with in the enterprising data transfer of the respective channel stage; The target that channel obtained with the cooperative node choice phase is to choose data channel (all being available concerning source node and destination node); And the also available cooperative node of this channel, the target in the enterprising data transfer of the respective channel stage is to guarantee the data packet transmission success.Procedure declaration is following particularly:
When source node had packet to send to destination node, source node continued to intercept control channel, and channel idle DIFS to be controlled is after the time; Source node reads Channel Status Table and judges whether to exist available data channel; If do not choose data channel, then keep intercepting control channel, upgrade Channel Status Table simultaneously; When channel to be controlled is idle once more, attempt selecting data channel once more; If choose data channel, then with this data channel as candidate's transmission channel, source node sends CRTS and divides into groups on control channel, and sets timer and wait for that receiving CCTS divides into groups, and comprises the information of selectable data channel during CRTS divides into groups.Destination node receives the CRTS grouping of issuing oneself in intercepting control channel after, judge whether the data channel in the CRTS grouping is available,, then continue to intercept control channel, do not do any answer if data channel is unavailable; If data channel can be used, then destination node is replied the CCTS grouping on control channel, and CCTS includes quality of channel information between source node and the destination node in dividing into groups.If source node is received the CCTS that destination node is sent and is divided into groups before timer expiry, then reset timer, (ready to help RTH) divides into groups to wait for the preparation cooperation that receives the cooperative node transmission; If source node is not received CCTS and is divided into groups, attempt newly once transmission after then keeping out of the way again, comprise channel selection procedure.In addition, if source node receives the CRTS that issues oneself when dividing into groups in intercepting control channel, also be to judge whether the data channel in the CRTS grouping is available, if data channel is unavailable, then continues to intercept control channel; If data channel can be used, then reply CCTS and divide into groups, and cancel this transmission.
The public neighbors (being assumed to be node R) of source node and destination node is received in intercepting control channel when CRTS divides into groups and CCTS divides into groups; Judge at first whether the data channel in the CRTS grouping is available; If but this data channel is the time spent to this neighbors, node R and then judge and self whether meet the cooperation condition (as reduce the transmission time or improve transmission reliability) then.In the practical application, node R also can be divided into groups according to CRTS earlier and CCTS divides into groups to judge whether self meets the cooperation condition.When if node R meets the cooperation condition, node R and then judge whether the data channel of CRTS in dividing into groups be available then.If data channel is unavailable or neighbors does not meet the cooperation condition, then continue to intercept control channel, do not do any answer; When data channel can with and neighbors when meeting the cooperation condition; Neighbors sends cooperation immediately and confirms (help acknowledgement on control channel; HA) divide into groups; There is cooperative node in expression; Keep out of the way according to channel quality and self loading level (traffic carrying capacity of sending in what or a certain period like the traffic carrying capacity of having sent) then and send RTH as cooperative node after corresponding a period of time and divide into groups, include the information of channel quality between source node and cooperative node, cooperative node and the destination node during RTH divides into groups.In the technique scheme, channel quality can be represented with supported flank speed.
Source node and destination node are after the RTH that receives the node R transmission on the control channel divides into groups; Mean the node R competition success; As the cooperative node of this transmission, then adopt the cooperation sending mode, source node and destination node are sent the source node channel respectively and are specified (source channel assignment on control channel; SCA) grouping and destination node channel are specified (destination channel assignment; DCA) grouping, source node to cooperative node transmission packet, includes information such as this data channel that transmits the plan use and holding time thereof during wherein SCA grouping and DCA divide into groups on data channel then.Cooperative node receives after source node sends to packet, on data channel, transmits this packet to destination node.After destination node receives the packet of cooperative node forwarding, on the corresponding busy tone channel of data channel, send busy tone.In addition, divide into groups if source node listens to HA, then there is not cooperative node in explanation, and then source node adopts direct sending mode, directly sends packet and gives destination node, and adopt respective rate according to the channel quality of feedback in the CCTS grouping.
Fig. 2 is the flow chart of source node selection data channel of the present invention, comprising:
Whether step 11, judge and be 0 or be in transmit status the remaining time of transmitting employed data channel last time, be then to select to transmit employed data channel last time execution in step 2, otherwise execution in step 12 for use;
Whether, be then select j data channel, execution in step 2, otherwise execution in step 15 if step 14, judging and be 0 or be in transmit status the remaining time of j data channel;
In technique scheme, alternative condition be nodal point separation transmission end time last time T greater than k * Tmax but less than Tmax, back off time is Tmax-T, Tmax is a grouping with the required time of basic rate transmission, k is the coefficient of (0,1).The present invention is for fear of selecting there is the conflicting data channel; So preferentially selecting for use in the last time transmission course least maybe occupied data channel; It is the data channel that last time, transmission was used; And select j data channel is to consider source node ID and destination node ID, reduces different nodes to selecting the probability of identical data channel, therefore effectively reduces the probability of data channel conflict.
In technique scheme, whether destination node judgment data channel is available can adopt two kinds of means.A kind of means are; After destination node receives the CRTS grouping; Judge according to the Channel Status Table of destination node storage and maintenance whether the data channel of selecting for use in the CRTS grouping is available, continues to intercept control channel when unavailable, but the time spent is then sent the CCTS grouping on control channel.Another kind of means are, destination node receives CRTS divide into groups after, forward on the data channel that CRTS selects for use in dividing into groups and intercept, when on listening to this data channel, having node to send, judge that this data channel is unavailable, continue to intercept control channel; When on not listening to this data channel, having node to send, judge that this data channel can use, on control channel, send CCTS and divide into groups.Certainly, because a kind of means in back need switching channels, so can expend a period of time.
In technique scheme, can also comprise that neighbors sends the step that CB divides into groups, detailed process is: the CRTS grouping that the neighbors of source node sends through intercepting control channel reception sources node; Neighbors judges whether the data channel in the CRTS grouping is available concerning source node; When data channel was unavailable, neighbors transmitting channel on control channel is busy, and (channel busy CB) divided into groups; But when the data channel time spent, neighbors continues to intercept control channel.Source node is intercepted in the control channel process after sending the CRTS grouping, divides into groups if receive the CB that neighbors sends, and the data channel of selecting for use before showing is unavailable; Then abandon using this channel; Attempt newly once transmission after keeping out of the way a period of time, comprise and reselect data channel, do not divide into groups if receive CB; Then continue to intercept control channel, wait for that the CCTS that destination node is sent divides into groups.
Fig. 3 sends the flow chart that RTH divides into groups for neighbors of the present invention as cooperative node.In the said technical scheme of Fig. 1, step 3 comprises:
When neighbors judgment data channel can with and when self meeting the cooperation condition; Neighbors at first sends HA and divides into groups; There is cooperative node in expression, keeps out of the way according to channel quality and self loading level (traffic carrying capacity of sending in what or a certain period like the traffic carrying capacity of having sent) then and sends RTH as cooperative node after a period of time and divide into groups.Channel quality is good more, and load is more little, and then back off time is short more, and the probability of competition success is also just big more, and the long neighbors of other back off time is listening to after the RTH that early sends divides into groups, thereby abandons competition.
In technique scheme; To send the purpose that SCA divides into groups to divide into groups with DCA respectively be to notify all neighborss to stop to compete for source node and destination node in the step 4; Let source node begin to send packet; And announce that to all neighborss of source node and destination node the transmission that is about to carry out need take data channel and holding time thereof, it also is to have announced the channel operating position to neighbors that the RTH of node R transmission simultaneously divides into groups.Owing to transmission rate along with channel quality changes; Therefore the time that each transmission takies data channel is not steady state value just also; SCA grouping, RTH grouping and DCA grouping that the present invention sends respectively through source node, cooperative node and destination node are set; On control channel, in time announce data channel and time of taking, make neighbors its Channel Status Table that upgrades in time, therefore effectively guaranteed the successful transmission of packet to all neighborss.
In the existing multi-channel multi-address access method; Destination node successfully receives to be employed in usually after the packet and directly replys the mode that ACK divides into groups on the data channel and show transmission success, but this may cause ACK to divide into groups to be divided into groups to disturb other node to receive by normal reception or ACK dividing into groups.After the object of the invention node successfully receives packet; Through send one section with long-time busy tones such as ACK grouping; Busy tone plays the effect that ACK divides into groups; Because busy-back signal and data channel can be not overlapping, so effectively avoided prior art ACK to divide into groups and to be divided into groups to disturb other node to receive the situation of dividing into groups by normal reception or ACK.
On aforementioned techniques scheme basis; The present invention also provides a kind of distributed collaborative multiple access system; Comprise source node, destination node and neighbors, source node is used for selecting a data channel according to the Channel Status Table of storage and maintenance, and on control channel, sends CRTS and divide into groups; Destination node is used to receive said CRTS and divides into groups, but judges the said data channel time spent, on control channel, sends CCTS and divides into groups; Neighbors is used for dividing into groups and CCTS divides into groups according to the CRTS that listens to, judges that said data channel can be used and when self satisfying the cooperation condition, on control channel, sends HA and divide into groups, and send the RTH grouping as cooperative node; Further, said source node also is used for: after receiving said RTH grouping on the control channel, on control channel, send SCA and divide into groups, on data channel, send packet through cooperative node to destination node; Said destination node also is used for: after receiving said RTH grouping on the control channel, on control channel, send DCA and divide into groups, after correctly receiving said packet, send busy tone.
Said source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table; Said selection module is used for selecting a data channel according to said Channel Status Table; Said first sending module is used to send said CRTS grouping, SCA divides into groups or packet; Said first receiver module is used to receive said CCTS grouping, HA divides into groups and RTH divides into groups, and said first sending module is connected with said selection module respectively with first receiver module.Said destination node comprises second sending module and second receiver module; Said second receiver module is used to receive said CRTS grouping, RTH divides into groups or packet; Said second sending module is used to send said CCTS grouping, DCA divides into groups and busy tone, and said second sending module is connected with second receiver module.Said neighbors comprises the 3rd sending module, the 3rd receiver module and judge module; Said the 3rd receiver module is used to receive said CRTS grouping, CCTS divides into groups or packet; Said second sending module is used to send said HA grouping, RTH divides into groups or packet; Said judge module is used to judge that said data channel is whether available and self whether satisfy the cooperation condition, and said the 3rd sending module is connected with said judge module respectively with the 3rd receiver module.
Select contents such as module and judge module in aforementioned distributed collaborative multiple access method technical scheme, to explain in the distributed collaborative multiple access system of the present invention, repeat no more.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be accomplished through the relevant hardware of program command; Aforesaid program can be stored in the computer read/write memory medium; This program the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
What should explain at last is: above embodiment is only unrestricted in order to technical scheme of the present invention to be described; Although the present invention is specified with reference to preferred embodiment; Those of ordinary skill in the art is to be understood that; Can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and the scope of technical scheme of the present invention.
Claims (10)
1. a multi-channel collaboration multi-address access method is characterized in that, comprising:
Step 1, according to storage and the Channel Status Table safeguarded, source node is selected a data channel, and on control channel, sends cooperation and be ready for sending CRTS and divide into groups;
But step 2, receive the destination node that said CRTS divides into groups and judge the said data channel time spent, on control channel, send cooperation clear to send CCTS and divide into groups;
Step 3, neighbors listen on control channel that said CRTS divides into groups and CCTS divides into groups, and the back judges that said data channel can use and when self satisfying the cooperation condition; On control channel, send cooperation and confirm the HA grouping, and prepare cooperation RTH grouping as sending after the cooperative node;
Step 4, source node and destination node are after receiving said RTH grouping on the control channel; On control channel, send the source node channel respectively and specify SCA to divide into groups and destination node channel appointment DCA grouping, said source node sends packet through said cooperative node to destination node on said data channel;
Step 5, destination node are sent busy tone after correctly receiving said packet.
2. multi-channel collaboration multi-address access method according to claim 1 is characterized in that, said source node selects a data channel to comprise:
Whether step 11, judge and be 0 or be in transmit status the remaining time of transmitting employed data channel last time, be then to select to transmit employed data channel last time execution in step 2, otherwise execution in step 12 for use;
Step 12, judge apart from last time transmission end time whether satisfy condition, be then behind back off time, to wait for execution in step 1 when next time transmitting, otherwise execution in step 13; Wherein, said condition be nodal point separation transmission end time last time T greater than k * Tmax but less than Tmax, said back off time is Tmax-T, Tmax is a grouping with the required time of basic rate transmission, k is the coefficient of (0,1);
Step 13, j data channel of selection, j=(source node ID+ destination node ID) mod (channel number M), wherein mod is the complementation operator;
Whether, be then select j data channel, execution in step 2, otherwise execution in step 15 if step 14, judging and be 0 or be in transmit status the remaining time of j data channel;
Step 15, then to select other remaining time for use be 0 or be in the data channel of transmit status, and execution in step 2 when choosing, and then behind back off time, wait for execution in step 1 when next time transmitting when not choosing.
3. multi-channel collaboration multi-address access method according to claim 1 is characterized in that, also comprises between said step 1 and the step 2: the neighbors of source node receives said CRTS and divides into groups; Said neighbors judges whether said data channel is available for source node; The busy CB grouping of transmitting channel on control channel when unavailable; Source node receives said CB and divides into groups, and wait for execution in step 1 when next time transmitting after keeping out of the way a period of time, but the time spent continues to intercept control channel; Wait for that receiving CCTS divides into groups execution in step 2.
4. multi-channel collaboration multi-address access method according to claim 1; It is characterized in that; Said step 2 comprises: after destination node receives said CRTS grouping; Judge according to the Channel Status Table of its storage and maintenance whether the data channel in the said CRTS grouping is available, do not send the CCTS grouping when unavailable and continue to intercept control channel, but the time spent is sent the CCTS grouping on control channel.
5. multi-channel collaboration multi-address access method according to claim 1; It is characterized in that said step 2 comprises: after destination node receives said CRTS grouping, intercept the data channel in the said CRTS grouping; When on listening to said data channel, having node to send; Judge that said data channel is unavailable, do not send CCTS and divide into groups, and continue to intercept control channel; When on not listening to said data channel, having node to send, judge that said data channel can use, on control channel, send CCTS and divide into groups.
6. according to arbitrary described multi-channel collaboration multi-address access method in the claim 1～5; It is characterized in that; Neighbors listens on control channel that said CRTS divides into groups to divide into groups with CCTS that the back said data channel of judgement can be used and when self satisfying the cooperation condition; On control channel, send HA and divide into groups, and send RTH as cooperative node and divide into groups to comprise:
Step 31, neighbors receive said CRTS grouping on control channel and CCTS divides into groups;
Step 32, judge whether the said CRTS data channel in dividing into groups is available, be execution in step 33 then, otherwise continue to intercept control channel;
Step 33, judge whether self satisfies the cooperation condition, be execution in step 34 then, otherwise continue to intercept control channel;
Step 34, said neighbors send HA and divide into groups on control channel;
Step 35, set back off time according to channel quality and self loading level;
Step 36, intercept control channel;
Step 37, judging whether to keep out of the way end, is execution in step 38 then, otherwise execution in step 36;
Step 38, judging whether to listen to the RTH that other neighbors sends and divide into groups, is then to continue to intercept control channel, otherwise execution in step 39;
Step 39, on control channel, send RTH as cooperative node and divide into groups.
7. a multi-channel collaboration multiple access system is characterized in that, comprising:
Source node is used for selecting a data channel according to the Channel Status Table of storage and maintenance, and on control channel, sends CRTS and divide into groups;
Destination node is used to receive said CRTS and divides into groups, but judges the said data channel time spent, on control channel, sends CCTS and divides into groups;
Neighbors is used for dividing into groups and CCTS divides into groups according to the CRTS that listens to, judges that said data channel can be used and when self satisfying the cooperation condition, on control channel, sends HA and divide into groups, and send the RTH grouping as cooperative node;
Said source node also is used for: after receiving said RTH grouping on the control channel, on control channel, send SCA and divide into groups, on data channel, send packet through cooperative node to destination node; Said destination node also is used for: after receiving said RTH grouping on the control channel, on control channel, send DCA and divide into groups, after correctly receiving said packet, send busy tone.
8. multi-channel collaboration multiple access system according to claim 7; It is characterized in that; Said source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table; Said selection module is used for selecting a data channel according to said Channel Status Table; Said first sending module is used to send said CRTS grouping, SCA divides into groups or packet, and said first receiver module is used to receive said CCTS grouping, HA divides into groups and RTH divides into groups, and said first sending module is connected with said selection module respectively with first receiver module.
9. multi-channel collaboration multiple access system according to claim 7; It is characterized in that; Said destination node comprises second sending module and second receiver module; Said second receiver module is used to receive said CRTS grouping, RTH divides into groups or packet, and said second sending module is used to send said CCTS grouping, DCA divides into groups and busy tone, and said second sending module is connected with second receiver module.
10. multi-channel collaboration multiple access system according to claim 7; It is characterized in that; Said neighbors comprises the 3rd sending module, the 3rd receiver module and judge module; Said the 3rd receiver module is used to receive said CRTS grouping, CCTS divides into groups or packet; Said second sending module is used to send that said HA divides into groups, RTH divides into groups or packet, and said judge module is used to judge that said data channel is whether available and self whether satisfy the cooperation condition, and said the 3rd sending module is connected with said judge module respectively with the 3rd receiver module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910242562A CN101754399B (en) | 2009-12-16 | 2009-12-16 | Multi-channel collaboration multi-address access method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910242562A CN101754399B (en) | 2009-12-16 | 2009-12-16 | Multi-channel collaboration multi-address access method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101754399A CN101754399A (en) | 2010-06-23 |
| CN101754399B true CN101754399B (en) | 2012-09-12 |
Family
ID=42480584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910242562A Expired - Fee Related CN101754399B (en) | 2009-12-16 | 2009-12-16 | Multi-channel collaboration multi-address access method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101754399B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102014467B (en) * | 2010-11-09 | 2013-08-07 | 北京航空航天大学 | Multi-relay selection cooperative transmission method and system |
| CN102006630B (en) * | 2010-11-10 | 2013-08-07 | 北京航空航天大学 | Multichannel cooperative data transmission method and system |
| CN102056324B (en) * | 2010-12-22 | 2013-02-06 | 中国人民解放军理工大学 | Cooperative carrier sense multiple access (CSMA) method based on token control conflict analysis |
| CN102170665B (en) * | 2011-04-01 | 2013-08-07 | 北京航空航天大学 | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service |
| CN102123020B (en) * | 2011-04-01 | 2013-04-10 | 北京航空航天大学 | Distributed cooperative multiple access method and system providing guarantee for quality of service |
| CN102625367B (en) * | 2012-03-12 | 2014-07-02 | 暨南大学 | Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network |
| CN103281750B (en) * | 2013-05-31 | 2015-12-02 | 北京航空航天大学 | Guarantee service quality and the collaboration multi-address access method of fairness and system |
| SG11201910769WA (en) * | 2017-06-20 | 2020-01-30 | Nchain Holdings Ltd | System and method of multi-round token distribution using a blockchain network |
| CN110572849B (en) * | 2018-06-05 | 2023-03-10 | 北京小米松果电子有限公司 | Method, device and storage medium for sending data block and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050068741A (en) * | 2003-12-30 | 2005-07-05 | 삼성전자주식회사 | Method for providing reliable data transfer using direct link and multi-channel |
| WO2009008934A2 (en) * | 2007-04-13 | 2009-01-15 | Hart Communication Foundation | Routing packets on a network using directed graphs |
| CN101388849A (en) * | 2008-10-29 | 2009-03-18 | 北京航空航天大学 | Method for selecting collaboration node |
| CN101583161A (en) * | 2009-05-26 | 2009-11-18 | 北京邮电大学 | Cooperative node unit selection method and device |
-
2009
- 2009-12-16 CN CN200910242562A patent/CN101754399B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050068741A (en) * | 2003-12-30 | 2005-07-05 | 삼성전자주식회사 | Method for providing reliable data transfer using direct link and multi-channel |
| WO2009008934A2 (en) * | 2007-04-13 | 2009-01-15 | Hart Communication Foundation | Routing packets on a network using directed graphs |
| CN101388849A (en) * | 2008-10-29 | 2009-03-18 | 北京航空航天大学 | Method for selecting collaboration node |
| CN101583161A (en) * | 2009-05-26 | 2009-11-18 | 北京邮电大学 | Cooperative node unit selection method and device |
Non-Patent Citations (1)
| Title |
|---|
| 刘思杨等.LTE_Advanced系统中的协作多点传输技术.《电信网技术》.2009,(第2009年第9期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101754399A (en) | 2010-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101754399B (en) | Multi-channel collaboration multi-address access method and system | |
| US6298053B1 (en) | Method and apparatus for connection handoff between connected radios | |
| CN102026297B (en) | Method, system and node for channel negotiation | |
| US6424645B1 (en) | TDMA radio communication system achieving simultaneous assignment of channels to multiple terminal stations | |
| CN100512092C (en) | Multi-channel selection multi-address access method | |
| CN102006630B (en) | Multichannel cooperative data transmission method and system | |
| US20100226308A1 (en) | node- arbitrated media access control protocol for ad hoc broadcast networks carrying ephemeral information | |
| KR20080016943A (en) | Avoding exposed node problems in wireless local area networks | |
| AU2006284932A1 (en) | Media access control architecture | |
| CN100499915C (en) | Multi-channel multi-address access method | |
| KR19980703478A (en) | Method and apparatus of wireless communication | |
| US20150023314A1 (en) | Reassignment of Unused Portions of a Transmission Unit in a Network | |
| US6487186B1 (en) | Method and apparatus for managing communication resources using bootstrap slots | |
| CN102014467B (en) | Multi-relay selection cooperative transmission method and system | |
| CN100559738C (en) | The multi-address access method according to requirement that the band conflict is decomposed | |
| CN101090524A (en) | Adapter distribution multi-address access method | |
| JP2000261399A (en) | Base station, terminal and communication method | |
| CN102387550A (en) | Hierarchical cooperation access method and system as well as cooperative nodes | |
| CN102378390A (en) | Fast collaborative access control method and fast collaborative access control system | |
| CN101141176A (en) | Distributed acquisition multi-access method | |
| JP3235041B2 (en) | TDD wireless communication system | |
| WO2014077673A1 (en) | System and method for frequency channel allocation in a wireless communication network | |
| TWI592048B (en) | Resource selection method and wireless device | |
| EP1183825B1 (en) | A distributed wireless medium access control protocol with support for isochronous services | |
| EP3962025B1 (en) | Communication device scheduling method, scheduling server, method for reporting data and communication device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120912 Termination date: 20161216 |