CN105680989B - A kind of distributed multi-channel multi-address access method based on concurrent cooperation - Google Patents
A kind of distributed multi-channel multi-address access method based on concurrent cooperation Download PDFInfo
- Publication number
- CN105680989B CN105680989B CN201610004552.9A CN201610004552A CN105680989B CN 105680989 B CN105680989 B CN 105680989B CN 201610004552 A CN201610004552 A CN 201610004552A CN 105680989 B CN105680989 B CN 105680989B
- Authority
- CN
- China
- Prior art keywords
- node
- cooperation
- data
- channel
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/002—Transmission of channel access control information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
- H04L1/0077—Cooperative coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1215—Wireless traffic scheduling for collaboration of different radio technologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1221—Wireless traffic scheduling based on age of data to be sent
Abstract
The present invention provides a kind of distributed multi-channel multi-address access method based on concurrent cooperation,It is related to field of communication technology,The present invention mainly controls handshake procedure and data transmission procedure,After control handshake procedure node competes successfully according to distributed coordination function mechanism on a common control channel,Source node is with destination node in control channel interactive control information,Complete data processing,Data transmission procedure transmitting-receiving node and cooperative node are on the data channel consulted,The transmission of packet is completed according to coordination strategy,Since the transmitting-receiving node in network only needs a set of transceiver,It realizes simple,As a result of cooperation transmission,So that the packet number transmitted in each TXOP increases,Network throughput is greatly improved,And reduce average packet time delay,The present invention uses distributed working method,It is synchronized when without center control nodes and the whole network.
Description
Technical field
The present invention relates to field of communication technology, the multiple access method under especially a kind of multichannel environment.
Background technology
Currently, multiple available frequency channels resources have been provided in 802.11 standards of IEEE, for example, 2.4GHz
There is the non-overlapped channel of 3 20MHz in frequency range, and has the non-overlapping available channel of a 20MHz more than 20 in 5GHz frequency ranges, and
Big band width service demand is continuously increased with the sustainable growth and user of mobile subscriber's quantity, such as video conference industry
Business so that channel resource becomes more nervous.Therefore, efficient multichannel multiple access access (Multi-channel how is designed
MAC, McMAC) agreement, current limited channel resource is farthest utilized, research hotspot of people's attention is had become
Problem.However due to the fading characteristic of wireless channel, when the distance between transmitting-receiving node farther out when, it is necessary to reduce data transmission speed
Rate ensures the reliability communicated between transmitting-receiving node, this will have a greatly reduced quality to the throughput performance of multichannel system.Therefore, people
The lower rate transmissions of long distance transmission link are solved the problems, such as by using cooperation transmission technology.In the Protocol Design of McMAC
In, a kind of typical method is that an original lower rate transmissions link is divided into two high-speed transfer chains on the different channels
Road, i.e., in first time slot, the packet that source node will first be sent with high-speed is sent to cooperative node, then by cooperating
Node is transmitted to destination node in second time slot with high-speed, and such cooperation mode is known as " serial cooperation " (Serial-
Coop, SC).But in the method serially to cooperate, the cooperation forwarding of each packet is required to two time slots of consumption, this is big
Increase packet delay greatly.In order to overcome the problems in serial collaboration method, Shila D M et al. to propose a kind of based on " simultaneously
The McMAC agreements of row cooperation " (Parallel-Coop), referred to as CoopMC, i.e., by parallel on two different data channels
Initiate cooperation transmission process.It, should although concurrent cooperation method can effectively promote message transmission rate and reduce packet delay
There is also problems in agreement：First, the agreement is based on time synchronization, realize that difficulty is larger, complexity is high；Second,
CoopMC assumes that the transmitting-receiving node in network has known best cooperative node information in advance, this is not inconsistent with actual conditions；
Third, the agreement can not adapt to the dynamic change of available channel number in network.
Therefore, in the presence of background above technology the drawbacks of, the present invention propose a kind of point based on concurrent cooperation
Cloth multi-channel multi-address access method.In the method, transmitting-receiving node uses standard agreement IEEE802.11 on a control channel
Be at war with distributed coordination function DCF (Distributed Coordination Function) access, and completes：1) number
It is believed that the negotiation in road；2) selection of optimal cooperative node；3) selection of coordination strategy；And 4) data channel service condition information
It is shared.In turn, receiving-transmitting sides initiate cooperation transmission process on the data channel negotiated.In addition, this technology invention is not required to
Time synchronization is wanted, distributed implementation is easy, and the technology of the present invention is mutually compatible with traditional 802.11 standard agreements of IEEE.It is imitative
Very the result shows that, the present invention significantly improves network performance.
Invention content
For overcome the deficiencies in the prior art, the present invention is not under the premise of needing network time synchronization, in multichannel net
According to available data channel number in network come dynamic construction cooperation transmission in network, to lifting system performance.
The invention mainly comprises two large divisions：Control handshake procedure and data transmission procedure.
1. controlling handshake procedure
When node is on a common control channel according to traditional 802.11 distributed coordination function DCF of IEEE
After (Distributed Coordination Function) mechanism competes successfully, source node is with destination node in control channel
Interactive control information is completed to the negotiation of data channel, the competition of best cooperative node, the selection of cooperation transmission strategy and number
It is believed that road use information is shared.
2. data transmission procedure
After completing to control handshake procedure, transmitting-receiving node pair and its corresponding cooperative node are in the data channel consulted
On, the transmission of packet is completed according to selected coordination strategy.
In the inventive solutions, on the one hand, transmitting-receiving node is by the way that structure is parallel on the different channels in a distributed manner
Cooperation transmission, to significantly promote cooperation transmission rate；On the other hand, transmitting-receiving node is according to available data channel in network
Number carrys out dynamic select cooperation transmission strategy, to ensure that the system performance when available data channels number is less.
Multi-channel multi-address access method consideration proposed by the present invention has K+1 available channel in a network, wherein 1 is control
Channel CH (Control Channel) processed, remaining K data channels for equiband are expressed as DHi, i=1 ..., K.
There are N number of node, and additionally M cooperative node of arrangement, each node to be equipped with two secondary half-duplex transceivers in network.
Steps are as follows for the technical solution adopted by the present invention to solve the technical problems：
Step 1：When source node S has packet to need to send, source node S is on a control channel according to IEEE
802.11 distributed coordination function DCF (Distributed Coordination Function) carry out binary exponential backoff,
After the completion of keeping out of the way, source node sends cooperation request on control channel CH (Control Channel) and sends CRTS
(Cooperation-Request-to-Send) frame, wherein CRTS frame formats add the channel control field of 2 bytes, are used for
The information whether free time of designation date channel 1~16, is transferred to step 2, otherwise rests in step 1 and continue to compete later；
Step 2：All potential cooperative node r in networki, after (1≤i≤M) receives CRTS, received by calculating
The Signal to Interference plus Noise Ratio SINR (Signal and Interference to Noise Ratio) of CRTS frames, and then obtained by tabling look-up
The maximum modulation and coding mode that oneself Radio Link between source node can use(Modulation and
Coding Scheme) and corresponding message transmission rateWherein message transmission rateUnit be bps, when
After destination node D receives CRTS, calculates SINR and obtain the maximum that oneself Radio Link between source node can use
Modulation and coding mode MCSdAnd corresponding data direct transfer rate Rd, it is transferred to step 3 later；
Step 3：In a length of short interFrameGap SIFS (Short Inter-frame after receiving CRTS frames and when being spaced
Space after), destination node D, which replys cooperation, to be allowed to send CCTS (Cooperation-Clear-To-Send) frame, wherein CCTS
Frame format adds the channel control field of 3 bytes, wherein 2 bytes are used to indicate common data channels field, i.e. source node S
Two publicly available data channels between destination node D, remaining 1 byte are used to indicate between transmitting-receiving node the chain that direct transfers
The maximum data transfer rate R that road can used, as potential cooperative node r in networkiAfter receiving CCTS, according to CCTS
The SINR of frame knows cooperative node, the maximum modulation and coding mode that the Radio Link between destination node D can useAnd corresponding data rateriAccording to obtainedWithCalculate separately using serial cooperation with it is parallel
Mean data rate under collaboration situationIt is represented by：Wherein
Be when using " serial coordination strategy SC (Serial-Coop) " can be obtained average data transfer rate, andIt is to work as to adopt
Average data transfer rate, R are can be obtained with " concurrent cooperation strategy PC (Parallel-Coop) "srIt is source node and cooperate
Obtainable maximum rate between node；RrdIt is obtainable maximum rate between cooperative node and destination node, it is potential to assist
Make node riIn conjunction with the data channel information in the CRTS and CCTS received, the available number for including in CRTS and CCTS frames is read
It is believed that road, selects public available data channels according to the available channel list ACL of oneself, negotiates source node S, destination node D
And cooperative node riBetween publicly available data channel, i.e. cooperative node takes friendship in conjunction with the available channel list ACL of oneself
Collection, you can source node S, destination node D and the public available data channels of cooperative node three are obtained, if source node S is in SIFS
CCTS groupings are received in time, then are transferred to step 4, are otherwise competed again in return to step 1；
Step 4：Potential cooperative node riCalculate the equivalent rate that can be obtainedWherein,
To use average transmission rateIn the case of, the packet number that can be transmitted within a TXOP times,TtxopIndicate transmission opportunity TXOP (Transmission Opportunity) times
Length,It indicates to pass through cooperative node riTransmit Data and be grouped required time, SIFS indicate short interFrameGap when
It is long,It indicates to pass through cooperative node riIt transmits ACK and is grouped the required time,Indicate the number that can be initiated in the unit interval
According to the average time of transmission, L [P] indicates average packet size,Indicate the control for being once successfully selected out best cooperative node
It shakes hands duration, includes the interaction of CRTS, CCTS and HTS frame, andIndicate duration needed for data transmission and equal to TXOP's
Duration, i.e.,Potential cooperative node is according to respectiveAnd current publicly available data channel number L is moved
Select to state cooperation transmission strategy：
If meeting conditionThen selected is serial cooperation SC (Serial-Coop) strategy,
If meeting conditionWhat is then selected is concurrent cooperation PC (Parallel-Coop) strategies, wherein
Equivalent rate when referring to using serial coordination strategy,Equivalent rate when referring to not using cooperation transmission,
Equivalent rate when referring to using concurrent cooperation strategy, L are current available data channels numbers；
The participation cooperation transmission if potential cooperative node has an opportunity, you can to select SC or PC coordination strategies, then alternative
Cooperative node rjIt is transferred to step 5 to start to compete, otherwise cooperative node holding is intercepted, and competition is not involved in；
Step 5：Meet the condition in step 4OrCooperation section
Point is alternative cooperative node, alternative cooperative node rjAccording to the selected cooperation transmission strategy of step 4, calculate different alternative
Cooperative node rjBackoff valueAnd then according to backoff value in period WIt carries out numerical value to keep out of the way, if backoff counter subtracts
Be 0, then alternative cooperative node rjIt sends cooperation and is ready for sending HTS (Helper-ready-To-Send) frame, HTS frame formats add
Add the channel control field for sending address field and 3 bytes, wherein 2 bytes are used to indicate common data channels field, i.e. source
Two publicly available data channels between node S and destination node D, remaining 1 byte are used to indicate this data transmission
Once other cooperative nodes of cooperation transmission strategy used by process detect that channel becomes busy in the W periods, then stop keeping out of the way immediately,
It is transferred to step 6 later；
Step 6：If source node S receives HTS frames, cooperative node of the cooperative node as this of the HTS frames will be sent,
And data channel number entrained in HTS frames and institute coordination strategy to be used are extracted, after SIFS time intervals
It is transferred to step 7；If source node does not receive HTS frames within the W periods, a public data are chosen according to the CCTS frames received
Channel, and select to carry out this data transmission using the mode of direct transferring, it is transferred to step 7 later；
Step 7：Source node sends cooperation and reserves CRES (Cooperation-Reservation) frame on a control channel,
CRES frame formats add the channel control field of 4 bytes, are used wherein 1 byte is used to indicate this data transmission procedure
Cooperation transmission strategy, 2 bytes are used to indicate selected data channel number, and remaining 1 byte is used to indicate selected
The cooperative node number selected, meanwhile, source node is on the data channel negotiated, using the selected cooperation transmission plan of step 4
Slightly, Data is sent in TXOP to be grouped and ACK (Acknowledgement) is waited for confirm, when cooperative node receives the CRES frames
Cooperative node domain, by parsing the cooperative node that carries in CRES, if the serial number phase of the value in cooperative node domain and cooperative node
Together, then the data channel and coordination strategy information of CRES frames are obtained, packet is then participated on corresponding data channel
Cooperation transmission, otherwise the cooperative node keep intercepting on a control channel, when destination node D is receiving the CRES from source node
Afterwards, CRES frames are also broadcasted again on a control channel after the SIFS times, when receiving-transmitting sides complete the data transmission in TXOP
Afterwards, return to step 1.
The advantageous effect of this patent is since the transmitting-receiving node in network only needs a set of transceiver, thus realization letter
It is single, and the scheme of the invention can be realized in the firmware for supporting multichannel network interface card, while can also realize in driver；Due to
The scheme of the invention uses cooperation transmission so that the packet number transmitted in each TXOP increases, and net is greatly improved
Network handling capacity, and reduce average packet time delay；Since the present invention uses distributed working method, without center control nodes
And it is synchronized when the whole network.
Description of the drawings
Fig. 1 is technical solution of the present invention schematic diagram, and wherein Fig. 1 (a) indicates that Straight transmission model, Fig. 1 (b) is used to indicate using pure
Serial cooperation transmission mode, Fig. 1 (c) indicate that SIFS is short interFrameGap (Short Inter- using concurrent cooperation transmission mode
Frame Space), DIFS is distributed interframe gap (Distributed Inter-frame Space), and W indicates competition hair
Send the period of HTS frames, tstartAt the time of expression starts to send first reservation data grouping.
Fig. 2 is the relation curve between saturation throughput and data channel number.
Fig. 3 is the relation curve between average packet time delay and data channel number.
Fig. 4 is the Reference Design of CRTS frame formats, wherein CRTS is that cooperation request sends (Cooperation-
Request-to-Send)。
Fig. 5 is the Reference Design of CCTS frame formats, wherein CCTS, which is cooperation, to be allowed to send (Cooperation-Clear-
To-Send)。
Fig. 6 is the Reference Design of HTS frame formats, and wherein HTS is that cooperation is ready for sending (Helper-ready-To-Send).
Fig. 7 is the Reference Design of CRES frame formats, and wherein CRES is that (Cooperation- is reserved in cooperation
Reservation)。
Specific implementation mode
Present invention will be further explained below with reference to the attached drawings and examples.
The present invention can be realized in wireless network card by firmware, or be realized among the driver of wireless network card, under
Face combines example that the realization of the present invention is described in detail.
1, the construction method of data channel service condition list
It can be created using each node of cut-in method of the present invention and safeguard two structure chained lists：Data channel uses row
Table DCUL (Data Channel Usage List) and available channel list ACL (Available Channel List).Wherein
The data channel use information of all neighbor nodes is stored in DCUL respectively, and present node is stored in ACL to be used
Data channel label, the details of DCUL and ACL are as follows：
Structure in DCUL has following variable：
channel：The variable is numbered for storing data channel used in neighbor node；
stime：The variable is grouped for storing data will be at the time of data channel starts to send；
time：The transmission that the variable is grouped for storing data will occupy the total duration of data channel, in Fig. 1
TXOP durations Ttxop。
Structure in ACL includes mainly a variable：
channel：The data channel number that the variable can be used for memory node itself.
2, the update method of data channel service condition list
When node receive be not to oneself HTS or CRES grouping after, the DCUL of oneself can be updated.Assuming that control letter
Current time after the completion of breath is shaken hands is denoted as tstart, the when a length of T of TXOPtxop, it is as follows：
Parse " selected cooperation transmission strategy " domain in HTS/CRES groupings.According to be " serial cooperation " or it is straight
When biography mode, then increase a new construction body DCUL [i] in DCUL and by " first in " selected data channel " domain
The value of data channel number " field is assigned to DCUL [i] .channel；According to be " concurrent cooperation ", then increase in DCUL
Two new construction body DCUL [i] and DCUL [i+1], and by " selected data channel " domain " first data channel is compiled
Number " value of field and " second data channel number " field is assigned to DCUL [i] .channel and DCUL [i+1] respectively
.channel；
Parse " selected cooperation transmission strategy " domain in HTS/CRES groupings.Assuming that TcurrentIndicate current time,
Then carry out the assignment operation of following three kinds of situations：
Situation 1：The case where what is received is HTS groupings
If instruction is using " serial cooperation ", DCUL [i] .stime=t in HTS groupingsstart=tcurrent+ SIFS, and
DCUL [i] .time=Ttxop, wherein DCUL [i] .stime indicates that the packet that stores will be in data channel in i-th DCUL
At the time of starting to send, tstartAt the time of indicating to start transmission data grouping, DCUL [i] .time indicates to store in i-th DCUL
The transmission of packet occupies the total duration of data channel；If instruction uses " concurrent cooperation " in HTS groupings, DCUL [i]
.stime=DCUL [i+1] .stime=tstart=tcurrent+ SIFS and DCUL [i] .time=DCUL [i+1] .time=
Ttxop+tData, wherein DCUL [i+1] .stime indicates that the packet stored in i+1 DCUL will start to send out in data channel
At the time of sending, DCUL [i+1] .time indicate the transmission of storage packet in i+1 DCUL occupy data channel it is total when
It is long, tDataTo transmit the duration of Data groupings using " concurrent cooperation ".
Situation 2：The case where what is received is first CRES grouping
If instruction is using " serial cooperation ", DCUL [i] .stime=t in CRES groupingsstart=tcurrent-tCRES,
And DCUL [i] .time=Ttxop, wherein tCRESFor the transmission time of CRES frames；If instruction is using " parallel association in CRES groupings
Make ", then DCUL [i] .stime=DCUL [i+1] .stime=tstart=tcurrent-tCRES, and DCUL [i] .time=DCUL
[i+1] .time=Ttxop+tData, wherein tCRESDefinition is the transmission time of CRES frames；
Situation 3：The case where what is received is second CRES grouping
If instruction is using " serial cooperation ", DCUL [i] .stime=t in CRES groupingsstart=tcurrent-2tCRES-
SIFS and DCUL [i] .time=TDTP；If instruction uses " concurrent cooperation " in CRES groupings, DCUL [i] .stime=DCUL
[i+1] .stime=tstart=tcurrent-2tCRES- SIFS and DCUL [i] .time=DCUL [i+1] .time=Ttxop+tData。
3, the judgment method of data channel free time
Data channel list for judging whether data channel is idle within the TXOP periods that institute's transmission data is grouped in advance.
Assuming that the current time after the completion of control information is shaken hands is denoted as tstart, the when a length of T of TXOPtxop, then judging that data channel is
It is idle, it is only necessary to meet a condition：The conflicting information of data packet transfer that does not have in DCUL chained lists and will carry out, i.e., pair
Any one information DCUL [i] in DCUL, the period [t that node will transmitstart,tstart+Ttxop] with DCUL [i] in
Time segment information [DCUL [i] .stime, DCUL [i] .stime+Ttxop] non-overlapping.
Specific implementation step is as follows：
Multi-channel multi-address access method hypothesis proposed by the present invention has K+1 available channel in a network, wherein 1 is public affairs
Control channel CH, remaining K data channel for equiband altogether, is expressed as DHi, i=1 ..., K, each node are equipped with
Two sets of half-duplex transceivers are specially intercepted wherein a set of is " control transceiver " and receive and dispatch control and hold on a control channel
Hand information, another set of is " data transceiver ", can carry out transmission data grouping by any switching laws in all data channels.This hair
Bright supported frame format include but not limited to more than frame format.
Fig. 1 is technical solution of the present invention schematic diagram, and wherein Fig. 1 (a) indicates that Straight transmission model, Fig. 1 (b) is used to indicate using pure
Serial cooperation transmission mode, Fig. 1 (c) indicate to use concurrent cooperation transmission mode.
Step 1：When source node S have packet need send when, S on a control channel according to IEEE 802.11DCF into
Row binary exponential backoff competitive channel, after keeping out of the way successfully, source node sends CRTS frames on CH, is transferred to step 2 later, no
It then rests in step 1 and continues to compete；It is as follows：
Step 1.1：Source node S is kept out of the way on a control channel by the way of IEEE 802.11DCF, when keeping out of the way into
Step 1.2 is transferred to after work(, otherwise return to step 1；
Step 1.2：It is each number that source node S judges that data were sent in the period using " judgment method of data channel free time "
It is believed that whether road is idle；As without return to step 1 if idle, if there are one or more than one data channel it is idle, according to " number
According to the construction method of channel usage list " by the number record of all idle data channels in ACLSIn and be transferred to step
1.3；
Step 1.3：Source node S builds CRTS groupings, as shown in Figure 4, wherein the domain " NAV " setting in being grouped CRTS
For NAVCRTS, NAVCRTS=DIFS+3SIFS+tCCTS+2tCRES+tHTS, the distributed interframe gap of wherein DIFS expressions
The duration of (Distributed Inter-frame Space), tCCTSIt is the transmission time of CCTS frames, tHTSIt is the transmission of HTS frames
Time；For " channel control " field, the idle data channel number that will be obtained in step 1.2 fills out one writing in corresponding position
On, remaining is " 0 ", for example, if the data channel channel idle that data channel number is 1 and 7, " channel control " field
Value is " 1000001000000000 ", remaining field of CRTS groupings is provided with laggard according to IEEE802.11 standard settings
Enter step 1.4；
Step 1.4：The CRTS of generation is grouped on control channel CH and sends by source node S, is transferred to step 2 later；
Step 2：Potential cooperative node r in networkiAfter receiving CRTS, the SINR of CRTS frames is received by calculating,
And then the maximum modulation and coding mode that can be used by Radio Link of the acquisition oneself between source node of tabling look-up
(Modulation and Coding Scheme) and corresponding message transmission rateLikewise, when destination node D is received
To after CRTS, calculates SINR and obtain maximum modulation and coding staff that oneself Radio Link between source node can use
Formula MCSdAnd corresponding data direct transfer rate Rd.It is transferred to step 3 later；
It is as follows：
Step 2.1：Potential cooperative node r in networkiAfter receiving CRTS, the SINR for receiving CRTS frames is calculated,
I.e.Wherein, PsTo receive the power of signal, PNFor noise power, PIFor jamming power, it is obtained by calculation
SINR value table look-up to obtain the maximum MCS value that can be usedWith corresponding data rateFor example, in IEEE
8 kinds of data rates, respectively 6,12,18,24,36,48 and 54Mbps are just defined in 802.11a standards.It is transferred to step later
2.2。
Step 2.2：After destination node D receives the CRTS from source node S, the SINR of CRTS frames is calculated, i.e.,And it tables look-up to obtain workable maximum MCS value MCS by SINR valuedWith corresponding data rate Rd,
Calculating direct transfers the SINR and corresponding data rate R of link (i.e. Radio Link between S and D)d, it is transferred to step 3 later；
Step 3：After receiving CRTS frames and it is spaced SIFS, destination node D replys CCTS frames.It potentially cooperates in network
Node riAfter receiving CCTS, know that oneself Radio Link between destination node can make according to the SINR of CCTS frames
Maximum modulation and coding modeAnd corresponding data rateLater, riAccording to obtainedWithUse " serial cooperation " and the mean data rate in the case of " concurrent cooperation " are calculated separately, is expressed as：If source node S receives CCTS groupings in time SIFS, it is transferred to step 4,
Otherwise it is competed again in return to step 1；It is as follows：
Step 3.1：It is each that destination node D judges that data were sent in the period using " judgment method of data channel free time "
Whether data channel is idle；As without return to step 1 if idle, if otherwise there are one or more than one data channel it is idle,
Will according to " construction method of data channel service condition list " by the number record of all idle data channels in ACLD, and with
Available data channels list ACL in CRTS framesSCompare, select two public available data channels and is deposited into CCTS points
In " common data channels " domain in group.In addition, domain " NAV " during CCTS is grouped by destination node D is set as NAVCCTS, and have
NAVCCTS=DIFS+2SIFS+2tCRES+tHTS, and set " direct transfer rate " domain to Rd, as shown in Figure 5.Remaining of CCTS groupings
Domain is configured according to 802.11 standards of IEEE；CCTS frames are sent after being provided on a control channel, are transferred to step later
3.2；
Step 3.2：Potential cooperative node r in networkiAfter receiving CCTS, using " the judgement of data channel free time
It is whether each data channel is idle that method ", which judges that data were sent in the period,；As without return to step 1 if idle, if there are one or
More than one data channel is idle, then is believed all idle datas according to " construction method of data channel service condition list "
The number record in road existsJudgePublicly available data are believed in " common data channels " domain in being grouped with CCTS
Road, and remember that available data channels number is L, and then calculate and receive the SINR of CCTS frames and by tabling look-up to obtain oneself and purpose
The maximum modulation and coding mode that Radio Link between node can useAnd corresponding data rateIt
After be transferred to step 3.3；
Step 3.3：Cooperative node riAccording to obtainedWithCalculate separately use " serial cooperation " strategy with
Mean data rate under " concurrent cooperation " strategy scenarios, respectively：WithIt
After be transferred to step 4；
Step 4：Potential cooperative node riCalculate the equivalent rate that can be obtainedLater, potential
Cooperative node according to respectiveAnd current publicly available data channel number L is dynamically selected cooperation transmission plan
Slightly.If cooperative node has an opportunity participation, cooperation transmission (meets conditionOrSo cooperative node rj, 1≤j≤M is transferred to step 5 and starts to compete, and otherwise keeps silent；Specifically
Steps are as follows：
Step 4.1：Cooperative node riCalculate separately use " non-cooperating transmission " NC (Non-Coop), " serial cooperation " SC
(Serial-Coop) and the equivalent rate of " concurrent cooperation " PC (Parallel-Coop) modeWithIts
In,To use average transmission rateWhen, the number that can be transmitted within a TXOP times
According to grouping number.Indicate that the average time for the data transmission that can be initiated in the unit interval, L [P] indicate average packet size.It indicates that the control for being once successfully selected out best cooperative node is shaken hands duration, includes the interaction of CRTS, CCTS and HTS, and
It indicates duration needed for data transmission and the duration equal to a TXOP is (i.e.).Public data available letter is obtained simultaneously
Trace gather is combined intoAnd remember that publicly available data channel number is L.It is transferred to step 4.2 later；
Step 4.2：Cooperative node riStrategy is transmitted according to currently available data channel number L selecting collaborations.I.e.：In L
In the case of=1, if meeting condition" serial cooperation " strategy is then selected, Straight transmission model is otherwise used；As L > 1
When, if meeting conditionIt then selects " concurrent cooperation " tactful, otherwise uses Straight transmission model.If meeting conditionOrThen these alternative cooperative node rjIt is transferred in step 5 and participates in
Otherwise competition is kept silent；
Step 5：Alternative cooperative node rjAccording to selected cooperation transmission strategy, respective backoff value is calculatedInto
And according to backoff value within the W periodsNumerical value is carried out to keep out of the way.If backoff counter is kept to 0, cooperative node sends HTS frames.
Once other cooperative nodes detect that channel becomes busy in the W periods, then stops keeping out of the way.It is transferred to step 6 later；It is as follows：
Step 5.1：Cooperative node rjAccording to formulaCalculate backoff valueWhereinFor association
Make node rjThe mean data rate obtained, RmaxFor the peak transfer rate that can be obtained, in IEEE 802.11a standards
For 54Mbps, cwminFor RmaxCorresponding minimum backoff value, wherein for serial coordination strategy,For
Concurrent cooperation strategy,It is transferred to step 5.2 later；
Step 5.2：Cooperative node rjAccording to calculated backoff valueIt carries out numerical value to keep out of the way, if backoff counter is kept to
0, then it is transferred to step 5.3；
Step 5.3：Cooperative node rjHTS groupings are built, as shown in Figure 6.Wherein, the domain " NAV " setting in HTS being grouped
For NAVHTS, wherein NAVHTS=2tCRES+2tSIFS；rjSelected cooperation transmission plan is inserted in " cooperation flag ", if selection
Using serial coordination strategy, then cooperation flag is filled out as " 1 ", if selection concurrent cooperation strategy, will cooperation flag fill out for
"2".In addition, rjBy the common signal channel number filling " common data between source node S, destination node D and cooperative node itself
Channel domain " then need to only fill in " first data channel number " field, according to concurrent cooperation according to serial coordination strategy
Strategy then needs to fill in " first data channel number " and " second data channel number " field simultaneously.HTS grouping its
Remaining field sends HTS frames, enters step 6 later on a control channel according to 802.11 standard settings of IEEE after being provided with；
Step 6：If source node S receives HTS frames, cooperative node of the cooperative node as this of the HTS frames will be sent,
And data channel number entrained in HTS frames and institute coordination strategy to be used are extracted, and turn after the intervals SIFS
Enter step 7；If source node does not receive HTS frames within the W periods, a public data letter is chosen according to the CCTS frames received
Road, and select to carry out this data transmission using the mode of direct transferring, it is transferred to step 7 later；It is as follows：
Step 6.1：If source node receives HTS frames, the transmission address field of HTS frames is extracted and using the cooperative node as this
The cooperative node of secondary cooperation transmission process, and the cooperative node is defined as ropt, later, it is transferred to step 6.2；
Step 6.2：Source node extracts data channel number entrained in HTS and cooperation flag information, with this come into
The subsequent data transmission procedure of row.If source node does not receive HTS frames within the W periods, source node receives before
CCTS frames, choose a publicly available data channel, referred to as DHs, andWherein ACLSExpression source
The available data channels list of node S, ACLDIndicate the available data channels list of destination node D, DHsIndicate selected public affairs
Data channel number altogether, and the mode of direct transferring is selected to carry out data transmission.If that neighbors receives is not the HTS sent to oneself
Grouping then updates the DCUL of oneself according to " update method of data channel service condition list ", later, is transferred to step 7；
Step 7：Source node sends CRES frames on a control channel, while source node is adopted on the data channel negotiated
Data groupings are sent in TXOP simultaneously with selected cooperation transmission strategy (including serially cooperating, concurrent cooperation or the mode that direct transfers)
Wait for ACK.After cooperative node receives the CRES frames, the cooperative node carried in CRES is parsed, if cooperative node is oneself
Words, then further obtain data channel and coordination strategy information therein, and data point are then participated on corresponding data channel
Group cooperation transmission, otherwise the cooperative node keep intercepting on a control channel.When destination node is being received from source node
After CRES, CRES frames are also broadcasted on a control channel after SIFS.After receiving-transmitting sides complete the data transmission in TXOP, return
Return step 1.If node, which receives, to be grouped to the CRES oneself sent, the DCUL of oneself is updated.It is as follows：
Step 7.1：Source node builds CRES groupings, as shown in Figure 7.Wherein, " selected cooperation passes in CRES being grouped
Defeated strategy " field is set as transmission mode used by this data transmission, for example, selecting using serial coordination strategy, then should
Field, which is filled out, fills out the field if selecting concurrent cooperation strategy for " 1 " and then fills out the field according to the mode of direct transferring for " 2 "
For " 0 "；" selected data channel " domain is set to this data transmission data to be used channel number, if wherein adopting
With concurrent cooperation strategy, then the field for filling in two data channels number respectively is needed, according to serial coordination strategy or directly
Biography mode then only needs to fill in first data number field, and second data number field is set as empty；To be " selected
Cooperative node " domain is set as identified cooperative node serial number r in step 6optIf not choosing cooperative node, it is set as
It is empty.Remaining field of CRES groupings sends CRES on a control channel according to 802.11 standard settings of IEEE after being provided with
Frame enters step 7.2 later；If neighbors, which receives, to be grouped to the CRES oneself sent, according to " data channel uses
The update method of situation list " updates the DCUL of oneself.
Step 7.2：After cooperative node receives CRES frames, the cooperative node number carried in CRES is parsed, if cooperation
The number of node oneself, then the cooperative node is according to the cooperation transmission strategy and data channel information carried in CRES, corresponding
Data channel on participate in packet cooperation repeating process, otherwise the cooperative node keep intercepting on a control channel.When
Destination node D also sends CRES frames on a control channel after receiving the CRES from source node after SIFS.If neighbors
Receiving is grouped to the CRES oneself sent, then updates oneself according to " update method of data channel service condition list "
DCUL.After receiving-transmitting sides complete the data transmission in TXOP, return to step 1.
Network saturation throughput and average packet time delay this two performance indicators, and and IEEE have been counted in emulation
802.11DCF, non tie up system and pure serial cooperation mode are compared, and are considered single-hop wireless networks and are ignored antenna
Handover delay, main simulation parameter are as follows：
Network includes 1 control channel and 10 data channels, and all channels are ideal communication channel, in network
20 nodes, including 10 source nodes and 10 destination nodes are shared, and arrange 4 cooperative nodes, in addition, Ttxop=3ms,
The magnitude of load of packet is 1024bytes, SIFS=16 μ s, DIFS=34 μ s, CWmin=15slotslots, time slot are long
Slot time=9 μ s are spent, the setting of other simulation parameters refers to IEEE 802.11a standards.By simulation result as can be seen that
The throughput performance of the technical program is far above IEEE 802.11DCF and other three kinds of transmission modes, and with data channel
The increase of number is greatly reduced from figures 2 and 3, it will be seen that the saturation throughput performance of the present invention is in optimal always
Average packet time delay.
Claims (1)
1. a kind of distributed multi-channel multi-address access method based on concurrent cooperation, it is characterised in that include the following steps：
Step 1：When source node S has packet to need to send, source node S is divided according to IEEE 802.11 on a control channel
Cloth coordination function DCF (Distributed Coordination Function) carries out binary exponential backoff, when having kept out of the way
Cheng Hou, source node send cooperation request on control channel CH (Control Channel) and send CRTS (Cooperation-
Request-to-Send) frame, wherein CRTS frame formats add the channel control field of 2 bytes, are used to indicate data channel 1
Information whether~16 free time, is transferred to step 2, otherwise rests in step 1 and continue to compete later；
Step 2：All potential cooperative node r in networkiAfter receiving CRTS, wherein 1≤i≤M is received by calculating
The Signal to Interference plus Noise Ratio SINR (Signal and Interference to Noise Ratio) of CRTS frames, and then obtained by tabling look-up
The maximum modulation and coding mode that oneself Radio Link between source node can use(Modulation and
Coding Scheme) and corresponding message transmission rateWherein message transmission rateUnit be bps, when
After destination node D receives CRTS, calculates SINR and obtain the maximum that oneself Radio Link between source node can use
Modulation and coding mode MCSdAnd corresponding data direct transfer rate Rd, it is transferred to step 3 later；
Step 3：In a length of short interFrameGap SIFS (Short Inter-frame Space) after receiving CRTS frames and when being spaced
Afterwards, destination node D replys cooperation and allows to send CCTS (Cooperation-Clear-To-Send) frame, wherein CCTS frame formats
The channel control field for adding 3 bytes, wherein 2 bytes are used to indicate common data channels field, i.e. source node S and purpose
Two publicly available data channels between node D, remaining 1 byte is used to indicate between transmitting-receiving node the link that direct transfers can be with
The maximum data transfer rate R usedd, as potential cooperative node r in networkiAfter receiving CCTS, according to CCTS frames
SINR knows cooperative node, the maximum modulation and coding mode that the Radio Link between destination node D can use
And corresponding data rateriAccording to obtainedWithIt calculates separately using serial cooperation and concurrent cooperation feelings
Mean data rate under conditionIt is represented by：WithWhereinIt is to work as to use
" serial coordination strategy SC (Serial-Coop) " can be obtained average data transfer rate, andIt is when using " parallel association
Make strategy PC (Parallel-Coop) " it can be obtained average data transfer rate, RsrBeing can between source node and cooperative node
The maximum rate of acquisition；RrdIt is obtainable maximum rate between cooperative node and destination node, potential cooperative node riKnot
The data channel information in received CRTS and CCTS is closed, the available data channels for including in CRTS and CCTS frames, root are read
Public available data channels are selected according to the available channel list ACL of oneself, negotiate source node S, destination node D and cooperation section
Point riBetween publicly available data channel, i.e. cooperative node takes intersection in conjunction with the available channel list ACL of oneself, you can obtains
Source node S, destination node D and the public available data channels of cooperative node three, if source node S receives within the SIFS times
CCTS is grouped, then is transferred to step 4, is otherwise competed again in return to step 1；
Step 4：Potential cooperative node riCalculate the equivalent rate that can be obtainedWherein,To use
Mean data rateIn the case of, the packet number that can be transmitted within a TXOP times,TtxopIndicate transmission opportunity TXOP (Transmission Opportunity) times
Length,It indicates to pass through cooperative node riTransmit Data and be grouped required time, SIFS indicate short interFrameGap when
It is long,It indicates to pass through cooperative node riIt transmits ACK and is grouped the required time,Indicate the number that can be initiated in the unit interval
According to the average time of transmission, L [P] indicates average packet size,Indicate that the control for being once successfully selected out best cooperative node is held
Hand duration includes the interaction of CRTS, CCTS and HTS frame, andIndicate duration needed for data transmission and equal to TXOP when
It is long, i.e.,Potential cooperative node is according to respectiveAnd current publicly available data channel number L carrys out dynamic
Ground selects cooperation transmission strategy：
If meeting conditionThen selected is serial cooperation SC (Serial-Coop) strategy, if full
Sufficient conditionWhat is then selected is concurrent cooperation PC (Parallel-Coop) strategies, whereinRefer to
Equivalent rate when being using serial coordination strategy,Equivalent rate when referring to not using cooperation transmission,It refers to
Equivalent rate when using concurrent cooperation strategy, L are current available data channels numbers；
The participation cooperation transmission if potential cooperative node has an opportunity, you can to select SC or PC coordination strategies, then alternative cooperation
Node rjIt is transferred to step 5 to start to compete, wherein 1≤j≤M, otherwise cooperative node holding are intercepted, and competition is not involved in；
Step 5：Meet the condition in step 4OrCooperative node be
Alternative cooperative node, alternative cooperative node rjAccording to the selected cooperation transmission strategy of step 4, different alternative cooperations are calculated
Node rjBackoff valueAnd then according to backoff value in period WNumerical value is carried out to keep out of the way, if backoff counter is kept to 0,
Alternative cooperative node rjIt sends cooperation and is ready for sending HTS (Helper-ready-To-Send) frame, the addition of HTS frame formats is sent
The channel control field of address field and 3 bytes, wherein 2 bytes are used to indicate common data channels field, i.e., source node S and
Two publicly available data channels between destination node D, remaining 1 byte are used to indicate this data transmission procedure and are adopted
Once other cooperative nodes of cooperation transmission strategy detect that channel becomes busy in the W periods, then stops keeping out of the way immediately, be transferred to later
Step 6；
Step 6：If source node S receives HTS frames, cooperative node of the cooperative node as this of the HTS frames will be sent, and carry
Data channel number entrained in HTS frames and institute coordination strategy to be used are taken out, is transferred to after SIFS time intervals
Step 7；If source node does not receive HTS frames within the W periods, a public data letter is chosen according to the CCTS frames received
Road, and select to carry out this data transmission using the mode of direct transferring, it is transferred to step 7 later；
Step 7：Source node sends cooperation and reserves CRES (Cooperation-Reservation) frame, CRES on a control channel
Frame format adds the channel control field of 4 bytes, wherein 1 byte is used to indicate association used by this data transmission procedure
Make transmission strategy, 2 bytes are used to indicate selected data channel number, and remaining 1 byte is used to indicate selected
Cooperative node is numbered, meanwhile, source node is on the data channel negotiated, using the selected cooperation transmission strategy of step 4,
It sends Data in TXOP to be grouped and ACK (Acknowledgement) is waited for confirm, when cooperative node receives the cooperation of the CRES frames
Nodes domains are obtained by parsing the cooperative node carried in CRES if the value in cooperative node domain is identical as the serial number of cooperative node
The data channel and coordination strategy information of CRES frames are taken, the cooperation that packet is then participated on corresponding data channel passes
Defeated, otherwise the cooperative node keeps intercepting on a control channel, when destination node D is after receiving the CRES from source node, warp
It crosses and also broadcasts CRES frames after the SIFS times again on a control channel, after receiving-transmitting sides complete the data transmission in TXOP, return
Return step 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610004552.9A CN105680989B (en) | 2016-01-06 | 2016-01-06 | A kind of distributed multi-channel multi-address access method based on concurrent cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610004552.9A CN105680989B (en) | 2016-01-06 | 2016-01-06 | A kind of distributed multi-channel multi-address access method based on concurrent cooperation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105680989A CN105680989A (en) | 2016-06-15 |
| CN105680989B true CN105680989B (en) | 2018-11-13 |
Family
ID=56298978
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610004552.9A Expired - Fee Related CN105680989B (en) | 2016-01-06 | 2016-01-06 | A kind of distributed multi-channel multi-address access method based on concurrent cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105680989B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106455106B (en) * | 2016-12-05 | 2019-08-13 | 西北工业大学 | A kind of accidental access method that the dominant right based on channel conditions perception is changeable |
| CN107147455B (en) * | 2017-06-02 | 2020-09-29 | 电子科技大学 | Distributed access control method suitable for cognitive radio network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123020A (en) * | 2011-04-01 | 2011-07-13 | 北京航空航天大学 | Distributed cooperative multiple access method and system providing guarantee for quality of service |
| CN102291784A (en) * | 2011-09-28 | 2011-12-21 | 重庆邮电大学 | Cognitive-flow-based cooperative MAC (medium assess control) method |
| CN103298139A (en) * | 2013-06-18 | 2013-09-11 | 北京航空航天大学 | Dynamic distributed cooperation on demand accessing method and system |
| CN104837211A (en) * | 2015-04-01 | 2015-08-12 | 西北工业大学 | Multi-channel multiple access method based on MIMO transmission mechanism |
| CN104902577A (en) * | 2015-05-12 | 2015-09-09 | 西北工业大学 | Multi-channel multiple access method based on reliable multi-step channel reservation mechanism |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7411919B2 (en) * | 2003-03-17 | 2008-08-12 | University Of Rochester | Multi-hop time reservation using adaptive control for energy efficiency |
-
2016
- 2016-01-06 CN CN201610004552.9A patent/CN105680989B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123020A (en) * | 2011-04-01 | 2011-07-13 | 北京航空航天大学 | Distributed cooperative multiple access method and system providing guarantee for quality of service |
| CN102291784A (en) * | 2011-09-28 | 2011-12-21 | 重庆邮电大学 | Cognitive-flow-based cooperative MAC (medium assess control) method |
| CN103298139A (en) * | 2013-06-18 | 2013-09-11 | 北京航空航天大学 | Dynamic distributed cooperation on demand accessing method and system |
| CN104837211A (en) * | 2015-04-01 | 2015-08-12 | 西北工业大学 | Multi-channel multiple access method based on MIMO transmission mechanism |
| CN104902577A (en) * | 2015-05-12 | 2015-09-09 | 西北工业大学 | Multi-channel multiple access method based on reliable multi-step channel reservation mechanism |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105680989A (en) | 2016-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105142233B (en) | 802.11 AP of the method used in 802.11 AP of IEEE and IEEE | |
| CN106550457B (en) | A kind of resource allocation methods and device | |
| CN104685800B (en) | The method and apparatus that operation of relays is performed in Wireless LAN system | |
| WO2015169025A1 (en) | Parallel data transmission processing method and device, and computer storage medium | |
| JP7461082B2 (en) | Wireless communication method using multilink and wireless communication terminal using the same | |
| WO2021043298A1 (en) | Multi-link transmission method and apparatus, multi-link receiving method and apparatus, and storage medium and terminal | |
| CN102685920B (en) | Double-channel reservation access control method in mobile Ad Hoc network | |
| CN104168662B (en) | Channel access method and access device | |
| JP2024505101A (en) | Wireless communication method using multilink and wireless communication terminal using the same | |
| CN104902577B (en) | A kind of multi-channel multi-address access method based on reliable step channel reservation multi mechanism | |
| CN101754242A (en) | Access method of opportunistic cognitive multi-carrier link layer protocol | |
| Palacios et al. | Analysis of an energy-efficient MAC protocol based on polling for IEEE 802.11 WLANs | |
| KR20230172590A (en) | Stream Classification Service (SCS) with Restricted Target Latency (R-TWT) setup | |
| JP2023536284A (en) | Wireless communication method using multilink and wireless communication terminal using the same | |
| CN105680989B (en) | A kind of distributed multi-channel multi-address access method based on concurrent cooperation | |
| CN104837211B (en) | A kind of multi-channel multi-address access method based on MIMO transmission mechanism | |
| CN109257824A (en) | Resource regulating method based on TD-LTE self-organizing network | |
| CN103607777B (en) | Burst pulse ultra-wide band network accidental channel based on service priority cut-in method | |
| EP4280775A1 (en) | Wireless communication method using limited twt and wireless communication terminal using same | |
| JP2024510319A (en) | Multi-link device operating with multiple links and operating method of multi-link device | |
| Hasan et al. | COASYM-MAC: A cooperative asymmetric MAC protocol for wireless sensor network | |
| Adauto et al. | A hybrid many-to-many communication multi-channel mac protocol for ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181113 Termination date: 20200106 |