CN102170665B - Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service - Google Patents
Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service Download PDFInfo
- Publication number
- CN102170665B CN102170665B CN 201110082809 CN201110082809A CN102170665B CN 102170665 B CN102170665 B CN 102170665B CN 201110082809 CN201110082809 CN 201110082809 CN 201110082809 A CN201110082809 A CN 201110082809A CN 102170665 B CN102170665 B CN 102170665B
- Authority
- CN
- China
- Prior art keywords
- node
- triumph
- grouping
- originating party
- cooperative
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a cooperative channel access method and a cooperative communication system capable of guaranteeing quality of service, wherein the method is characterized in that a plurality of transmitter nodes compete for the access to a channel according to the priorities of respective to-be-transmitted service packets and a winning transmitter node with the highest priority obtains access to the channel; the winning transmitter node sends a CRTS packet to the channel; a receiver node receives the CRTS packet on the channel and replies with a CCTS packet; a plurality of cooperative nodes compete for the access to the channel according to the CRTS packet and the CCTS packet and a winning cooperative node with the highest priority obtains the access to the channel; and the winning transmitter node transmits the service packet to the receiver node through the transmission of the winning cooperative node. The method and system can better guarantee the quality of service under high speed information transmission, thereby meeting the requirement of service real time for users.
Description
Technical field
The present invention relates to a kind of cooperation channel access method and cooperation communication system that guarantees service quality, belong to wireless communication technology field.
Background technology
In radio communication, factors such as channel fading and channel quality variation all can cause communication quality to reduce, and communication range dwindles.In this case, in order to guarantee the communication between the node, adopt the mode that increases the node transmitting power usually, but the increase of transmitting power not only can bring unnecessary interference, more can consume lot of energy.Another kind of settling mode is the mode that adopts the node relaying, namely carries out the one or many relaying by one or more nodes between node, thereby realizes multi-hop communication.At present, multiple-input and multiple-output (Multiple-Input Multiple-Output, be called for short: MIMO) system can provide bigger diversity gain, improve communication quality, expansion communication range greatly under the certain situation of transmitting power, is therefore paid close attention to widely.But, owing to reasons such as size and costs, small mobile terminals only is furnished with single antenna usually, can not obtain the advantage that the MIMO technology is brought.The collaboration communication technology can make the mobile node with single antenna share the antenna of other mobile nodes according to certain way, thereby obtains to be similar to the space diversity gain in the mimo system, has improved the transmission capacity of network greatly.In the technology of collaboration communication, good, the resourceful user of quality can assist the user of bad channel quality, shortage of resources to improve communication conditions under the prerequisite of less sacrifice, improves performance, realizes sharing of Internet resources.
Because the collaboration communication technology is brought many benefits, a lot of channels accesses or medium access control have been arranged at present, and (Medium Access Control, be called for short: MAC) method has been taked the pattern of collaboration communication.Cooperative MAC (Cooperative MAC, be called for short: the request that CoopMAC) is based on IEEE 802.11 sends (Request-to-Send, be called for short: RTS)/clear to send (Clear-to-Send, be called for short: CTS) the collaboration type MAC of mode, a cooperation table of each node maintenance (CoopTable), the information of record candidate cooperative node, in each transfer of data, source node selects optimum node as via node from the historical information of cooperation table record, take originating party to send the RTS grouping, relaying is replied help (Helper-to-Send, be called for short: HTS) grouping, the debit replys CTS grouping three-way handshake mechanism, and then originating party divides into groups to this via node transport service with high speed, this via node is transmitted traffic packets with high speed to the debit again.
But the defective of this technology is: each transfer of data is upgraded cooperation table according to result of communication after finishing.Though what CoopMAC utilized is the last communications records, but because node motion causes factors such as topologies change, channel status dynamic change to cause cooperation table information out-of-date, can't reflect the actual transfer rate between current channel quality status lower node.The optimum via node of selecting from cooperation table no longer is fit to current transfer of data probably, and out-of-date information is unfavorable for improving throughput and the transmission quality of network.
By comparison, as another kind of collaboration communication technology, at automatic rate (the Cooperative Relay-Based Auto Rate based on cooperating relay, be called for short: CRBAR) in the MAC technology, be not to specify via node as CoopMAC in advance by originating party, but after neighbors is received RTS, CTS, whether satisfy the condition of cooperation according to self and compete relaying, so via node is to determine according to current channel conditions, help significantly to improve communication conditions, obtain throughput preferably.
But the defective of this technology is: when each time slot began, the cooperative node that satisfies condition participated in the competition with different probability, and high-quality cooperative node and low-quality cooperative node can bump, and this collision has brought unnecessary time delay.Simultaneously, high-quality cooperative node priority access channel can improve the throughput of transmissions of channel, preferentially inserts if can not guarantee high-quality cooperative node, and allows low-quality cooperative node obtain the repeater meeting, can reduce the throughput of transmissions of channel by contrast, increase time delay.
Development along with the multi-form demand of user, wireless network is not only wanted energy supporting business transmitted in packets, also want multimedia services such as energy support voice, video, and guarantee QoS of customer (Quality of Service, the abbreviation: QoS) requirement of different business.And these two kinds of technology of above-mentioned CoopMAC and CRBAR are not all classified to business and priority are set and distinguished, and do not provide necessary QoS to ensure.
By contrast, aspect guaranteed qos, provide a kind of enhancing distributed channel to insert (Enhanced Distributed Channel Access in the IEEE 802.11e standard, be called for short: EDCA) mechanism, this mechanism is advanced different access category (Access Category to the requirement of real-time with delineation of activities according to business, be called for short: AC), every kind of AC contains different priority, and a group of access parameter: contention window (contention windows) CW
MinAnd CW
Max, (Arbitration Inter-Frame Space is called for short: AIFS), (Transmission Opportunity is called for short: the TXOP) maximum transmission time (TXOP Limit) that allows of back etc. to obtain transmission opportunity the arbitration frame interbody spacer.During the competition access, different AC uses different AIFS, priority is the AC of i, AIFS[i]=AIFSN[i] * aSlotTime+SIFS, wherein SIFS represents short interFrameGap (Short Inter-Frame Space), AIFS[i] the expression node begins to start needs the timeslot number waited for before the backoff procedure, and node is at competition window [0, CW[i]] select a time slot to retreat wait, CW[i at random] at [CW
Min, CW
Max] between select.Priority is more high, AIFSN[i] more little, more early start backoff procedure, CW[i] more little, select at random to keep out of the way time slot value smaller, increased the probability of the AC acquisition TXOP of high priority like this, the node that obtains TXOP can use channel, thereby guarantees the service quality of high-priority service.
But the defective of this mechanism is: in the process of transmission data, do not adopt collaboration communication, because factors such as channel fading can cause originating party to directly the speed of transmission data is low between the debit, increase the transmission time, reduce the throughput of network.
Another kind of differentiation based on IEEE 802.11e cooperates, and (Differentiated Cooperative MAC, be called for short: DC-MAC) technology is carried out the division of priority to different business, guarantees different qos requirements.A kind of new transmit queue model has been proposed among the DC-MAC, node is do one's best (Best-Effort) professional and two formations of (Real-Time) business setting in real time of oneself, note is done own class (Own Class) 1 and own class (Own Class) 2 formations respectively, correspondingly with it also be provided with buddy class (Partner Class) 1 and buddy class (Partner Class) 2 formations, for depositing do one's best (Best-Effort) professional and real-time (Real-Time) traffic packets that cooperation is transmitted, four queue priorities are Own Class1 from low to high successively, Partner Class1, Own Class2, Partner Class2.Under the situation of traffic packets bust this, via node listens to the data signal to noise ratio and surpasses certain threshold value, and receive the information that takes defeat (NAK) that the debit sends, via node is assigned to traffic packets among the Partner Class corresponding with business, wait for that according to priority different AIFS begins to start afterwards backoff procedure, the beginning cooperation transmission.
But the defective of this technology is: the DC-MAC technology is after the failure that direct transfers, just allowing suitable via node participate in cooperation retransmits, but not the re-transmission that cooperates immediately, but compete TXOP again by via node, the business of bust this waits for that possibly one even several professional transmission could retransmit after finishing, and this is unfavorable for guaranteeing the qos requirement of real-time service.
Summary of the invention
The invention provides a kind of cooperation channel access method and cooperation communication system that guarantees service quality, in order to guaranteed qos requirement better.
One aspect of the present invention provides a kind of cooperation channel access method that guarantees service quality, comprising:
A plurality of originating party nodes bases are the priority competition access channel of traffic packets to be sent separately, makes the triumph originating party node with limit priority insert described channel;
Described triumph originating party node sends the CRTS grouping to described channel;
Debit's node is received described CRTS grouping back answer CCTS grouping at described channel;
A plurality of cooperative nodes insert described channel according to described CRTS grouping and described CCTS grouping competition, make the triumph cooperative node with limit priority insert described channel;
Described triumph originating party node sends to described debit's node through the forwarding of described triumph cooperative node with described traffic packets.
The present invention provides a kind of cooperation communication system on the other hand, comprises a plurality of originating party nodes, a plurality of cooperative node, and debit's node, wherein:
Described a plurality of originating party node is used for the basis priority competition access channel of traffic packets to be sent separately, makes the triumph originating party node with limit priority insert described channel;
Described triumph originating party node is used for sending the CRTS grouping to described channel;
Described debit's node is used for receiving the CRTS grouping back answer CCTS grouping that comes from described triumph originating party node at described channel;
Described a plurality of cooperative node is used for inserting described channel according to described CRTS grouping and described CCTS grouping competition, makes the triumph cooperative node with limit priority insert described channel;
Described triumph originating party node is used for through the forwarding of described triumph cooperative node described traffic packets being sent to described debit's node
The present invention is by being distinguished the priority of different business grouping, allow the high-priority service corresponding originating party node priority access channel transport service grouping of dividing into groups, thereby can guaranteed qos requirement better under the transmission of the information of two-forty, to satisfy the user to the demand of professional real-time.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do one to the accompanying drawing of required use in embodiment or the description of the Prior Art below introduces simply, apparently, accompanying drawing in describing below is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the flow chart of the cooperation channel access method embodiment one that guarantees service quality of the present invention;
Fig. 2 is the particular flow sheet of step 110 shown in Figure 1;
Fig. 3 is the particular flow sheet of step 140 shown in Figure 1;
Fig. 4 A is the sequential chart for example of step 142 shown in Figure 3;
Fig. 4 B is the sequential chart for example of step 144 shown in Figure 3;
Fig. 4 C is the sequential chart for example of step 145 shown in Figure 3;
Fig. 5 is the particular flow sheet of step 150 shown in Figure 1;
Fig. 6 is the flow chart of the cooperation channel access method embodiment two that guarantees service quality of the present invention;
Fig. 7 A and Fig. 7 B be embodiment illustrated in fig. 6 in two of situation one sequential charts for example;
Fig. 8 A and Fig. 8 B be embodiment illustrated in fig. 6 in two of situation two sequential charts for example;
Fig. 9 A and Fig. 9 B be embodiment illustrated in fig. 6 in two of situation three sequential charts for example;
Figure 10 is the structural representation of cooperation communication system embodiment of the present invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention clearer, below in conjunction with the accompanying drawing in the embodiment of the invention, technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
Fig. 1 is the flow chart of the cooperation channel access method embodiment one that guarantees service quality of the present invention, and as shown in the figure, this method comprises the steps:
Particularly, this triumph originating party node can first random back n
ASIndividual access detects (Access Sensing, abbreviation: AS) mini-slot; Then, when at described n
ASWhen not listening to the CRTS grouping of other originating party nodes transmissions in the individual mini-slot, send the CRTS grouping of described triumph originating party node self again.Wherein, n
ASBe the integer value of determining according to the busy not busy percentage of described channel.For example, when described channel is not too busy, 2≤n
AS≤ 4; When described channel ratio is busier, 5≤n
AS≤ 16
Wherein, the signal to noise ratio of the CRTS grouping of debit's node by receiving can estimate the speed R between debit's node and the triumph originating party node
Sd, and with this speed R
SdBe included in its CCTS grouping of replying.Particularly, if the transmission between the receiving-transmitting sides node has with other nodes do not conflict, then debit's node is replied the CCTS grouping, otherwise, do not reply any grouping.
Wherein the relevant concrete competition access procedure of a plurality of cooperative nodes will be elaborated in subsequent content.
Particularly, shown in follow-up Fig. 4 B, behind the triumph cooperative node success access channel, triumph originating party node sends to the triumph cooperative node with traffic packets (DATA) earlier, and then gives described debit's node by the triumph cooperative node with described traffic packets forwarding.After the correct reception of debit's node, reply and confirm that (Acknowledgment is called for short: ACK) grouping; If debit's node does not correctly receive, then reply and deny (Negative Acknowledgement, be called for short: NACK) grouping, at this moment, the triumph cooperative node receives that the NACK grouping just resends DATA (seeing represented NACK, DATA, the ACK grouping of dotted line among the figure).
The described method of present embodiment is by being distinguished the priority of different business grouping, allow the high-priority service corresponding originating party node priority access channel transport service grouping of dividing into groups, thereby can guaranteed qos requirement better under the transmission of the information of two-forty, to satisfy the user to the demand of professional real-time.
Fig. 2 is the specific implementation flow chart of step 110 shown in Figure 1, and as shown in the figure, above-mentioned steps 110 specifically can comprise the steps:
Particularly, each originating party node is L priority according to the requirement difference of miscellaneous service (for example speech, video, business such as do one's best) to service quality such as real-time, time delays with delineation of activities, from high to low successively note do 1,2,3 ..., L.Get n
B=[log
2L], wherein, [log
2L] expression be that the logarithm of end L is upwards got more than or equal to this several smallest positive integral with 2), like this, L priority can be used n respectively
BBit, namely the virtual ID of this traffic packets is corresponding successively on earth by height
..., until
Or the n of corresponding lowest priority L
BThe position virtual ID, wherein, the professional virtual ID value of i priority of i+1 priority ratio is little
(Distributed Inter-Frame Space, be called for short: DIFS) after Biao Shi the channel idle, a priority area is arranged stage by stage, it comprises n to each originating party node listening to distributed inter-frame space
BIndividual mini-slot, with above-mentioned service priority 1,2,3 ..., the corresponding n of L
BBit is corresponding, and each originating party node that has traffic packets to send can be according to the corresponding n of service priority
BBit sends busy tone or intercepts at corresponding mini-slot.Particularly, the binary number when being 1 when virtual ID correspondence this moment then sends busy tone in this mini-slot; If the binary number of virtual ID correspondence is 0, then in this mini-slot, intercept channel.If listen to busy tone is arranged this moment, then explanation has the node of higher priority business to send, and keeps out of the way so withdraw from the competition of channel.
When originating party node success at n
BDistribute, intercept after all virtual ID in the individual mini-slot, illustrate that the priority of self is the highest, successful access channel obtains the right to use of this channel.
By said process, guaranteed current all triumph originating party nodes with limit priority just qualified access attempts and traffic packets of carrying out the back send.This method is a kind of cooperation channel access method of guaranteed qos, and this method is a plurality of priority with delineation of activities, and the corresponding professional virtual ID of each priority is utilized the size discrimination priority of professional virtual ID value, and priority is more high, and professional virtual ID value is more big.In the process of competition access channel, professional virtual ID value the maximum competition is won, so the professional preferential right to use that obtains channel of high priority.
Fig. 3 is the specific implementation flow chart of step 140 shown in Figure 1, and as shown in the figure, above-mentioned steps 140 specifically can comprise the steps:
Step 141, each described cooperative node is according to the described CRTS grouping and the signal-to-noise ratio (snr) estimation described triumph originating party node of CCTS grouping and the speed R between this cooperative node that receive
SrAnd the speed R between this cooperative node and the described debit's node
Rd
Step 142, according to
Value determine the priority of each described cooperative node self.
Wherein, above-mentioned speed R
Sd, R
Sr, R
RdAll possible transmission rate be R
1, R
2..., R
i..., R
j..., R
m(i＜j wherein, R
i＞R
j).Cooperative node is divided into n priority (being the sum that n is expressed as the cooperative node priority of dividing), and note is made G respectively from high to low
1, G
2, G
3..., G
nG
1Expression R
SrAnd R
RdBe flank speed R
1G
2Expression R
SrAnd R
RdIn one be high transmission rate R
1, another is time high transmission rate R
2G
3Expression R
SrAnd R
RdBe time high transmission rate R
2, by that analogy, G
nExpression R
SrAnd R
RdBe minimum speed limit R
mBe example with m=4, table 1 has been represented the relation of cooperative node transmission rate and priority.
Table 1
Particularly, has G
i(the n of the cooperative node of the priority of 1≤i≤n) after the CCTS grouping
CAIndividual cooperation application (Cooperation Application, be called for short: CA) i mini-slot in the mini-slot sends the CA grouping, and in other mini-slot, intercept channel, sent CA grouping (comprising the CA grouping that bumps) if before oneself sending the CA grouping, listened to other cooperative nodes, then cancellation sends the CA grouping of oneself, withdraws from the cooperative node competition.Wherein, n
CA=n.
Step 143 is when satisfying relational expression
The time, described cooperative node sends CA grouping, wherein R according to described self priority in corresponding mini-slot
SdRepresent the speed between described debit's node and the described triumph originating party node, be included in the described CCTS grouping.
If do not satisfy above-mentioned relation formula condition, then there is not cooperative node to send the CA grouping, show that not having this moment suitable cooperative node to carry out relaying transmits, this moment is the better effects if of transfer ratio cooperation directly, therefore, shown in Fig. 4 A, triumph originating party node directly to debit's node with R
SdSpeed sends traffic packets (DATA).Debit's node correctly receives after the traffic packets, replys and confirms that (Acknowledgment is called for short: ACK) grouping; If debit's node does not correctly receive, then reply and deny (Negative Acknowledgement, be called for short: NACK) grouping, at this moment, triumph originating party node receives that the NACK grouping just resends DATA (seeing represented NACK, DATA, the ACK grouping of dotted line among the figure).
Step 144, triumph originating party node judge whether the described CA grouping that receives bumps.If collisionless, then execution in step 145; If collision is arranged, then execution in step 146.
After step 145, triumph originating party node received collisionless described cooperation application grouping, grouping was confirmed in the broadcast transmission cooperation, made the triumph cooperative node that sends this cooperation application grouping insert described channel.
For example, shown in Fig. 4 B, when the CA of cooperative node transmission grouping did not bump, the originating party node of then winning can the broadcast transmission cooperation be confirmed (Cooperation Confirm, be called for short: CC) grouping, win the cooperative node access channel accordingly and announce other each cooperative nodes confirming.
After step 146, triumph originating party node received the described cooperation application grouping of collision, grouping was denied in the broadcast transmission cooperation, makes the cooperative node random back n that bumps
CRAfter individual competition solves mini-slot, resend the CA grouping, and rotate back into step 144.
For example, shown in Fig. 4 C, when the CA grouping bumped, the originating party node broadcasts of then winning sent cooperation and denies that (Negative Cooperation Confirm, be called for short: NCC) grouping makes the cooperative node random back n that bumps in grouping
CRIndividual competition solves (Contention Resolution, abbreviation: CR) behind the mini-slot, resend the CA grouping.Repeat this process up to the CA packet collisions no longer takes place, the originating party node of namely finally winning can broadcast transmission CC grouping.Particularly, because simultaneously at n
CAThe cooperative node that certain mini-slot together bumps in the individual mini-slot can be not too many, therefore optional 4≤n
CR≤ 6.
According to said process, a plurality of cooperative node competition access channels make the fastest cooperative node of relaying forwarding rate participate in grouping and transmit, and therefore are conducive to reduce forwarding time, improve efficiency of transmission.
In addition, on the basis of the described method of above-described embodiment, can also further introduce subsidiary booking-mechanism.Particularly, need do further improvement to above-mentioned steps 150, Fig. 5 is the specific implementation flow chart of step 150 shown in Figure 1, and as shown in the figure, above-mentioned steps 150 specifically can comprise the steps:
Step 151, triumph originating party node sends the traffic packets that carries first subscription information to described triumph cooperative node, and described first subscription information comprises the originating party reservation priority of first traffic packets that this triumph originating party node desire sends again.
The view of function of the described originating party node of present embodiment, cooperative node and debit's node is divided.Namely when certain node is carried out sending function, be called the originating party node; When certain node is carried out collaboration feature, be called cooperative node; When certain node is carried out receiving function, be called debit's node.But in fact, the node device of a reality can be carried out transmission constantly respectively, cooperate and receive this three kinds of functions in difference.
Particularly, in this step, after triumph originating party node is finished the sending function of traffic packets, still have the first other traffic packets to need to send, therefore, this triumph originating party node next constantly the time still as the originating party node.
As mentioned above, the node device of a reality can be carried out transmission constantly respectively, cooperate and receive this three kinds of functions in difference.Particularly, in this step, described triumph cooperative node when the second other traffic packets need send, shows that then this triumph cooperative node wants to become the originating party node constantly at next after finishing the collaboration feature that relaying transmits.
At this moment, the function of the cooperative node still carried out of described triumph cooperative node.
As mentioned above, the node device of a reality can be carried out transmission constantly respectively, cooperate and receive this three kinds of functions in difference.Particularly, in this step, described debit's node needs to send as the 3rd other traffic packets after the function of finishing the grouping reception, shows that then this debit makes node and also wants to become the originating party node constantly at next.
Step 153B when described cooperative node reservation priority is higher, transmits the described traffic packets that carries second subscription information that comprises described cooperative node reservation priority to described debit's node.
Step 154B, after described debit's node receives described traffic packets, the debit of the 3rd traffic packets that this debit's node desire is sent preengages priority and preengages priority with described cooperative node and compare, when described cooperative node reservation priority is higher, execution in step 155B, when described debit preengages priority when higher, execution in step 156B.
Step 155B, described debit's node reply the affirmation grouping that carries described second subscription information.
Step 156B when described debit preengages priority when higher, replys to carry to comprise that described debit preengages the affirmation grouping of the 3rd subscription information of priority.
Pass through said process, described triumph originating party node, triumph cooperative node and debit's node all will be when next become the originating party node constantly, then can to corresponding traffic packets or confirm to add in the grouping corresponding subscription information, to carry out the transmission of subsequent data packet according to subscription information, detailed process will describe in following method embodiment two.
Fig. 6 is the flow chart of the cooperation channel access method embodiment two that guarantees service quality of the present invention, and as shown in the figure, this method further comprises the steps: on the basis of said method embodiment one and process shown in Figure 5
Below, at the difference that above-mentioned originating party reservation priority, cooperative node reservation priority and debit preengage the priority height, divide different situations that this step is illustrated, below among each figure, " DATA/R " expression carries the traffic packets of corresponding subscription information; " ACK/R " expression carries the affirmation grouping of corresponding subscription information.
Situation one: originating party reservation priority is the highest
When carrying described first subscription information in the described affirmation grouping (being the ACK/R grouping), show that then originating party reservation priority is the highest, therefore, described triumph originating party node inserts described channel again as new triumph originating party node.
Shown in Fig. 7 A, when the destination node of described first traffic packets was described triumph cooperative node, described new triumph originating party node directly sent to described triumph cooperative node with described first traffic packets; After this triumph cooperative node successfully receives, reply the ACK grouping.
Shown in Fig. 7 B, when the destination node of described first traffic packets was described debit's node, described new triumph originating party node sent to described debit's node through the forwarding of described triumph cooperative node with described first traffic packets; After this debit's node successfully receives, reply the ACK grouping.
Situation two: cooperative node reservation priority is the highest
When carrying described second subscription information in the described ACK/R grouping, show that then cooperative node reservation priority is the highest, therefore, described triumph cooperative node inserts described channel again as new triumph originating party node.
Shown in Fig. 8 A, when the destination node of described second traffic packets was described triumph originating party node, described new triumph originating party node directly sent to described triumph originating party node with described second traffic packets; After this triumph originating party node successfully receives, reply the ACK grouping.
Shown in Fig. 8 B, when the destination node of described second traffic packets was described debit's node, described new triumph originating party node directly sent to described debit's node with described second traffic packets; After this debit's node successfully receives, reply the ACK grouping.
Situation three: it is the highest that the debit preengages priority
When carrying described the 3rd subscription information in the described ACK/R grouping, it is the highest to show that then the debit preengages priority, and therefore, described debit's node inserts described channel again as new triumph originating party node;
Shown in Fig. 9 A, when the destination node of described the 3rd traffic packets was described triumph cooperative node, described new triumph originating party node directly sent to described triumph cooperative node with described the 3rd traffic packets; After this triumph cooperative node successfully receives, reply the ACK grouping.
Shown in Fig. 9 B, when the destination node of described the 3rd traffic packets was described triumph originating party node, described new triumph originating party node sent to described triumph originating party node through the forwarding of described triumph cooperative node with described the 3rd traffic packets; After this triumph originating party node successfully receives, reply the ACK grouping.
The described method of present embodiment is by adopting the packet transmission of subsidiary booking-mechanism, traffic packets in order to send that All factors being equal, preference will be give to level or higher priority, prolonged the service time of the channel that competition obtains, reduced the time of carrying out channel competition again, therefore in guaranteed qos, further improved efficient and the channel utilization of transmitted in packets.The method can repeat the maximum transmission time that allows until reaching.
Figure 10 is the structural representation of cooperation communication system embodiment of the present invention, and as shown in the figure, this system comprises a plurality of originating party nodes 10, a plurality of cooperative node 20, and debit's node 30, and its operation principle is as follows:
A plurality of originating party nodes 10 bases are the priority competition access channel of traffic packets to be sent separately, make the triumph originating party node 11 with limit priority insert described channel, the concrete competition access procedure of relevant a plurality of originating party node 10 wherein, can repeat no more referring to Fig. 2 and related description thereof herein; Described triumph originating party node 11 sends the CRTS grouping to described channel, and concrete send mode can repeat no more referring to the related description of step 120 herein.
After debit's node 30 is received the CRTS grouping that comes from described triumph originating party node at described channel, reply the CCTS grouping; A plurality of cooperative nodes 20 insert described channel according to described CRTS grouping and described CCTS grouping competition, make the triumph cooperative node 21 with limit priority insert described channel.Wherein the concrete competition access procedure of relevant a plurality of cooperative node 20 can repeat no more referring to Fig. 3 and related description thereof herein.
After this, triumph originating party node 11 sends to described debit's node through the forwarding of described triumph cooperative node 21 with described traffic packets.Particularly, shown in follow-up Fig. 4 B, behind the triumph cooperative node success access channel, triumph originating party node sends to the triumph cooperative node with traffic packets (DATA) earlier, and then gives described debit's node by the triumph cooperative node with described traffic packets forwarding.After the correct reception of debit's node, reply and confirm grouping (ACK); If debit's node does not correctly receive, then reply and deny grouping (NACK), at this moment, the triumph cooperative node receives that the NACK grouping just resends DATA (seeing represented NACK, DATA, the ACK grouping of dotted line among the figure).
The described system of present embodiment is by being distinguished the priority of different business grouping, allow the high-priority service corresponding originating party node priority access channel transport service grouping of dividing into groups, thereby can guaranteed qos requirement better under the transmission of the information of two-forty, to satisfy the user to the demand of professional real-time.
In addition, described triumph originating party node 11, described triumph cooperative node 21 and described debit's node 30 can also be according to described first subscription information, described second subscription information and described the 3rd subscription informations, in described channel, continue the corresponding service grouping that the transmission desire sends, to realize the packet transmission of subsidiary booking-mechanism.Specify to repeat no more referring to the related description of said method embodiment two herein.
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 only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. a cooperation channel access method that guarantees service quality is characterized in that, comprising:
A plurality of originating party nodes bases are the priority competition access channel of traffic packets to be sent separately, makes the triumph originating party node with limit priority insert described channel;
Described triumph originating party node sends the CRTS grouping to described channel;
Debit's node is received described CRTS grouping back answer CCTS grouping at described channel;
A plurality of cooperative nodes insert described channel according to described CRTS grouping and described CCTS grouping competition, make the triumph cooperative node with limit priority insert described channel;
Described triumph originating party node sends to described debit's node through the forwarding of described triumph cooperative node with described traffic packets;
Wherein, described a plurality of cooperative node inserts described channel according to described CRTS grouping and described CCTS grouping competition and comprises:
Each described cooperative node is according to the described CRTS grouping and the signal-to-noise ratio (snr) estimation described triumph originating party node of CCTS grouping and the speed R between this cooperative node that receive
SrAnd the speed R between this cooperative node and the described debit's node
Rd
According to
Value determine the priority of each described cooperative node self;
When satisfying relational expression
The time, described cooperative node sends cooperation application grouping, wherein R according to described self priority in corresponding mini-slot
SdRepresent the speed between described debit's node and the described triumph originating party node, be included in the described CCTS grouping;
After triumph originating party node received collisionless described cooperation application grouping, grouping was confirmed in the broadcast transmission cooperation, made the triumph cooperative node that sends this cooperation application grouping insert described channel;
After triumph originating party node received the described cooperation application grouping of collision, grouping was denied in the broadcast transmission cooperation, makes the cooperative node random back n that bumps
CRAfter individual competition solves mini-slot, resend cooperation application grouping.
2. method according to claim 1 is characterized in that described a plurality of originating party node comprises according to the priority competition access channel of traffic packets to be sent separately:
Each described originating party node basis priority of service groups to be sent is separately determined the virtual identifying that corresponding service divides into groups, and wherein said virtual identifying is n
BBit,
, L is expressed as the sum of the priority of traffic packets division;
When the value of the bit in the described virtual identifying is 1, at n
BSend busy tone in the mini-slot corresponding with this binary digit in the individual mini-slot, when the value of the bit in the described virtual identifying is 0, at n
BIntercept in the mini-slot corresponding with this binary digit in the individual mini-slot;
When an originating party node was finished described busy tone transmission and do not listened to busy tone according to the value of the corresponding whole binary digits of described virtual identifying, this originating party node inserted described channel as the triumph originating party node of limit priority.
3. method according to claim 1 is characterized in that described triumph originating party node sends the CRTS grouping to described channel and comprises:
Random back n
ASIndividual access detects mini-slot;
When at described n
ASIndividual access detects and does not listen to the CRTS grouping that other originating party nodes send in the mini-slot, and then described triumph originating party node sends the CRTS grouping of self.
4. method according to claim 1 is characterized in that described triumph originating party node sends to described debit's node through the forwarding of described triumph cooperative node with described traffic packets and comprises:
Triumph originating party node sends the traffic packets that carries first subscription information to described triumph cooperative node, and described first subscription information comprises the originating party reservation priority of first traffic packets that this triumph originating party node desire sends again;
After described triumph cooperative node receives described traffic packets, the cooperative node reservation priority of second traffic packets that this triumph cooperative node desire is sent is preengage priority with described originating party and is compared, when described originating party reservation priority is higher, transmit the described traffic packets that carries first subscription information to described debit's node;
After described debit's node receives described traffic packets, the debit of the 3rd traffic packets that this debit's node desire is sent preengages priority and preengages priority with described originating party and compare, when described originating party reservation priority is higher, answer carries the affirmation grouping of described first subscription information, when described debit preengages priority when higher, reply to carry to comprise that described debit preengages the affirmation grouping of the 3rd subscription information of priority.
5. method according to claim 4 is characterized in that described cooperative node reservation priority compared with described originating party reservation priority and also comprises afterwards:
When described cooperative node reservation priority is higher, transmit the described traffic packets that carries second subscription information that comprises described cooperative node reservation priority to described debit's node;
After described debit's node receives described traffic packets, the debit of the 3rd traffic packets that this debit's node desire is sent preengages priority and preengages priority with described cooperative node and compare, when described cooperative node reservation priority is higher, answer carries the affirmation grouping of described second subscription information, when described debit preengages priority when higher, reply to carry to comprise that described debit preengages the affirmation grouping of the 3rd subscription information of priority.
6. according to claim 4 or 5 described methods, it is characterized in that described debit's node also comprises after replying described affirmation grouping: described triumph originating party node, described triumph cooperative node and described debit's node are according to described first subscription information, described second subscription information and described the 3rd subscription information, and the corresponding service that the transmission desire sends in described channel divides into groups.
7. method according to claim 6 is characterized in that the corresponding service grouping that the transmission desire sends in described channel comprises:
When carrying described first subscription information in the described affirmation grouping, described triumph originating party node inserts described channel again as new triumph originating party node;
When the destination node of described first traffic packets was described triumph cooperative node, described new triumph originating party node directly sent to described triumph cooperative node with described first traffic packets;
When the destination node of described first traffic packets was described debit's node, described new triumph originating party node sent to described debit's node through the forwarding of described triumph cooperative node with described first traffic packets.
8. method according to claim 6 is characterized in that the corresponding service grouping that the transmission desire sends in described channel comprises:
When carrying described second subscription information in the described affirmation grouping, described triumph cooperative node inserts described channel again as new triumph originating party node;
When the destination node of described second traffic packets was described triumph originating party node, described new triumph originating party node directly sent to described triumph originating party node with described second traffic packets;
When the destination node of described second traffic packets was described debit's node, described new triumph originating party node directly sent to described debit's node with described second traffic packets.
9. method according to claim 6 is characterized in that the corresponding service grouping that the transmission desire sends in described channel comprises:
When carrying described the 3rd subscription information in the described affirmation grouping, described debit's node inserts described channel again as new triumph originating party node;
When the destination node of described the 3rd traffic packets was described triumph cooperative node, described new triumph originating party node directly sent to described triumph cooperative node with described the 3rd traffic packets;
When the destination node of described the 3rd traffic packets was described triumph originating party node, described new triumph originating party node sent to described triumph originating party node through the forwarding of described triumph cooperative node with described the 3rd traffic packets.
10. a cooperation communication system is characterized in that comprising a plurality of originating party nodes, a plurality of cooperative node, and debit's node, wherein:
Described a plurality of originating party node is used for the basis priority competition access channel of traffic packets to be sent separately, makes the triumph originating party node with limit priority insert described channel;
Described triumph originating party node is used for sending the CRTS grouping to described channel;
Described debit's node is used for receiving the CRTS grouping back answer CCTS grouping that comes from described triumph originating party node at described channel;
Described a plurality of cooperative node is used for inserting described channel according to described CRTS grouping and described CCTS grouping competition, makes the triumph cooperative node with limit priority insert described channel; Wherein, described a plurality of cooperative node specifically is used for each described cooperative node according to the described CRTS grouping and the signal-to-noise ratio (snr) estimation described triumph originating party node of CCTS grouping and the speed R between this cooperative node that receive
SrAnd the speed R between this cooperative node and the described debit's node
Rd
According to
Value determine the priority of each described cooperative node self;
When satisfying relational expression
The time, described cooperative node sends cooperation application grouping, wherein R according to described self priority in corresponding mini-slot
SdRepresent the speed between described debit's node and the described triumph originating party node, be included in the described CCTS grouping;
After triumph originating party node received collisionless described cooperation application grouping, grouping was confirmed in the broadcast transmission cooperation, made the triumph cooperative node that sends this cooperation application grouping insert described channel;
After triumph originating party node received the described cooperation application grouping of collision, grouping was denied in the broadcast transmission cooperation, makes the cooperative node random back n that bumps
CRAfter individual competition solves mini-slot, resend cooperation application grouping;
Described triumph originating party node is used for through the forwarding of described triumph cooperative node described traffic packets being sent to described debit's node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110082809 CN102170665B (en) | 2011-04-01 | 2011-04-01 | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110082809 CN102170665B (en) | 2011-04-01 | 2011-04-01 | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102170665A CN102170665A (en) | 2011-08-31 |
| CN102170665B true CN102170665B (en) | 2013-08-07 |
Family
ID=44491606
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110082809 Expired - Fee Related CN102170665B (en) | 2011-04-01 | 2011-04-01 | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102170665B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102905309B (en) * | 2012-11-06 | 2015-10-28 | 重庆邮电大学 | A kind of relay communication method based on cooperative MAC protocol in vehicle self-organizing network |
| CN103281750B (en) * | 2013-05-31 | 2015-12-02 | 北京航空航天大学 | Guarantee service quality and the collaboration multi-address access method of fairness and system |
| CN103326769B (en) * | 2013-06-18 | 2017-02-08 | 北京航空航天大学 | Multi-node cooperative transmission method and system |
| CN103298139B (en) * | 2013-06-18 | 2015-12-02 | 北京航空航天大学 | Dynamic distributed cut-in method and the system of cooperating as required |
| CN104244433B (en) * | 2014-09-03 | 2017-11-24 | 北京航空航天大学 | The multiple access method of the quality of service guarantee of time delay tolerance, device and system |
| US10433180B2 (en) * | 2016-12-22 | 2019-10-01 | Qualcomm Incorporated | Dynamic medium sharing |
| CN109525957A (en) * | 2019-01-02 | 2019-03-26 | 成都华日通讯技术有限公司 | A kind of relaying election method of achievable remote data wireless transmission |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101754399A (en) * | 2009-12-16 | 2010-06-23 | 北京航空航天大学 | Multi-channel collaboration multi-address access method and system |
| CN101764679A (en) * | 2009-12-16 | 2010-06-30 | 北京航空航天大学 | Distributed collaborative multiple access method and system thereof |
-
2011
- 2011-04-01 CN CN 201110082809 patent/CN102170665B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101754399A (en) * | 2009-12-16 | 2010-06-23 | 北京航空航天大学 | Multi-channel collaboration multi-address access method and system |
| CN101764679A (en) * | 2009-12-16 | 2010-06-30 | 北京航空航天大学 | Distributed collaborative multiple access method and system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102170665A (en) | 2011-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10623219B2 (en) | Multi-user communication in wireless networks | |
| CN102170665B (en) | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service | |
| CN101197826B (en) | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal | |
| CN102006630B (en) | Multichannel cooperative data transmission method and system | |
| CN100512092C (en) | Multi-channel selection multi-address access method | |
| US11337222B2 (en) | Coordinated stations in a single BSS with shared TXOP in the frequency domain | |
| CN102123020B (en) | Distributed cooperative multiple access method and system providing guarantee for quality of service | |
| CN102685920B (en) | Double-channel reservation access control method in mobile Ad Hoc network | |
| US11405944B2 (en) | Coordinated stations in OBSS with shared TXOP in the frequency domain | |
| CN103763076B (en) | Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks | |
| CN102625367B (en) | Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network | |
| CN103281750B (en) | Guarantee service quality and the collaboration multi-address access method of fairness and system | |
| CN112188565A (en) | Mobile ad hoc network multi-user cooperative transmission method based on network allocation vector | |
| CN105163395A (en) | Wireless local area network access control method based on radio-on-fiber wireless system | |
| US20220174732A1 (en) | Coordinated wifi stations with shared txop among dl and ul over time domain | |
| CN103298139B (en) | Dynamic distributed cut-in method and the system of cooperating as required | |
| CN101141176B (en) | Distributed acquisition multi-access method | |
| CN108183344A (en) | A kind of directional aerial and its method for sending and receiving data | |
| Roy et al. | An efficient cooperative MAC protocol for enhancing QoS of IEEE 802.11 e EDCA in saturated conditions | |
| CN102281652B (en) | Coordination-reservation-based method for selecting reservation information in wireless Ad Hoc network | |
| Shanmugam | A Study on Sender Initiated Contention Based MAC Protocols without Reservation Mechanisms in Wireless Ad-Hoc Networks | |
| Zhang et al. | A Novel MAC Protocol for Full-Duplex Wireless Networks | |
| CN100525254C (en) | Multi-address access method according to requirement | |
| Shigeyasu et al. | A broadcasting method for suppressing hidden terminals effect on IEEE802. 11DCF | |
| Shigeyasu et al. | A New Method for Improving MAC Level Broadcast Receive Ratio Using 2-Phase RTS/CTS Handshakes Sequence |
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: 20130807 Termination date: 20160401 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |