CN101102178A - Multi-channel selection multi-address access method - Google Patents

Multi-channel selection multi-address access method Download PDF

Info

Publication number
CN101102178A
CN101102178A CNA2007101186027A CN200710118602A CN101102178A CN 101102178 A CN101102178 A CN 101102178A CN A2007101186027 A CNA2007101186027 A CN A2007101186027A CN 200710118602 A CN200710118602 A CN 200710118602A CN 101102178 A CN101102178 A CN 101102178A
Authority
CN
China
Prior art keywords
channel
execution
node
grouping
traffic
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
CNA2007101186027A
Other languages
Chinese (zh)
Other versions
CN100512092C (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 CNB2007101186027A priority Critical patent/CN100512092C/en
Publication of CN101102178A publication Critical patent/CN101102178A/en
Application granted granted Critical
Publication of CN100512092C publication Critical patent/CN100512092C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

In the invention, when a service packet needs to be transmitted, the follow steps will be executed: according to the saved and maintained channel usage list, the sending node selects a collision-free service channel; the RTS/CTS packet transmitted on first public channel between the sending node and receiving node realizes the handshake; the sending node transmits the service packet on said selected service channel; after successfully receiving the service packet, the receiving node replays the ACK packet on the second public channel.

Description

Multi-channel selection multi-address access method
Technical field
The present invention relates to a kind of multiple access method, particularly a kind of multi-channel selection multi-address access method that is applicable to Ad Hoc network.
Background technology
Ad Hoc network (Ad-Hoc Network) is that a kind of fixed network that need not is as the latticed form that supports.Because Ad Hoc network has advantages such as networking fast and flexible, survivability are strong, with low cost, is specially adapted to fields such as military affairs, rescue and relief work, electronic classroom.This network has become a kind of effective communication network form in the wireless communication field.And obtained widely and used, as 802.11 systems, U.S. army's aeroamphibious integrated digital communication system.A key Design problem of Ad Hoc network is that multiple access inserts.Multiple access insert (be the medium access control, Medium Access Control is called for short MAC) method solve a plurality of nodes or user how fast, efficient, fair, the problem of shared channel resources reliably.
At present, the multiple access method of Ad Hoc network mainly is divided into two classes, based on the MAC method and the uncompetitive MAC method of competition.MAC method based on competition comprises that ALOHA method and carrier sense multiple insert (carrier sensing multiple access is called for short CSMA) method.Because the CSMA method is than ALOHA method function admirable, and realization is simple, has therefore obtained widely and has used.But owing to have concealed terminal and exposed terminal in the multi-hop topological structure, when traffic carrying capacity increase or access node increase, frequent collision this moment can cause discarded ratio of packet to increase, and block transmission delay increases, channel utilization decline.
Because the MAC method system's instability under heavy duty based on competition has caused the appearance of uncontested MAC method.Common uncontested MAC method has four classes: based on the fixedly multiple access method of frequency division multiple access (FDMA) or time division multiple access (TDMA), based on the method for node poll (polling), based on the method for token transmission (token passing) with based on the method for dynamic reservation (dynamic reservation).Because the restriction of node volume power consumption, the TDMA method is more suitable for than FDMA method.But to the burst service model, the TDMA method can cause bigger channel wastage, and the tdma system that changes at any time for interstitial content, and is complicated more to the management meeting of time slot.Though the method based on node poll or token transmission has been avoided many channel wastage than the TDMA method, still there is unnecessary time-delay in unnecessary free time of channel or the Channel Transmission.And this access mode is applied in the multihop network structure, need to select cluster by information interaction in advance, and the transmission of the business of cluster is too many, and the energy that carries can exhaust very soon, therefore can not effectively be applicable to Ad Hoc wireless network.
In these cases, dynamically the multi-address method of reservation obviously becomes best selection.Dynamically the multi-address method of reservation combines based on the MAC method of competition and the advantage of uncompetitive MAC method.At present, dynamically the method for reservation is the right of reservation transmission grouping mostly.The basic thought of these class methods all is that node sends (Request To Send/Clear To Send is called for short RTS/CTS) handshake reservation channel by request transmission/permission before transmission, after preengaging, does not have the conflict transmission again.The key of these class methods is how to tackle the collision of RTS grouping.For example the multiple access of avoiding in conflict inserts (Multiple Accesswith Collision Avoidance, abbreviation MACA) adopts the method for intercepting based on grouping in the method, the multiple access that right to speak is obtained inserts (Floor Acquisition Multiple Access, abbreviation FAMA) method adopts the strategy based on carrier sense, and in these two kinds of multiple access methods, exposed terminal problem still exists, and all fails further to be reduced between the impact zone of concealed terminal (Hidden Terminal) and RTS/CTS grouping.
Summary of the invention
The purpose of this invention is to provide a kind of multi-channel selection multi-address access method, guarantee to greatest extent the no conflict transmission of traffic packets to solve the exposed terminal problem that the RTS/CTS grouping is shaken hands and brought simultaneously by Traffic Channel selection scheme flexibly.
To achieve these goals, the invention provides a kind of multi-channel selection multi-address access method, when traffic packets will send, execution in step:
Step 1, use table according to storage and the channel safeguarded, sending node is selected a conflict free Traffic Channel, the operating position of each Traffic Channel that described channel has used table record;
Step 2, sending node and receiving node transmit the RTS/CTS grouping on first common signal channel realizes shaking hands;
Step 3, sending node transmit traffic packets on described Traffic Channel, after receiving node successfully receives described traffic packets, reply the ACK grouping on second common signal channel.
Wherein, described step 1 is specially:
Step 11, sending node calculate and judge whether default channel is available, are then to select this Traffic Channel, and channel is selected to finish, otherwise execution in step 12;
Step 12, sending node calculate and judge whether available not use channel, are then to select available not use channel, and channel is selected to finish, otherwise execution in step 13;
Step 13, sending node calculate and judge whether available no collision channels, are then to select available no collision channels, and channel is selected to finish, otherwise keeps out of the way, and select the grouping of default channel transport service after the free time up to default channel.
Wherein, described step 11 is specially:
The call number j of step 111, calculating default channel;
Step 112, check channel use table, therefrom obtain the channel information of j Traffic Channel;
The courier of step 113, j Traffic Channel of judgement uses state, and as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, and execution in step 114;
Step 114, judge j Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 115;
Step 115, judge that j Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 12.
Wherein, described step 12 is specially:
Channel set is not used in step 121, calculating;
Step 122, use the channel set from described that to select a call number be the not use channel of i;
Step 123, check channel use table, therefrom obtain the channel information of i Traffic Channel;
The channel user mode of step 124, i Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 125;
Step 125, judge i Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 126;
Step 126, judge that i Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 127;
Step 127, judge describedly do not use whether do not judge whether available not use channel in the channel set in addition, in this way, execution in step 122, otherwise execution in step 13.
Wherein, described step 13 is specially:
Step 131, check channel use table, therefrom obtain default channel and do not use the state parameter of channel;
Step 132, selective channel are used concluding time channel the latest, obtain the sending node and the destination node of this channel service grouping, and calculate no collision channels set according to the sending node and the destination node of this traffic packets;
Step 133, from described no collision channels set, select the no collision channels that call number is k;
Step 134, check channel use table, therefrom obtain the channel information of k Traffic Channel;
The channel user mode of step 135, k Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 136;
Step 136, judge k Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 137;
Step 137, judge that k Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 138;
Step 138, judge in the described no collision channels set whether do not judge whether available no collision channels with ining addition, in this way, execution in step 133, otherwise keep out of the way, select the default channel transport service to divide into groups after the free time up to default channel.
Wherein, the handling process of sending node is specially in the described step 2:
Step 211, intercept first common signal channel;
Step 212, judge first common channel state,, then select one first contention window value at random, timer is set keeps out of the way and intercept as the channel spare time; As channel busy, then select one second contention window value at random, timer is set keeps out of the way and intercept, the described first contention window value is less than the described second contention window value;
Judge first common channel state when step 213, timer expiry, as be the channel spare time that then execution in step 214; As be channel busy, execution in step 212;
Step 214, transmission RTS grouping on described first common signal channel are provided with the timer of waiting for the CTS grouping;
Step 215, wait CTS grouping on described first common signal channel;
Step 216, judge waiting for whether the CTS grouping is overtime, is execution in step 212 then, otherwise execution in step 217;
Step 217, judging whether that success receives CTS grouping, is execution in step 218 then; Otherwise execution in step 215;
Step 218, cancellation timer, the RTS/CTS grouping is shaken hands and is finished.
Wherein, the handling process of receiving node is specially in the described step 2:
Step 221, intercept first common signal channel;
There is the control grouping to arrive on step 222, first common signal channel, receives and obtain the control grouping information;
Step 223, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 221, otherwise execution in step 224;
Step 224, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, are execution in step 226 then, otherwise execution in step 225;
Step 225, whether judging destination node in this node and the RTS grouping at a distance of a jumping, is execution in step 221 immediately then, otherwise uses in the table execution in step 221 after the recorded information at its channel;
Step 226, check channel use table;
Step 227, judging whether the Traffic Channel in the described RTS grouping is available, is execution in step 228 then, otherwise execution in step 221.
Step 228, answer CTS grouping on described first common signal channel, the RTS/CTS grouping is shaken hands and is finished.
Wherein, the handling process of sending node is specially in the described step 3:
Step 311, on described Traffic Channel, send traffic packets;
Step 312, the timer of waiting for the ACK grouping is set;
Step 313, wait ACK grouping on described second common signal channel;
Step 314, judge waiting for whether the ACK grouping is overtime, is then to get back to first common signal channel to keep out of the way and intercept, prepare to attempt resending next time, otherwise execution in step 315;
Step 315, judging whether that success receives ACK grouping, is execution in step 316 then; Otherwise execution in step 313;
Step 316, traffic packets send and finish.
Wherein, the handling process of receiving node is specially in the described step 3:
Step 321, the timer of latency services grouping is set;
Step 322, latency services grouping on described Traffic Channel;
Step 323, judge whether latency services grouping is overtime, is then to get back to idle condition, intercepts described first common signal channel, otherwise execution in step 324;
Step 324, judging whether that success receives traffic packets, is execution in step 325 then; Otherwise execution in step 322;
Step 325, answer ACK grouping on described second common signal channel.
Wherein, the handling process with sending node or receiving node adjacent node is specially:
Step 231, intercept first common signal channel;
There is the control grouping to arrive on step 232, first common signal channel, receives and obtain the control grouping information;
Step 233, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 231; Otherwise execution in step 234;
Step 234, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, is then to carry out the handling process of receiving node in the RTS/CTS grouping is shaken hands; Otherwise execution in step 235;
Step 235, judging that whether the destination node in the RTS grouping jump at a distance of one with own, is execution in step 231 then; Otherwise use recorded information in the table, execution in step 231 at its channel.
The present invention proposes a kind of multi-channel selection multi-address access method, multichannel is divided into common signal channel and Traffic Channel two parts, common signal channel further is divided into again and is used for second common signal channel that communication node transmission RTS/CTS grouping realizes first common signal channel of shaking hands and is used to reply the ACK grouping, therefore RTS/CTS grouping and ACK transmitted in packets are separated with the traffic packets transmission, on special common signal channel, carry out, thoroughly avoided exposed terminal problem by CTS divides into groups and the ACK transmitted in packets is brought, help making full use of channel resource, reduced simultaneously between the impact zone of traffic packets, improve channel utilization greatly, reduced packet transfer delay.In the network all there be a mutually different ID number each node simultaneously, each communication node has and keeps a channel use table, this channel uses the operating position of each Traffic Channel of record in the table, use table according to channel, the present invention can guarantee the no conflict transmission of traffic packets by the Traffic Channel of channel selection scheme selection flexibly, traffic channel resource is divided into default channel, do not use channel and no collision channels, the node that has traffic packets to send, according to default channel, do not use channel and no collision channels order selective channel, reduce packet transfer delay.According to the particular location of node and neighbors, take into full account the situation of various realization Traffic Channel space division multiplexing.Adopt the professional transmission plan of multichannel mode balance, avoided most of conflict that causes by the single channel transmission, make the present invention have channel throughput height, traffic packets and do not have advantages such as conflict transmission, packet transfer delay be little, all nodes only have a semiduplex transceiver, equipment requirements is simple, make the present invention be applicable to any distributed wireless networks, Ad Hoc network especially can be used as the method for a plurality of user's sharing wireless channel resources in the mobile Ad Hoc network.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Fig. 1 is the flow chart of multi-channel selection multi-address access method of the present invention;
Fig. 2 a～Fig. 2 c is the first example key diagram;
Fig. 3 a～Fig. 3 c is the second example key diagram;
Fig. 4 a, Fig. 4 b are the 3rd example key diagram;
Fig. 5 selects not have the flow chart of conflict Traffic Channel for the present invention;
Fig. 6 calculates for the present invention and judges the flow chart that default channel is whether available;
Whether available Fig. 7 calculate for the present invention and judge the flow chart that does not use channel;
Fig. 8 calculates for the present invention and judges the flow chart that no collision channels is whether available;
Fig. 9 is the process chart of sending node of the present invention in the RTS/CTS grouping is shaken hands;
Figure 10 is the process chart of receiving node of the present invention in the RTS/CTS grouping is shaken hands;
Figure 11 is the process chart of sending node of the present invention in the transport service grouping;
Figure 12 is the process chart of receiving node of the present invention in the transport service grouping;
Figure 13 is the process chart of the present invention and sending node or receiving node adjacent node.
Embodiment
Fig. 1 is the flow chart of multi-channel selection multi-address access method of the present invention.In technical solution of the present invention, multichannel is divided into two parts, wherein a part is used for transmitting control grouping (comprising that RTS grouping, CTS grouping and ACK divide into groups) as common signal channel, another part is used as Traffic Channel and is used for transport service grouping, comprises the first common signal channel CCH as the part of common signal channel 1With the second common signal channel CCH 2, the first common signal channel CCH 1Being used for communication node transmission RTS/CTS grouping realizes shaking hands the second common signal channel CCH 2Be used for replying the ACK grouping after receiving node successfully receives traffic packets, remaining is Traffic Channel TCH i, be used for transport service grouping.
As shown in Figure 1, when traffic packets will send, execution in step:
Step 1, use table according to storage and the channel safeguarded, sending node is selected a conflict free Traffic Channel;
Step 2, sending node and receiving node transmit the RTS/CTS grouping on first common signal channel realizes shaking hands;
Step 3, sending node transmit traffic packets on described Traffic Channel, after receiving node successfully receives described traffic packets, reply the ACK grouping on second common signal channel.
In technique scheme, the node that has traffic packets to send, at first the channel according to its storage and maintenance uses table to carry out the channel selection scheme, to select conflict free Traffic Channel.After Traffic Channel was selected to finish, sending node and receiving node were at the first common signal channel CCH 1Last transmission RTS/CTS grouping realizes shaking hands; Shake hands after the success, sending node transmits traffic packets on this Traffic Channel, after receiving node successfully receives described traffic packets, at the second common signal channel CCH 2Last answer ACK grouping.Among the present invention, in the network all there be a mutually different ID number each node, each communication node has and keeps a channel use table, has write down the state (busy/spare time) of each Traffic Channel and necessary parameter (as concluding time of channel busy state etc.) in this channel use table.Particularly, channel use table comprise the call number, channel service marking, channel status, channel using form, channel of channel sending node, the channel in using in using destination node (receiving node) and the concluding time of the last channel use.Can be 1 to represent that this channel is a default channel with the channel service marking, service marking be that 0 this channel of expression is not for using channel; Can be 1 to represent that channel is in busy condition with channel status, channel status be 0 expression channel idle; The channel using form represents that channel state information at this moment is to come from RTS grouping or CTS grouping.Whether receiving node also utilizes channel use table inquiry business channel available, from the RTS grouping of issuing oneself, obtain the Traffic Channel call number, channel according to call number inquiry oneself uses table, state or the channel of checking this Traffic Channel use the concluding time, and judge whether Traffic Channel is available.
Suppose to have adjacent two communication nodes right: node A and Node B, node C and node D, wherein Node B is jumped at a distance of one with node A and node C respectively, with node D at a distance of double bounce; Node C jumps at a distance of one with Node B and node D respectively, with node A at a distance of double bounce.
Fig. 2 a～Fig. 2 c is the first example key diagram, and wherein Fig. 2 a is the node location schematic diagram, and Fig. 2 b is Fig. 2 a situation prior art transmission course schematic diagram, and Fig. 2 c is Fig. 2 a situation transmission course schematic diagram of the present invention.Shown in Fig. 2 a, when having traffic packets, Node B sends to node A, node C when having traffic packets to send to node D, and 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.If communication node uses identical Traffic Channel TCH to node C with node D with node A, communication node to Node B iThe transport service grouping, and ACK divides into groups and traffic packets is all transmitted on Traffic Channel, then can clash.Shown in Fig. 2 b, Node B sends traffic packets (wherein to node A, node C simultaneously to node D, Node B and node A insert successfully prior to node C and node D), finish posterior nodal point A when Node B sends the ACK grouping and send traffic packets to node A in Node B, node C is also sending traffic packets to node D, so at t 3-t 4The Node B place of time period clashes, and causes Node B to receive ACK grouping failure.Technical solution of the present invention is separated ACK transmitted in packets and traffic packets transmission, at the second special common signal channel CCH 2On carry out, therefore avoided above-mentioned conflict.Shown in Fig. 2 c, node A is at the second common signal channel CCH 2Last transferring ACK grouping, even communication node uses same traffic channel transmission traffic packets also can not clash Node B and node A, communication node to node C and node D simultaneously, the space division multiplexing of Traffic Channel has improved channel utilization greatly.
Fig. 3 a～Fig. 3 c is the second example key diagram, and wherein Fig. 3 a is the node location schematic diagram, and Fig. 3 b is Fig. 3 a situation prior art transmission course schematic diagram, and Fig. 3 c is Fig. 3 a situation transmission course schematic diagram of the present invention.Shown in Fig. 3 a, when having traffic packets, node A to send to Node B, when node D has traffic packets will send to node C, and node C and Node B be exposed terminal each other, and all is the exposed terminal that is caused by the CTS grouping that Node B or node C send.If communication node uses identical Traffic Channel TCH to node D with node C with Node B, communication node to node A iThe transport service grouping, and ACK divides into groups and traffic packets is all transmitted on Traffic Channel, then can clash.Shown in Fig. 3 b, node A sends traffic packets (wherein to Node B, node D simultaneously to node C, node A and Node B are prior to node C and node D access channel), finish posterior nodal point B when node A sends the ACK grouping and send traffic packets to Node B at node A, the traffic packets that node C still sends at receiving node D is so at t 3-t 4The node C place of time period clashes, and causes node C to receive the traffic packets failure.Technical solution of the present invention is separated ACK transmitted in packets and traffic packets transmission, at the second special common signal channel CCH 2On carry out, therefore avoided above-mentioned conflict.Shown in Fig. 3 c, Node B is at the second common signal channel CCH 2Last transferring ACK grouping, even communication node uses same traffic channel transmission traffic packets also can not clash node A and Node B, communication node to node D and node C simultaneously, the space division multiplexing of Traffic Channel has improved channel utilization greatly.
In the single channel transmission, because propagation delay t pWith transmitting-receiving t change-over time rExistence, the node that is in concealed terminal may be at time interval τ=t p+ t rSend the RTS grouping in time,, also can cause the conflict of traffic packets transmission if shake hands successfully.Fig. 4 a, Fig. 4 b are the 3rd example key diagram, and wherein Fig. 4 a is the node location schematic diagram, and Fig. 4 b is Fig. 4 a situation prior art transmission course schematic diagram.Shown in Fig. 4 a, node E has traffic packets will send to node F, and node G is the concealed terminal of node E.Shown in Fig. 4 b, when adopting the single channel transmission, because the existence of time interval τ, node G may also not listen to the CTS grouping of node F, just judges channel idle, sends RTS and divides into groups to node H.If these two communication nodes to all shaking hands successfully, then are engraved in node F place at node G and clash when node H begins to send traffic packets, the traffic packets failure that causes node F receiving node E to send.As seen, even receiving-transmitting sides is shaken hands successfully in the single channel transmission, the conflict of traffic packets may take place still, transmission reliability is low.And in technical scheme of the present invention, owing to adopt the multichannel transmission means, communication node can be selected different traffic channel transmission traffic packets to node G and node H, as long as and receiving-transmitting sides shake hands successfully, traffic packets will realize not having the conflict transmission on this Traffic Channel.
From technique scheme as can be seen, owing to adopt the multichannel transmission mechanism, wherein two channels are that common signal channel is used for transmitting the control grouping, all the other channels are that Traffic Channel is used for transport service grouping, the ACK transmitted in packets is separated with the traffic packets transmission, and on special common signal channel, carry out, thoroughly avoided helping making full use of channel resource by the exposed terminal problem that CTS divides into groups and the ACK transmitted in packets is brought.Reduced simultaneously to have improved channel utilization greatly between the impact zone of traffic packets, reduced packet transfer delay.Owing to adopt the professional transmission of multichannel mode balance, can avoid most of conflict that causes by the single channel transmission, the node in the network can make full use of a plurality of Traffic Channels under conflict free situation.Because adopting the RTS/CTS grouping to shake hands, the present invention on independent common signal channel, carries out, will be longer the conflict of traffic packets transmission transfer in the less control transmitted in packets, also avoided most of hidden terminal problem that causes by the single channel transmission, in a single day guarantee communication node to shaking hands successfully, traffic packets just can realize not having the conflict transmission.
Fig. 5 selects not have the flow chart of conflict Traffic Channel for the present invention.On technical scheme shown in Figure 1 basis, described step 1 is specially:
Step 11, sending node calculate and judge whether default channel is available, are then to select this Traffic Channel, and channel is selected to finish, otherwise execution in step 12;
Step 12, sending node calculate and judge whether available not use channel, are then to select available not use channel, and channel is selected to finish, otherwise execution in step 13;
Step 13, sending node calculate and judge whether available no collision channels, are then to select available no collision channels, and channel is selected to finish, otherwise keeps out of the way, and select the grouping of default channel transport service after the free time up to default channel.
Technique scheme of the present invention is actually a kind of selection scheme of channel flexibly, by traffic channel resource being divided into default channel, not using channel and not having collision channels, the node that has traffic packets to send is according to default channel, do not use channel and do not have collision channels order selective channel.Be specially:, select default channel if default channel can be used; If default channel is unavailable, then select available not use channel; If above-mentioned two kinds of channels are all unavailable, then select available no collision channels; At last, if still do not have a spendable channel, sending node was abandoned transmission information and was clashed avoiding this moment, and this moment, acquiescence was used default channel, but need keep out of the way after the corresponding time access channel again.Avoid characteristic by situation and the conflict of taking all factors into consideration various space division multiplexings, select conflict free traffic channel transmission traffic packets to greatest extent, reduce packet transfer delay.
Fig. 6 calculates for the present invention and judges the flow chart that default channel is whether available, and on technical scheme shown in Figure 5 basis, described step 11 is specially:
The call number j of step 111, calculating default channel;
Step 112, check channel use table, therefrom obtain the channel information of j Traffic Channel;
The channel user mode of step 113, j Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 114;
Step 114, judge j Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 115;
Step 115, judge that j Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 12.
Suppose that node A communicates by letter with Node B, node C has traffic packets will send to node D, and node C or node D jump in the communication range in one of node A or Node B, and communication node is designated as j Traffic Channel TCH to node C and node D default channel j, wherein, the computational methods of default channel call number j are: j=[(ID C+ ID D)/2] mod (N CH-2), in the formula, ID CBe the ID of sending node, ID DBe the ID of destination node, N CHExpression total number of channels order, mod represents the complementation computing.Check its channel use table according to call number j afterwards, therefrom obtain the channel information of j Traffic Channel, judge whether this Traffic Channel is available.Judge the channel user mode of j Traffic Channel according to channel information, when channel busy, whether the use concluding time of judging j Traffic Channel is before this uses beginning, because the moment=current time that Traffic Channel reuses+RTS transmitted in packets time+CTS transmission packets time+2t p), t wherein pBe propagation delay, so the calculating formula in the step 114 is: channel use the finish time＞(current time+RTS transmitted in packets time+CTS transmission packets time+2t p), be true as the result, then channel is unavailable, as is false, and then channel can be used.If the calculating formula result in the step 114 is true, judge further that then j Traffic Channel whether can space division multiplexing, as can not then returning execution in step 12, do not use the calculating and the judgement of channel.
Whether available Fig. 7 calculate for the present invention and judge the flow chart that does not use channel, and on technical scheme shown in Figure 5 basis, described step 12 is specially:
Channel set is not used in step 121, calculating;
Step 122, use the channel set from described that to select a call number be the not use channel of i;
Step 123, check channel use table, therefrom obtain the channel information of i Traffic Channel;
The channel user mode of step 124, i Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 125;
Step 125, judge i Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 126;
Step 126, judge that i Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 127;
Step 127, judge describedly do not use whether do not judge whether available not use channel in the channel set in addition, in this way, execution in step 122, otherwise execution in step 13.
Wherein, calculate the computational methods example in detail of not using channel set.Suppose that sending node is node C, receiving node is node D, then one of node C jumps neighbors and double bounce can to reach any one interior possible communication node of node (except that node C, D) be TCH to the default channel of (being assumed to be nodes X and node Y) k, k=[(ID wherein X+ ID Y)/2] mod (N CH-2), in the formula, ID X, ID YBe respectively the ID of nodes X and node Y, N CHExpression total number of channels order, mod represents the complementation computing.Use Φ AdjacentOne of expression node C jumps neighbors and double bounce can reach the right default channel set of all possible communication node of intranodal (except that node C, D), uses Φ TCHRepresent all Traffic Channel set, then do not use channel set Φ Do not useFor: Φ Do not use=Φ TCH-Φ AdjacentDo not use channel set Φ Do not useAfter obtaining, therefrom to select a call number successively be the not use channel of i and judge whether available.Particularly, never use channel set Φ Do not useNot use channel that call number is i of middle selection is checked its channel use table according to call number i afterwards, therefrom obtains the channel information of i Traffic Channel, judges whether this Traffic Channel is available.Judge the channel user mode of i Traffic Channel according to channel information, when channel busy, whether the use concluding time of judging i Traffic Channel is before this uses beginning, judge further that afterwards i Traffic Channel whether can space division multiplexing, as can not then returning execution in step 13, there are not the calculating and the judgement of collision channels.
Fig. 8 calculates for the present invention and judges the flow chart that no collision channels is whether available, and on technical scheme shown in Figure 5 basis, described step 13 is specially:
Step 131, check channel use table, therefrom obtain default channel and do not use the state parameter of channel;
Step 132, selective channel are used concluding time channel the latest, obtain the sending node and the destination node of this channel service grouping, and calculate no collision channels set according to the sending node and the destination node of this traffic packets;
Step 133, from described no collision channels set, select the no collision channels that call number is k;
Step 134, check channel use table, therefrom obtain the channel information of k Traffic Channel;
The channel user mode of step 135, k Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 136;
Step 136, judge k Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 137;
Step 137, judge that k Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 138;
Step 138, judge in the described no collision channels set whether do not judge whether available no collision channels with ining addition, in this way, execution in step 133, otherwise keep out of the way, select the default channel transport service to divide into groups after the free time up to default channel.
Wherein, the computational methods of no collision channels set are specially: check default channel in the channel use table and do not use the state parameter of channel, relatively their channel uses the concluding time, draw channel and use the channel that finishes the latest, the sending node of its traffic packets and destination node are designated as node A and Node B respectively.The sending node of still supposing this traffic packets is node C, and receiving node is node D.Then not having collision channels CF is:
CF 1＝[(ID A+ID C)/2]mod(N CH-2)，
CF 2＝[(ID B+ID C)/2]mod(N CH-2)，
CF 3＝[(ID A+ID D)/2]mod(N CH-2)，
CF 4＝[(ID B+ID D)/2]mod(N CH-2)。
CF 1～CF 4Promptly constitute no collision channels and gather, therefrom to select a call number successively be the no collision channels of k and judge whether available.Particularly, from no collision channels set, select the no collision channels that call number is k, check its channel use table according to call number k afterwards, therefrom obtain the channel information of k Traffic Channel, judge whether this Traffic Channel is available.Judge the channel user mode of k Traffic Channel according to channel information, when channel busy, whether the use concluding time of judging k Traffic Channel before this uses beginning, judges further afterwards whether k Traffic Channel can space division multiplexing.After above-mentioned deterministic process, if default channel, do not use channel and do not have collision channels all unavailable, then node should be kept out of the way up to default channel and selects default channel after the free time, to avoid conflict.The computational methods of back off time are: check in the channel use table that this channel uses the finish time, then back off time=channel use the finish time-(RTS transmitted in packets time+CTS transmitted in packets time+2t p).
In Fig. 6～technical scheme shown in Figure 8, it all is jumpings that node is intercepted with the scope of communicating by letter, and the space division multiplexing situation in the network has following several:
First kind of situation, if in the network between the right arbitrary node of communication node and the arbitrary node of another communication node centering at least at a distance of two long-jumps, these two communication nodes be to can using same Traffic Channel simultaneously so, and can not clash.
The explanation of other two kinds of situations can be supposed node A and Node B earlier communicate by letter (wherein node A is the source node of traffic packets, and Node B is a destination node), and selecting the Traffic Channel call number is i; Node C promptly will set up new communicating by letter (node C is the source node of traffic packets, and node D is a destination node) with node D.
Second kind of situation, if node C and node A jump at a distance of one, with Node B at a distance of double bounce, and node D and node A double bounce apart, then node C can use i Traffic Channel and can not clash.
The third situation, on the basis of the above, if node C and node A are more than double bounce reaches, more than apart double bounce reached with Node B, node D and node A jumped at a distance of one with Node B at a distance of double bounce, then node C can use i traffic channel transmission traffic packets to give node D, and can not clash.
Fig. 9 is the process chart of sending node of the present invention in the RTS/CTS grouping is shaken hands, and is specially:
Step 211, intercept first common signal channel;
Step 212, judge first common channel state,, then select one first contention window value at random, timer is set keeps out of the way and intercept as the channel spare time; As channel busy, then select one second contention window value at random, timer is set keeps out of the way and intercept, the described first contention window value is less than the described second contention window value;
Judge first common channel state when step 213, timer expiry, as be the channel spare time that then execution in step 214; As be channel busy, execution in step 212;
Step 214, transmission RTS grouping on described first common signal channel are provided with the timer of waiting for the CTS grouping;
Step 215, wait CTS grouping on described first common signal channel;
Step 216, judge waiting for whether the CTS grouping is overtime, is execution in step 212 then, otherwise execution in step 217;
Step 217, judging whether that success receives CTS grouping, is execution in step 218 then; Otherwise execution in step 215;
Step 218, cancellation timer, the RTS/CTS grouping is shaken hands and is finished.
Sending node is at first intercepted the first common signal channel CCH 1, if channel idle is then selected first a less contention window value t at random Keep out of the way 1, timer is set keeps out of the way and intercept, the range of choice of the first contention window value can be t Keep out of the way 1∈ (0, (t CTS+ 2t p)], wherein (0, (t CTS+ 2t p)] be the maximum crash interval of concealed terminal.If channel busy is then selected second a bigger contention window value t at random Keep out of the way 2, timer is set keeps out of the way and intercept, the range of choice of the second contention window value can be t Keep out of the way 2∈ (0, N One-hop(t CTS+ 2t p)], wherein, N One-hopFor one of this node is jumped neighbors number, t pBe propagation delay, t CTSBe the CTS transmission packets time, the first contention window value t Keep out of the way 1Less than the second contention window value t Keep out of the way 2If timer expiry is the first common signal channel CCH 1Free time then sends the RTS grouping; Otherwise, then reselect the 3rd contention window value t if channel still is in busy condition Keep out of the way 3, timer is set continues to intercept channel, the range of choice of the 3rd contention window value can be t Keep out of the way 3∈ (0, (t CTS+ 2t p)]), going round and beginning again sends the RTS grouping after channel idle.The range of choice of the above-mentioned first contention window value, the second contention window value and the 3rd contention window value is not limited to above-mentioned scope, the time 〉=2t of timer Pmax, t wherein PmaxBe the propagation delay of maximum, and t Pmax=maximum communication distance/propagation velocity of electromagnetic wave.Compete the first common signal channel CCH at node A and neighbors like this 1The time, the time of each node access channel can be staggered, avoid conflict.The timer waiting time is being set, and sending node is intercepted the first common signal channel CCH 1, if receive the RTS grouping of issuing oneself, judge whether Traffic Channel wherein is available in intercepting, if the available CTS that then replys divides into groups, the cancellation timer is abandoned this transmission, resets the grouping of timer latency services, this moment, this node was in accepting state.If the unavailable CTS that then do not reply of Traffic Channel divides into groups.
Afterwards, sending node is at the first common signal channel CCH 1Last transmission RTS grouping is provided with timer, and at the first common signal channel CCH 1Last wait CTS grouping.Wait in the CTS grouping process and judge whether timer is overtime, it is execution in step 212 then, again intercepting wait resends, otherwise judge whether that success receives CTS grouping, confiscate then execution in step 215, wait for the CTS grouping on described first common signal channel, successfully receive back cancellation timer, the RTS/CTS grouping is shaken hands and is finished.
In technique scheme, can also comprise the flow process of keeping out of the way in particular cases for avoiding conflict, be specially: in the step 212, sending node has traffic packets to send, and is intercepting the first common signal channel CCH 1Process in receive the right control of other communication node grouping, and a certain node wherein is identical with the destination node of this communication, then will take to keep out of the way measure.Describe in detail with object lesson below, suppose that (node C is the source node of traffic packets to these both sides that will communicate by letter for node C and node D, node D is a destination node), sending node, receiving node in the control grouping that receives are respectively node A and Node B.
If node C in intercepting process, receives node A and issues the RTS grouping of Node B, the situation that may occur and to keep out of the way measure as follows: first kind of situation, node D is identical with node A, and then node C back off time is t Keep out of the way=t CTS+ t Traffic packets+ t ACK+ 3t pSecond kind of situation, node D is identical with Node B, and then node C back off time is t Keep out of the way=t CTS+ t Traffic packets+ t ACK+ 3t p, t wherein CTSThe expression CTS transmission packets time, t Traffic packetsThe transmission time of expression traffic packets, t pThe expression propagation delay, t ACKThe expression ACK transmission packets time.
If node C in intercepting process, receives node A and issues the CTS grouping of Node B, the situation that may occur and to keep out of the way measure as follows: first kind of situation, node D is identical with node A, and then node C back off time is t Keep out of the way=t Traffic packets+ t ACK+ 2t pSecond kind of situation, node D is identical with Node B, and promptly node A, C, D (B) jump at a distance of one in twos, and node C received necessarily that Node B issued the RTS grouping of node A, done respective handling in first kind of situation that this situation is narrated in front, kept out of the way processing so locate no longer to do.
On the basis of technique scheme,, then reselect different channels, otherwise keep out of the way up to this channel idle if the Traffic Channel in the control that the receives grouping is identical with the Traffic Channel of this communication selection.In addition, if after sending node sends the RTS grouping, wait for that the CTS grouping is overtime, then explanation might be the first common signal channel CCH 1Clash, sending node is if there is new traffic packets to send at this moment, and the longer contention window value of general selection is kept out of the way, as selecting than the second long contention window value t Keep out of the way 2∈ (0, N One-hop(t CTS+ 2t p)].
This shows that in the process that the communication node both sides realize shaking hands, the present invention keeps out of the way by the various conflict situations lower nodes of reasonable arrangement, has effectively avoided the first common signal channel CCH 1On conflict, improved channel and inserted success rate.
Figure 10 is the process chart of receiving node of the present invention in the RTS/CTS grouping is shaken hands, and is specially:
Step 221, intercept first common signal channel;
There is the control grouping to arrive on step 222, first common signal channel, receives and obtain the control grouping information;
Step 223, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 221, otherwise execution in step 224;
Step 224, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, are execution in step 226 then, otherwise execution in step 225;
Step 225, whether judging destination node in this node and the RTS grouping at a distance of a jumping, is execution in step 221 immediately then, otherwise uses in the table execution in step 221 after the recorded information at its channel;
Step 226, check channel use table;
Step 227, judging whether the Traffic Channel in the described RTS grouping is available, is execution in step 228 then, otherwise execution in step 221.
Step 228, answer CTS grouping on described first common signal channel, the RTS/CTS grouping is shaken hands and is finished.
The receiving node initialization finishes or is in idle condition when not having traffic packets to send, and intercepts the first common signal channel CCH 1, and the use information of the Traffic Channel that listens to recorded in the channel use table.As the first common signal channel CCH 1On when having control grouping to arrive, receiving node receives the control grouping and also obtains the control grouping information.Judge according to the information of control grouping whether the control grouping that receives is the CTS grouping, if then recorded information is used table to channel, channel uses the concluding time to be designated as: current time+traffic packets transmission time+t p, return execution in step 221 simultaneously, continue to intercept the first common signal channel CCH 1Otherwise the control of receiving grouping is the RTS grouping, judge whether described RTS grouping issues oneself, if not, judge further that then whether destination node in this node and the RTS grouping is at a distance of a jumping, it is execution in step 221 immediately then, otherwise use recorded information in the table at its channel, channel uses the concluding time to be designated as: current time+CTS transmitted in packets time+traffic packets transmission time+2t p, and return execution in step 221, continue to intercept the first common signal channel CCH 1
Issue oneself in this way, then check channel use table, judge whether the Traffic Channel in the described RTS grouping is available, be specially: if the channel user mode of the Traffic Channel in the RTS grouping is for not busy, then channel can be used, as for busy, then judge inequality: (current time+RTS transmitted in packets time+CTS transmitted in packets time+2t p) 〉=channel uses the finish time, and its value is as being true, and then channel can be used, and replys the CTS grouping on described first common signal channel, and the RTS/CTS grouping is shaken hands and finished; As be false, then judge whether to realize space division multiplexing, then do not return the CTS grouping if can not realize space division multiplexing, and return execution in step 221.
Figure 11 is sending node of the present invention process chart in the transport service grouping, is specially:
Step 311, on described Traffic Channel, send traffic packets;
Step 312, the timer of waiting for the ACK grouping is set;
Step 313, wait ACK grouping on described second common signal channel;
Step 314, judge waiting for whether the ACK grouping is overtime, is then to get back to first common signal channel to keep out of the way and intercept, prepare to attempt resending next time, otherwise execution in step 315;
Step 315, judging whether that success receives ACK grouping, is execution in step 316 then; Otherwise execution in step 313;
Step 316, traffic packets send and finish.
After transmission RTS/CTS grouping realized shaking hands on first common signal channel, sending node sent traffic packets on described Traffic Channel at sending node and receiving node, was provided with to wait for that ACK grouping timer waits for that on described second common signal channel ACK divides into groups.In the present embodiment, the time 〉=2t of timer can be set Pmax, t wherein PmaxPropagation delay for maximum.Judge to wait for during this time that the ACK grouping is whether overtime and judge whether that success receives the ACK grouping, if not overtime and receive that ACK grouping back traffic packets sends and finish; If wait for that the ACK grouping is overtime, then get back to first common signal channel and keep out of the way and intercept, prepare to attempt resending next time.
Figure 12 is receiving node of the present invention process chart in the transport service grouping, is specially:
Step 321, the timer of latency services grouping is set;
Step 322, latency services grouping on described Traffic Channel;
Step 323, judge whether latency services grouping is overtime, is then to get back to idle condition, intercepts the described first common signal channel CCH 1, otherwise execution in step 324;
Step 324, judging whether that success receives traffic packets, is execution in step 325 then; Otherwise execution in step 322;
Step 325, answer ACK grouping on described second common signal channel.
After transmission RTS/CTS grouping realized shaking hands on first common signal channel, receiving node was provided with the timer of latency services grouping at sending node and receiving node, latency services grouping on described Traffic Channel.In the present embodiment, the time 〉=2t of timer can be set Pmax, t wherein PmaxPropagation delay for maximum.Judge during this time that latency services grouping is whether overtime and judge whether that success receives traffic packets, on described second common signal channel, reply the ACK grouping after receiving traffic packets.
Figure 13 is the process chart of the present invention and sending node or receiving node adjacent node, is specially:
Step 231, intercept first common signal channel;
There is the control grouping to arrive on step 232, first common signal channel, receives and obtain the control grouping information;
Step 233, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 231; Otherwise execution in step 234;
Step 234, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, is then to carry out the handling process of receiving node in the RTS/CTS grouping is shaken hands; Otherwise execution in step 235;
Step 235, judging that whether the destination node in the RTS grouping jump at a distance of one with own, is execution in step 231 then; Otherwise use recorded information in the table, execution in step 231 at its channel.
During sending node or receiving node transmission RTS/CTS grouping realized shaking hands, the node adjacent with receiving-transmitting sides intercepted first common signal channel, as the first common signal channel CCH 1On when having control grouping to arrive, receive and obtain the control grouping information, judge whether the control grouping that receives is the CTS grouping, be recorded information in its channel use table then, wherein channel uses the concluding time to be designated as: current time+traffic packets transmission time+t pReturn and continue to intercept first common signal channel, otherwise the control of receiving grouping is exactly the RTS grouping, judge whether described RTS grouping issues oneself, be then to carry out the handling process of receiving node in the RTS/CTS grouping is shaken hands, otherwise judge whether the destination node in the RTS grouping jumps at a distance of one with own, be then to return to continue to intercept first common signal channel, otherwise recorded information is used table to channel, and wherein channel uses the concluding time to be designated as: current time+CTS transmitted in packets time+traffic packets transmission time+2t p, return and continue to intercept first common signal channel.
In technique scheme of the present invention, the control grouping comprises RTS grouping, CTS grouping and ACK grouping, and block length is identical.Wherein the information that comprises in the RTS grouping has: the Traffic Channel call number that packet format (RTS, CTS or ACK), the ID of sending node and receiving node number and sending node are selected.The information that comprises in the CTS grouping has: the Traffic Channel call number that packet format, the ID of sending node and receiving node number and receiving node are confirmed.The information that comprises in the ACK grouping has: the ID of packet format and sending node and receiving node number.The information that comprises in the traffic packets has: packet format (PKT) and sending node and receiving node ID number.
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 selection multi-address access method is characterized in that, when traffic packets will send, and execution in step:
Step 1, use table according to storage and the channel safeguarded, sending node is selected a conflict free Traffic Channel, the operating position of each Traffic Channel that described channel has used table record;
Step 2, sending node and receiving node transmit the RTS/CTS grouping on first common signal channel realizes shaking hands;
Step 3, sending node transmit traffic packets on described Traffic Channel, after receiving node successfully receives described traffic packets, reply the ACK grouping on second common signal channel.
2. multi-channel selection multi-address access method according to claim 1 is characterized in that, described step 1 is specially:
Step 11, sending node calculate and judge whether default channel is available, are then to select this Traffic Channel, and channel is selected to finish, otherwise execution in step 12;
Step 12, sending node calculate and judge whether available not use channel, are then to select available not use channel, and channel is selected to finish, otherwise execution in step 13;
Step 13, sending node calculate and judge whether available no collision channels, are then to select available no collision channels, and channel is selected to finish, otherwise keeps out of the way, and select the grouping of default channel transport service after the free time up to default channel.
3. multi-channel selection multi-address access method according to claim 2 is characterized in that, described step 11 is specially:
The call number j of step 111, calculating default channel;
Step 112, check channel use table, therefrom obtain the channel information of j Traffic Channel;
The channel user mode of step 113, j Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 114;
Step 114, judge j Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 115;
Step 115, judge that j Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 12.
4. multi-channel selection multi-address access method according to claim 2 is characterized in that, described step 12 is specially:
Channel set is not used in step 121, calculating;
Step 122, use the channel set from described that to select a call number be the not use channel of i;
Step 123, check channel use table, therefrom obtain the channel information of i Traffic Channel;
The channel user mode of step 124, i Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 125;
Step 125, judge i Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 126;
Step 126, judge that i Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 127;
Step 127, judge describedly do not use whether do not judge whether available not use channel in the channel set in addition, in this way, execution in step 122, otherwise execution in step 13.
5. multi-channel selection multi-address access method according to claim 2 is characterized in that, described step 13 is specially:
Step 131, check channel use table, therefrom obtain default channel and do not use the state parameter of channel;
Step 132, selective channel are used concluding time channel the latest, obtain the sending node and the destination node of this channel service grouping, and calculate no collision channels set according to the sending node and the destination node of this traffic packets;
Step 133, from described no collision channels set, select the no collision channels that call number is k;
Step 134, check channel use table, therefrom obtain the channel information of k Traffic Channel;
The channel user mode of step 135, k Traffic Channel of judgement, as the channel spare time, sending node is selected this Traffic Channel, and channel is selected to finish, as channel busy, execution in step 136;
Step 136, judge k Traffic Channel the use concluding time whether before this uses beginning, in this way, sending node is selected this Traffic Channel, channel is selected to finish, otherwise execution in step 137;
Step 137, judge that k Traffic Channel whether can space division multiplexing, in this way, sending node is selected this Traffic Channel, and channel is selected to finish, otherwise execution in step 138;
Step 138, judge in the described no collision channels set whether do not judge whether available no collision channels with ining addition, in this way, execution in step 133, otherwise keep out of the way, select the default channel transport service to divide into groups after the free time up to default channel.
6. multi-channel selection multi-address access method according to claim 1 is characterized in that, the handling process of sending node is specially in the described step 2:
Step 211, intercept first common signal channel;
Step 212, judge first common channel state,, then select one first contention window value at random, timer is set keeps out of the way and intercept as the channel spare time; As channel busy, then select one second contention window value at random, timer is set keeps out of the way and intercept, the described first contention window value is less than the described second contention window value;
Judge first common channel state when step 213, timer expiry, as be the channel spare time that then execution in step 214; As be channel busy, execution in step 212;
Step 214, transmission RTS grouping on described first common signal channel are provided with the timer of waiting for the CTS grouping;
Step 215, wait CTS grouping on described first common signal channel;
Step 216, judge waiting for whether the CTS grouping is overtime, is execution in step 212 then, otherwise execution in step 217;
Step 217, judging whether that success receives CTS grouping, is execution in step 218 then; Otherwise execution in step 215;
Step 218, cancellation timer, the RTS/CTS grouping is shaken hands and is finished.
7. multi-channel selection multi-address access method according to claim 1 is characterized in that, the handling process of receiving node is specially in the described step 2:
Step 221, intercept first common signal channel;
There is the control grouping to arrive on step 222, first common signal channel, receives and obtain the control grouping information;
Step 223, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 221, otherwise execution in step 224;
Step 224, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, are execution in step 226 then, otherwise execution in step 225;
Step 225, whether judging destination node in this node and the RTS grouping at a distance of a jumping, is execution in step 221 immediately then, otherwise uses in the table execution in step 221 after the recorded information at its channel;
Step 226, check channel use table;
Step 227, judging whether the Traffic Channel in the described RTS grouping is available, is execution in step 228 then, otherwise execution in step 221.
Step 228, answer CTS grouping on described first common signal channel, the RTS/CTS grouping is shaken hands and is finished.
8. multi-channel selection multi-address access method according to claim 1 is characterized in that, the handling process of sending node is specially in the described step 3:
Step 311, on described Traffic Channel, send traffic packets;
Step 312, the timer of waiting for the ACK grouping is set;
Step 313, wait ACK grouping on described second common signal channel;
Step 314, judge waiting for whether the ACK grouping is overtime, is then to get back to first common signal channel to keep out of the way and intercept, prepare to attempt resending next time, otherwise execution in step 315;
Step 315, judging whether that success receives ACK grouping, is execution in step 316 then; Otherwise execution in step 313;
Step 316, traffic packets send and finish.
9. multi-channel selection multi-address access method according to claim 1 is characterized in that, the handling process of receiving node is specially in the described step 3:
Step 321, the timer of latency services grouping is set;
Step 322, latency services grouping on described Traffic Channel;
Step 323, judge whether latency services grouping is overtime, is then to get back to idle condition, intercepts described first common signal channel, otherwise execution in step 324;
Step 324, judging whether that success receives traffic packets, is execution in step 325 then; Otherwise execution in step 322;
Step 325, answer ACK grouping on described second common signal channel.
10. multi-channel selection multi-address access method according to claim 1 is characterized in that, the handling process of the node adjacent with sending node or receiving node is specially in the described step 2:
Step 231, intercept first common signal channel;
There is the control grouping to arrive on step 232, first common signal channel, receives and obtain the control grouping information;
Step 233, judging whether the control grouping receive is the CTS grouping, is recorded information in its channel use table then, execution in step 231; Otherwise execution in step 234;
Step 234, the control grouping of receiving are the RTS groupings, judge whether described RTS grouping issues oneself, is then to carry out the handling process of receiving node in the RTS/CTS grouping is shaken hands; Otherwise execution in step 235;
Step 235, judging that whether the destination node in the RTS grouping jump at a distance of one with own, is execution in step 231 then; Otherwise use recorded information in the table, execution in step 231 at its channel.
CNB2007101186027A 2007-07-10 2007-07-10 Multi-channel selection multi-address access method Expired - Fee Related CN100512092C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007101186027A CN100512092C (en) 2007-07-10 2007-07-10 Multi-channel selection multi-address access method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007101186027A CN100512092C (en) 2007-07-10 2007-07-10 Multi-channel selection multi-address access method

Publications (2)

Publication Number Publication Date
CN101102178A true CN101102178A (en) 2008-01-09
CN100512092C CN100512092C (en) 2009-07-08

Family

ID=39036293

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007101186027A Expired - Fee Related CN100512092C (en) 2007-07-10 2007-07-10 Multi-channel selection multi-address access method

Country Status (1)

Country Link
CN (1) CN100512092C (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012058950A1 (en) * 2010-11-04 2012-05-10 中兴通讯股份有限公司 Transmission method and apparatus in wireless local area network
CN102685920A (en) * 2012-03-12 2012-09-19 暨南大学 Double-channel reservation access control method in mobile Ad Hoc network
CN102695287A (en) * 2012-06-20 2012-09-26 电子科技大学 VANET (vehicular ad-hoc network) media access control method
CN103220788A (en) * 2012-01-19 2013-07-24 华为技术有限公司 Method for grouping nodes, node and access point
CN103250461A (en) * 2010-12-13 2013-08-14 思科技术公司 Medium reservation techniques for multi-ser transmissions
CN103916884A (en) * 2014-03-04 2014-07-09 深圳市有方科技有限公司 Method for multi-channel self-adaptation optimization communication in micro-power wireless network
CN104158645A (en) * 2014-08-28 2014-11-19 上海交通大学 Media access control method based on full-duplex access point in wireless local area network
CN104279719A (en) * 2013-07-02 2015-01-14 广东美的制冷设备有限公司 Air conditioning system and communication method thereof
CN104427585A (en) * 2013-08-29 2015-03-18 联想(北京)有限公司 Electronic equipment and control method thereof
CN104902577A (en) * 2015-05-12 2015-09-09 西北工业大学 Multi-channel multiple access method based on reliable multi-step channel reservation mechanism
CN103250461B (en) * 2010-12-13 2016-11-30 思科技术公司 Medium reservation technology for multi-user transmission
WO2017031645A1 (en) * 2015-08-21 2017-03-02 华为技术有限公司 Backoff method and apparatus, and message transmission method and apparatus
CN106879031A (en) * 2017-03-23 2017-06-20 江苏中科羿链通信技术有限公司 A kind of channel wireless radio multi Mesh network resource negotiation method based on double receipts single-shots
CN109792782A (en) * 2016-09-30 2019-05-21 高通股份有限公司 For requesting to send and allowing to send the multiple timers communicated
CN109861919A (en) * 2018-11-26 2019-06-07 哈尔滨工程大学 A kind of underwater multi-channel MAC protocols available channel determination method
CN110049453A (en) * 2019-05-30 2019-07-23 磐基技术有限公司 A kind of transmission waiting interval setting method of communication equipment
WO2020034458A1 (en) * 2018-11-09 2020-02-20 Zte Corporation Multi-channel virtual sensing mechanism for wireless communications
CN111934973A (en) * 2020-08-19 2020-11-13 深圳市艾森智能技术有限公司 Wide-area Internet of things networking method and system supporting real-time reliable service

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103763076B (en) * 2014-02-21 2017-05-10 重庆邮电大学 Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks

Cited By (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012058950A1 (en) * 2010-11-04 2012-05-10 中兴通讯股份有限公司 Transmission method and apparatus in wireless local area network
US9414267B2 (en) 2010-11-04 2016-08-09 Zte Corporation Transmission method and device in wireless local area network
CN103250461A (en) * 2010-12-13 2013-08-14 思科技术公司 Medium reservation techniques for multi-ser transmissions
CN103250461B (en) * 2010-12-13 2016-11-30 思科技术公司 Medium reservation technology for multi-user transmission
US9622157B2 (en) 2012-01-19 2017-04-11 Huawei Technologies Co., Ltd. Node grouping method, node, and access point
CN103220788A (en) * 2012-01-19 2013-07-24 华为技术有限公司 Method for grouping nodes, node and access point
CN102685920B (en) * 2012-03-12 2015-05-20 暨南大学 Double-channel reservation access control method in mobile Ad Hoc network
CN102685920A (en) * 2012-03-12 2012-09-19 暨南大学 Double-channel reservation access control method in mobile Ad Hoc network
CN102695287B (en) * 2012-06-20 2014-09-24 电子科技大学 VANET (vehicular ad-hoc network) media access control method
CN102695287A (en) * 2012-06-20 2012-09-26 电子科技大学 VANET (vehicular ad-hoc network) media access control method
CN104279719A (en) * 2013-07-02 2015-01-14 广东美的制冷设备有限公司 Air conditioning system and communication method thereof
CN104279719B (en) * 2013-07-02 2017-05-10 广东美的制冷设备有限公司 Air conditioning system and communication method thereof
CN104427585A (en) * 2013-08-29 2015-03-18 联想(北京)有限公司 Electronic equipment and control method thereof
CN104427585B (en) * 2013-08-29 2018-07-03 联想(北京)有限公司 Electronic equipment and its control method
CN103916884A (en) * 2014-03-04 2014-07-09 深圳市有方科技有限公司 Method for multi-channel self-adaptation optimization communication in micro-power wireless network
CN104158645A (en) * 2014-08-28 2014-11-19 上海交通大学 Media access control method based on full-duplex access point in wireless local area network
CN104158645B (en) * 2014-08-28 2017-08-25 上海交通大学 A kind of media access control method based on full duplex access point in WLAN
CN104902577B (en) * 2015-05-12 2018-10-30 西北工业大学 A kind of multi-channel multi-address access method based on reliable step channel reservation multi mechanism
CN104902577A (en) * 2015-05-12 2015-09-09 西北工业大学 Multi-channel multiple access method based on reliable multi-step channel reservation mechanism
CN107926061A (en) * 2015-08-21 2018-04-17 华为技术有限公司 A kind of back-off method, transmission message approach and device
WO2017031645A1 (en) * 2015-08-21 2017-03-02 华为技术有限公司 Backoff method and apparatus, and message transmission method and apparatus
CN109792782B (en) * 2016-09-30 2022-06-10 高通股份有限公司 Multiple timers for requesting and permitting transmit communications
CN109792782A (en) * 2016-09-30 2019-05-21 高通股份有限公司 For requesting to send and allowing to send the multiple timers communicated
CN106879031A (en) * 2017-03-23 2017-06-20 江苏中科羿链通信技术有限公司 A kind of channel wireless radio multi Mesh network resource negotiation method based on double receipts single-shots
CN106879031B (en) * 2017-03-23 2019-11-19 江苏中科羿链通信技术有限公司 A kind of channel wireless radio multi Mesh network resource negotiation methods based on double receipts single-shots
WO2020034458A1 (en) * 2018-11-09 2020-02-20 Zte Corporation Multi-channel virtual sensing mechanism for wireless communications
US11950285B2 (en) 2018-11-09 2024-04-02 Zte Corporation Multi-channel virtual sensing mechanism for wireless communications
CN109861919A (en) * 2018-11-26 2019-06-07 哈尔滨工程大学 A kind of underwater multi-channel MAC protocols available channel determination method
CN110049453A (en) * 2019-05-30 2019-07-23 磐基技术有限公司 A kind of transmission waiting interval setting method of communication equipment
CN110049453B (en) * 2019-05-30 2021-07-09 磐基技术有限公司 Transmission waiting interval setting method of communication equipment
CN111934973A (en) * 2020-08-19 2020-11-13 深圳市艾森智能技术有限公司 Wide-area Internet of things networking method and system supporting real-time reliable service

Also Published As

Publication number Publication date
CN100512092C (en) 2009-07-08

Similar Documents

Publication Publication Date Title
CN100512092C (en) Multi-channel selection multi-address access method
Lu et al. A dedicated multi-channel MAC protocol design for VANET with adaptive broadcasting
US9351301B2 (en) Maintenance of time slot usage indicators and self-organizing networking
CN100477613C (en) Distributed wireless access method and apparatus based on network distribution vector table
KR101380933B1 (en) Radio communication system, radio communication device, radio communication method and computer program
US7190686B1 (en) Self configuring high throughput medium access control for wireless networks
US6236662B1 (en) Multirate time reservation multi-access protocol
EP3025557B1 (en) Transmission unit allocation and use in networks
JP2011517142A (en) Method for communicating in a network comprising a set of coordinator nodes and leaf nodes
US8885631B2 (en) Multiuser detection enabled medium access control in mobile ad hoc networks
CN101764679A (en) Distributed collaborative multiple access method and system thereof
CN102625367B (en) Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network
CN102170665B (en) Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service
Jovanovic et al. Reduced‐frame TDMA protocols for wireless sensor networks
CN100559903C (en) Adapter distribution multi-address access method
Haas et al. Collision-free medium access control scheme for ad-hoc networks
US8976728B2 (en) Distributed medium access control (DMAC) for mobile ad hoc networks
Myers et al. An adaptive generalized transmission protocol for ad hoc networks
Toumpis et al. New media access protocols for wireless ad hoc networks based on cross-layer principles
CN101141176B (en) Distributed acquisition multi-access method
Ouni et al. Enhanced EDCA with deterministic transmission collision resolution for real-time communication in vehicular ad hoc networks
Huang et al. Listen before receive (lbr) assisted network access in laa and wifi heterogeneous networks
Abdulrazzak et al. Performance analysis of CSMA/CA based on D2D communication
Garcia-Luna-Aceves et al. Making CSMA Collision-Free and Stable Using Collaborative Indexing
Callaway Jr The wireless sensor network MAC

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

Termination date: 20150710

EXPY Termination of patent right or utility model