CN101754399A - Multi-channel collaboration multi-address access method and system - Google Patents

Multi-channel collaboration multi-address access method and system Download PDF

Info

Publication number
CN101754399A
CN101754399A CN200910242562A CN200910242562A CN101754399A CN 101754399 A CN101754399 A CN 101754399A CN 200910242562 A CN200910242562 A CN 200910242562A CN 200910242562 A CN200910242562 A CN 200910242562A CN 101754399 A CN101754399 A CN 101754399A
Authority
CN
China
Prior art keywords
grouping
channel
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.)
Granted
Application number
CN200910242562A
Other languages
Chinese (zh)
Other versions
CN101754399B (en
Inventor
张军
刘凯
刘云
徐桢
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN200910242562A priority Critical patent/CN101754399B/en
Publication of CN101754399A publication Critical patent/CN101754399A/en
Application granted granted Critical
Publication of CN101754399B publication Critical patent/CN101754399B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Multi-channel collaboration multi-address access method and system
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.So-called diversity just is meant to guaranteeing transmission quality, transmitting terminal takes harvesting method to transmit a plurality of copies of same signal by 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 classes.
The originating party initiating method generally is to send RTS (ready to send) grouping through modification by originating party to initiate cooperating relay, and for example CRTS (cooperative RTS) divides into groups, and contains the address of a chosen cooperative node in the CRTS grouping.Chosen cooperative node judges whether and can improve transmission performance (as improving speed, increasing transmission success rate etc.) by cooperating relay is provided according to communications status and self channel condition of peripheral neighbors, if could would send respective packets and confirm cooperation, CCTS (cooperative clear to send) for example.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 to finish on a channel, 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 the ACK grouping correctly not receive or other node reception grouping of ACK grouping interference at data channel.
For example, send to node A, node C when having packet to send to node D when Node B has packet, 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 sends packet to node A, node C simultaneously to node D, wherein Node B and node A insert successfully prior to node C and node D, and send EOP posterior nodal point A when Node B sends the ACK grouping to node A in Node B, node C is also sending packet to node D, that certain time period the Node B place will clash, cause Node B to receive ACK grouping failure.
For another example, when adopting the single channel transmission, node A may 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.As seen, even receiving-transmitting sides is shaken hands successfully in the single channel transmission, the conflict of packet may take place still, 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, as 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 sends the CRTS grouping on control channel;
But step 2, the destination node that receives described CRTS grouping are judged the described data channel time spent, send the CCTS grouping on control channel;
Step 3, neighbors on control channel, listen to described CRTS grouping and CCTS grouping back judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and as sending the RTH grouping after the cooperative node;
Step 4, source node and destination node send SCA grouping and DCA grouping respectively on control channel after receiving described RTH grouping on the control channel, described source node sends packet by described cooperative node to destination node on described data channel;
Step 5, destination node send busy tone after correctly receiving described packet.
Described source node selects a data channel to comprise:
Step 11, judge whether 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, described condition be nodal point separation transmission end time last time T greater than k * Tmax but less than Tmax, described 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;
Step 14, judge whether be 0 or be in transmit status the remaining time of j data channel, be then to select j data channel for use, execution in step 2, otherwise execution in step 15;
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 wait for execution in step 1 when next time transmitting when not choosing behind back off time.
Also comprise between described step 1 and the step 2: the neighbors of source node receives described CRTS grouping; Described neighbors judges whether described data channel is available for source node, on control channel, send the CB grouping when unavailable, source node receives described CB grouping, 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 and receive CCTS grouping, execution in step 2.
Described step 2 comprises: after destination node receives described CRTS grouping, judge according to the Channel Status Table of its storage and maintenance whether the data channel in the described CRTS grouping is available, do not send the CCTS grouping when unavailable and continue to intercept control channel, but the time spent sends the CCTS grouping on control channel.
Described step 2 comprises: after destination node receives described CRTS grouping, intercept the data channel in the described CRTS grouping, when on listening to described data channel, having node to send, judge that described data channel is unavailable, do not send the CCTS grouping, and continue to intercept control channel; When on not listening to described data channel, having node to send, judge that described data channel can use, on control channel, send the CCTS grouping.
On the technique scheme basis, neighbors on control channel, listen to described CRTS grouping and the described data channel of CCTS grouping back judgement can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and grouping comprises as cooperative node transmission RTH:
Step 31, neighbors receive described CRTS grouping and CCTS grouping on control channel;
Step 32, judge whether the data channel in the described CRTS grouping 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, described neighbors send the HA grouping 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 grouping that other neighbors sends, is then to continue to intercept control channel, otherwise execution in step 39;
Step 39, on control channel, send RTH grouping as cooperative node.
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 sends the CRTS grouping on control channel;
Destination node is used to receive described CRTS grouping, but judges the described data channel time spent, sends the CCTS grouping on control channel;
Neighbors is used for according to the CRTS that listens to grouping and CCTS grouping, judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and send RTH as cooperative node and divide into groups;
Described source node also is used for: after receiving described RTH grouping on the control channel, send the SCA grouping on control channel, send packet by cooperative node to destination node on data channel; Described destination node also is used for: after receiving described RTH grouping on the control channel, send the DCA grouping on control channel, send busy tone after correctly receiving described packet.
Described source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table, described selection module is used for selecting a data channel according to described Channel Status Table, described first sending module is used to send described CRTS grouping, SCA grouping or packet, described first receiver module is used to receive described CCTS grouping, HA grouping and RTH grouping, and described first sending module is connected with described selection module respectively with first receiver module.
Described destination node comprises second sending module and second receiver module, described second receiver module is used to receive described CRTS grouping, RTH grouping or packet, described second sending module is used to send described CCTS grouping, DCA grouping and busy tone, and described second sending module is connected with second receiver module.
Described neighbors comprises the 3rd sending module, the 3rd receiver module and judge module, described the 3rd receiver module is used to receive described CRTS grouping, CCTS grouping or packet, described second sending module is used to send described HA grouping, RTH grouping or packet, described judge module is used to judge that described data channel is whether available and self whether satisfy the cooperation condition, and described the 3rd sending module is connected with described judge module respectively with the 3rd receiver module.
The present invention proposes a kind of multi-channel collaboration multi-address access method and system, by in collaboration multi-address access method, using a plurality of data channel channels, solved on the one hand to exist between the packet of existing single channel cooperation multiple access technique and with the control grouping 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 grouping respectively by source node, cooperative node and destination node, 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 by destination node,, therefore effectively avoided prior art ACK grouping normally not received or the ACK grouping disturbs other node to receive the situation of grouping 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 of RTH grouping as cooperative node for neighbors of the present invention.
Embodiment
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
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 sends the CRTS grouping on control channel;
But step 2, the destination node that receives described CRTS grouping are judged the described data channel time spent, send the CCTS grouping on control channel;
Step 3, neighbors on control channel, listen to described CRTS grouping and CCTS grouping back judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and send the RTH grouping as cooperative node;
Step 4, source node and destination node send SCA grouping and DCA grouping respectively on control channel after receiving described RTH grouping on the control channel, described source node sends packet by described cooperative node to destination node on described data channel;
Step 5, destination node send busy tone after correctly receiving described packet.
The present invention is in technique scheme, 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, a control channel CCH and M data channel (are numbered CH1 respectively, ..., CHM), each node all has a unique ID in the network, a Channel Status Table CSL (channel status list) is all stored and safeguarded to each node simultaneously, the operating position of channel status table record channel, node comes the maintenance channel state table alternately by 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 the control grouping 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.Finish confirmation of receipt by 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 grouping and 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 by 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, when perhaps this channel is for transmission (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 line data transmit stage of respective channel, 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, be to guarantee the data packet transmission success in the target of the enterprising line data transmit stage of respective channel.Procedure declaration is as follows particularly:
When source node has packet to send to destination node, source node continues to intercept control channel, 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 grouping on control channel, and sets timer and wait for and receive the CCTS grouping, comprises the information of selectable data channel in the CRTS grouping.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, includes quality of channel information between source node and the destination node in the CCTS grouping.If source node is received the CCTS grouping that destination node sends before timer expiry, then reset timer, wait for receiving the RTH (ready to help) that cooperative node sends) grouping; If source node is not received the CCTS grouping, attempt newly once transmission after then keeping out of the way again, comprise channel selection procedure.In addition, if source node receives CRTS when grouping of issuing oneself in intercepting control channel, also be to judge whether the data channel of CRTS in dividing into groups be available, if data channel is unavailable, then continues to intercept control channel; If data channel can be used, then reply the CCTS grouping, and cancel this transmission.
When the public neighbors (being assumed to be node R) of source node and destination node is received CRTS grouping and CCTS grouping in intercepting control channel, 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 judge according to CRTS grouping and CCTS grouping whether self meets the cooperation condition earlier.When if node R meets the cooperation condition, node R and then judge whether the data channel in the CRTS grouping is 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 HA (help acknowledgement) grouping immediately on control channel, there is cooperative node in expression, send the RTH grouping as cooperative node after keeping out of the way corresponding a period of time according to channel quality and self loading level (traffic carrying capacity that sends in what or a certain period as the traffic carrying capacity that sent) then, include the information of channel quality between source node and cooperative node, cooperative node and the destination node in the RTH grouping.In the technique scheme, channel quality can be represented with supported flank speed.
Source node and destination node are after the RTH grouping that receives the node R transmission on the control channel, mean that node R competes successfully, cooperative node as this transmission, then adopt the cooperation sending mode, source node and destination node send SCA (source channel assignment) grouping and DCA (destination channel assignment) grouping respectively on control channel, source node to cooperative node transmission packet, wherein includes information such as this data channel that transmits the plan use and holding time thereof in SCA grouping and the DCA grouping on data channel then.Cooperative node receives after source node sends to packet, transmits this packet to destination node on data channel.Destination node sends busy tone after receiving the packet of cooperative node forwarding on the busy tone channel of data channel correspondence.In addition, if source node does not listen to the HA grouping, then there is not cooperative node in explanation, and then source node adopts direct sending mode, directly sends packet to destination node, and adopts 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:
Step 11, judge whether 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, judging last time, whether transmission end time satisfied condition, is then to wait for execution in step 1 when next time transmitting behind back off time, otherwise execution in step 13;
Step 13, j data channel of selection, j=(source node ID+ destination node ID) mod (channel number M), wherein mod is the complementation operator;
Step 14, judge whether be 0 or be in transmit status the remaining time of j data channel, be then to select j data channel for use, execution in step 2, otherwise execution in step 15;
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 wait for execution in step 1 when next time transmitting when not choosing behind back off time.
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 may 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, reduce different nodes to selecting the probability of identical data channel, therefore effectively reduce 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 then sends the CCTS grouping on control channel.Another kind of means are, after destination node receives the CRTS grouping, forward on the data channel of selecting for use in the CRTS grouping and intercept, and when having node to send on listening to this data channel, 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 the CCTS grouping.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 of CB grouping, detailed process is: the CRTS grouping that the neighbors of source node sends by intercepting control channel reception sources node, neighbors judges whether the data channel in the CRTS grouping is available concerning source node, when data channel is unavailable, neighbors sends CB (channel busy) grouping on control channel, 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, if receive the CB grouping that neighbors sends, 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, if do not receive the CB grouping, then continue to intercept control channel, wait for the CCTS grouping that destination node sends.
Fig. 3 sends the flow chart of RTH grouping as cooperative node for neighbors of the present invention.In the described technical scheme of Fig. 1, step 3 comprises:
Step 31, neighbors receive described CRTS grouping and CCTS grouping on control channel;
Step 32, judge whether the data channel in the described CRTS grouping 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, described neighbors send the HA grouping 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, judge whether to listen to the RTH grouping that other neighbors sends, be execution in step 39 then, otherwise continue to intercept control channel;
Step 39, on control channel, send RTH grouping as cooperative node.
When neighbors judgment data channel can with and when self meeting the cooperation condition, neighbors at first sends the HA grouping, there is cooperative node in expression, sends the RTH grouping as cooperative node after keeping out of the way a period of time according to channel quality and self loading level (traffic carrying capacity that sends in what or a certain period as the traffic carrying capacity that sent) then.Channel quality is good more, and load is more little, and then back off time is short more, and it is also just big more to compete successful probability, the long neighbors of other back off time after listening to the RTH grouping that early sends, thereby abandon competition.
In technique scheme, to send the purpose of SCA grouping and DCA grouping respectively be to notify all neighborss to stop to compete for source node and destination node in the step 4, allow 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, the RTH grouping of node R transmission simultaneously also is to have announced the channel operating position to neighbors.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 by source node, cooperative node and destination node are set, timely data channel and the time that takies to all neighborss declarations on control channel, make neighbors its Channel Status Table that upgrades in time, therefore effectively guaranteed the successful transmission of packet.
In the existing multi-channel multi-address access method, destination node adopts the mode of directly replying the ACK grouping on data channel to show transmission success after successfully receiving packet usually, but this may cause the ACK grouping normally not received or the ACK grouping disturbs other node to receive grouping.After the object of the invention node successfully receives packet, by send one section with long-time busy tones such as ACK grouping, busy tone plays the effect of ACK grouping, because busy-back signal and data channel can be not overlapping, so effectively avoided prior art ACK grouping normally not received or the ACK grouping disturbs other node to receive the situation of dividing into groups.
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 sends the CRTS grouping on control channel; Destination node is used to receive described CRTS grouping, but judges the described data channel time spent, sends the CCTS grouping on control channel; Neighbors is used for according to the CRTS that listens to grouping and CCTS grouping, judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and send RTH as cooperative node and divide into groups; Further, described source node also is used for: after receiving described RTH grouping on the control channel, send the SCA grouping on control channel, send packet by cooperative node to destination node on data channel; Described destination node also is used for: after receiving described RTH grouping on the control channel, send the DCA grouping on control channel, send busy tone after correctly receiving described packet.
Described source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table, described selection module is used for selecting a data channel according to described Channel Status Table, described first sending module is used to send described CRTS grouping, SCA grouping or packet, described first receiver module is used to receive described CCTS grouping, HA grouping and RTH grouping, and described first sending module is connected with described selection module respectively with first receiver module.Described destination node comprises second sending module and second receiver module, described second receiver module is used to receive described CRTS grouping, RTH grouping or packet, described second sending module is used to send described CCTS grouping, DCA grouping and busy tone, and described second sending module is connected with second receiver module.Described neighbors comprises the 3rd sending module, the 3rd receiver module and judge module, described the 3rd receiver module is used to receive described CRTS grouping, CCTS grouping or packet, described second sending module is used to send described HA grouping, RTH grouping or packet, described judge module is used to judge that described data channel is whether available and self whether satisfy the cooperation condition, and described the 3rd sending module is connected with described 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 illustrate 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 finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out 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.
It should be noted that at last: above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail 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 scope of technical solution 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 sends the CRTS grouping on control channel;
But step 2, the destination node that receives described CRTS grouping are judged the described data channel time spent, send the CCTS grouping on control channel;
Step 3, neighbors on control channel, listen to described CRTS grouping and CCTS grouping back judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and as sending the RTH grouping after the cooperative node;
Step 4, source node and destination node send SCA grouping and DCA grouping respectively on control channel after receiving described RTH grouping on the control channel, described source node sends packet by described cooperative node to destination node on described data channel;
Step 5, destination node send busy tone after correctly receiving described packet.
2. multi-channel collaboration multi-address access method according to claim 1 is characterized in that, described source node selects a data channel to comprise:
Step 11, judge whether 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, described condition be nodal point separation transmission end time last time T greater than k * Tmax but less than Tmax, described 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;
Step 14, judge whether be 0 or be in transmit status the remaining time of j data channel, be then to select j data channel for use, execution in step 2, otherwise execution in step 15;
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 wait for execution in step 1 when next time transmitting when not choosing behind back off time.
3. multi-channel collaboration multi-address access method according to claim 1 is characterized in that, also comprises between described step 1 and the step 2: the neighbors of source node receives described CRTS grouping; Described neighbors judges whether described data channel is available for source node, on control channel, send the CB grouping when unavailable, source node receives described CB grouping, 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 and receive CCTS grouping, execution in step 2.
4. multi-channel collaboration multi-address access method according to claim 1, it is characterized in that, described step 2 comprises: after destination node receives described CRTS grouping, judge according to the Channel Status Table of its storage and maintenance whether the data channel in the described CRTS grouping is available, do not send the CCTS grouping when unavailable and continue to intercept control channel, but the time spent sends the CCTS grouping on control channel.
5. multi-channel collaboration multi-address access method according to claim 1, it is characterized in that, described step 2 comprises: after destination node receives described CRTS grouping, intercept the data channel in the described CRTS grouping, when on listening to described data channel, having node to send, judge that described data channel is unavailable, do not send the CCTS grouping, and continue to intercept control channel; When on not listening to described data channel, having node to send, judge that described data channel can use, on control channel, send the CCTS grouping.
6. according to arbitrary described multi-channel collaboration multi-address access method in the claim 1~5, it is characterized in that, neighbors on control channel, listen to described CRTS grouping and the described data channel of CCTS grouping back judgement can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and grouping comprises as cooperative node transmission RTH:
Step 31, neighbors receive described CRTS grouping and CCTS grouping on control channel;
Step 32, judge whether the data channel in the described CRTS grouping 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, described neighbors send the HA grouping 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 grouping that other neighbors sends, is then to continue to intercept control channel, otherwise execution in step 39;
Step 39, on control channel, send RTH grouping as cooperative node.
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 sends the CRTS grouping on control channel;
Destination node is used to receive described CRTS grouping, but judges the described data channel time spent, sends the CCTS grouping on control channel;
Neighbors is used for according to the CRTS that listens to grouping and CCTS grouping, judge described data channel can with and when self satisfying the cooperation condition, on control channel, send the HA grouping, and send RTH as cooperative node and divide into groups;
Described source node also is used for: after receiving described RTH grouping on the control channel, send the SCA grouping on control channel, send packet by cooperative node to destination node on data channel; Described destination node also is used for: after receiving described RTH grouping on the control channel, send the DCA grouping on control channel, send busy tone after correctly receiving described packet.
8. multi-channel collaboration multiple access system according to claim 7, it is characterized in that, described source node comprises the selection module of first sending module, first receiver module and storage and maintenance channel state table, described selection module is used for selecting a data channel according to described Channel Status Table, described first sending module is used to send described CRTS grouping, SCA grouping or packet, described first receiver module is used to receive described CCTS grouping, HA grouping and RTH grouping, and described first sending module is connected with described selection module respectively with first receiver module.
9. multi-channel collaboration multiple access system according to claim 7, it is characterized in that, described destination node comprises second sending module and second receiver module, described second receiver module is used to receive described CRTS grouping, RTH grouping or packet, described second sending module is used to send described CCTS grouping, DCA grouping and busy tone, and described 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, described neighbors comprises the 3rd sending module, the 3rd receiver module and judge module, described the 3rd receiver module is used to receive described CRTS grouping, CCTS grouping or packet, described second sending module is used to send described HA grouping, RTH grouping or packet, described judge module is used to judge that described data channel is whether available and self whether satisfy the cooperation condition, and described the 3rd sending module is connected with described judge module respectively with the 3rd receiver module.
CN200910242562A 2009-12-16 2009-12-16 Multi-channel collaboration multi-address access method and system Expired - Fee Related CN101754399B (en)

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 true CN101754399A (en) 2010-06-23
CN101754399B 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)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102006630A (en) * 2010-11-10 2011-04-06 北京航空航天大学 Multichannel cooperative data transmission method and system
CN102014467A (en) * 2010-11-09 2011-04-13 北京航空航天大学 Multi-relay selection cooperative transmission method and system
CN102056324A (en) * 2010-12-22 2011-05-11 中国人民解放军理工大学 Cooperative carrier sense multiple access (CSMA) method based on token control conflict analysis
CN102123020A (en) * 2011-04-01 2011-07-13 北京航空航天大学 Distributed cooperative multiple access method and system providing guarantee for quality of service
CN102170665A (en) * 2011-04-01 2011-08-31 北京航空航天大学 Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service
CN102625367A (en) * 2012-03-12 2012-08-01 暨南大学 Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network
CN103281750A (en) * 2013-05-31 2013-09-04 北京航空航天大学 Cooperation multiple access method and system for guaranteeing service quality and fairness
CN110572849A (en) * 2018-06-05 2019-12-13 北京松果电子有限公司 Method, device and storage medium for sending data block and electronic equipment

Family Cites Families (4)

* Cited by examiner, † Cited by third party
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
US8230108B2 (en) * 2007-04-13 2012-07-24 Hart Communication Foundation Routing packets on a network using directed graphs
CN101388849B (en) * 2008-10-29 2011-04-13 北京航空航天大学 Method for selecting collaboration node
CN101583161B (en) * 2009-05-26 2013-02-13 北京邮电大学 Cooperative node unit selection method and device

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014467A (en) * 2010-11-09 2011-04-13 北京航空航天大学 Multi-relay selection cooperative transmission method and system
CN102014467B (en) * 2010-11-09 2013-08-07 北京航空航天大学 Multi-relay selection cooperative transmission method and system
CN102006630A (en) * 2010-11-10 2011-04-06 北京航空航天大学 Multichannel cooperative data 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
CN102056324A (en) * 2010-12-22 2011-05-11 中国人民解放军理工大学 Cooperative carrier sense multiple access (CSMA) method based on token control conflict analysis
CN102170665A (en) * 2011-04-01 2011-08-31 北京航空航天大学 Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service
CN102170665B (en) * 2011-04-01 2013-08-07 北京航空航天大学 Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service
CN102123020A (en) * 2011-04-01 2011-07-13 北京航空航天大学 Distributed cooperative multiple access method and system providing guarantee for quality of service
CN102625367A (en) * 2012-03-12 2012-08-01 暨南大学 Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network
CN102625367B (en) * 2012-03-12 2014-07-02 暨南大学 Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network
CN103281750A (en) * 2013-05-31 2013-09-04 北京航空航天大学 Cooperation multiple access method and system for guaranteeing service quality and fairness
CN103281750B (en) * 2013-05-31 2015-12-02 北京航空航天大学 Guarantee service quality and the collaboration multi-address access method of fairness and system
CN110572849A (en) * 2018-06-05 2019-12-13 北京松果电子有限公司 Method, device and storage medium for sending data block and electronic equipment
CN110572849B (en) * 2018-06-05 2023-03-10 北京小米松果电子有限公司 Method, device and storage medium for sending data block and electronic equipment

Also Published As

Publication number Publication date
CN101754399B (en) 2012-09-12

Similar Documents

Publication Publication Date Title
CN101754399B (en) Multi-channel collaboration multi-address access method and system
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
US7190686B1 (en) Self configuring high throughput medium access control for wireless networks
US20100226308A1 (en) node- arbitrated media access control protocol for ad hoc broadcast networks carrying ephemeral information
CN100499915C (en) Multi-channel multi-address access method
AU2006284932A1 (en) Media access control architecture
KR19980703478A (en) Method and apparatus of wireless communication
CN102308656B (en) Methods and systems for user selection in wireless communication networks
CN101764679A (en) Distributed collaborative multiple access method and system thereof
CN102404804B (en) Transmission method of MAC (Media Access Control) layer in multi-relay competitive cooperative communication
WO2015013002A1 (en) Reassignment of unused network transmission unit portions
CN102014467B (en) Multi-relay selection cooperative transmission method and system
CN101223794A (en) Method and system of wireless communication between devices
CN100559738C (en) The multi-address access method according to requirement that the band conflict is decomposed
CN101141176B (en) Distributed acquisition multi-access method
CN102308648B (en) Method and system for competing between management node in wireless communication system
CN102378390A (en) Fast collaborative access control method and fast collaborative access control system
CN102387550A (en) Hierarchical cooperation access method and system as well as cooperative nodes
CN111343687B (en) Network data transmission method and device based on multi-relay cooperation and electronic equipment
CN102438326A (en) Multi-rate adaptive cooperative access method and system
JP3235041B2 (en) TDD wireless communication system
CN100429958C (en) Bandwidth reserved media access control method for private wireless network

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: 20120912

Termination date: 20161216

CF01 Termination of patent right due to non-payment of annual fee