CN101232451B - Solution method of virtual grouping conflict based on multi-step signal channel booking - Google Patents
Solution method of virtual grouping conflict based on multi-step signal channel booking Download PDFInfo
- Publication number
- CN101232451B CN101232451B CN2008100173683A CN200810017368A CN101232451B CN 101232451 B CN101232451 B CN 101232451B CN 2008100173683 A CN2008100173683 A CN 2008100173683A CN 200810017368 A CN200810017368 A CN 200810017368A CN 101232451 B CN101232451 B CN 101232451B
- Authority
- CN
- China
- Prior art keywords
- time slot
- channel
- reservation
- terminal
- preengage
- 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 discloses a virtual grouping conflict solving method based on multi-step channel subscription, with the following steps that when a communication terminal is under the sending grouping state, a plurality of idle time slots are arranged at the front part and back part of the subscripted time slots; namely when a sending terminal performs the time slot subscription, the sending terminal ensures that the subscripted time slots of a channel are free, and both the p larger than zero time slots on the front face and the p larger than zero time slots on the back face of the idle time slots are free; when the communication terminal is under the monitoring channel state, the virtual conflict is detected and the blench is performed through the method of subscripting the protective time slots. Considering the aspect of realizing the complexity and the operand, the method has obvious advantages and better practicability.
Description
Technical field
The present invention relates to communication technical field, the block conflict resolving method in particularly a kind of WLAN (wireless local area network).
Background technology
Current I EEE 802.11 standards have become the generally acknowledged international standard of WLAN (wireless local area network) access technology.Mainly defined two kinds of multiple access access protocols in the IEEE802.11 standard: first distributed coordination function (DCF), another one are point coordination function (PCF).DCF is inserted standard by the multiple access of industry-wide adoption.A kind of multiple access that DCF is based on carrier sense and collision avoidance mechanism is access strategy at random.
Along with the develop rapidly of technology, the wireless local area network technology based on IEEE 802.11 has obtained using widely in recent years.On the one hand, along with increasing user uses this technology, it is more and more nervous that the frequency spectrum resource of IEEE 802.11 WLAN (wireless local area network) institute working frequency range becomes.On the other hand, IEEE 802.11 standards recommend can not effectively control under the situation of the block conflict resolving method that uses and poor communication channel quality many at the network user's number generation of packet collisions.Frequent packet collisions will cause the channel utilization of system to descend significantly.
In order to improve the performance of IEEE 802.11 multiple access access protocols, possess one efficient and reliably block conflict resolving method be vital.Yet in present existing most of contention resolutions, communication terminal independently produces backoff counter initial value separately mutually, so packet collisions just inevitable (especially under the bigger situation of system business amount).U.S. Baldwin doctor R. and Korea S Choi doctor J. in the access strategy that proposes respectively, send terminal when sending the current data grouping, the initial value of the backoff counter that will use ensuing packet is broadcasted away in advance.So corresponding time slot is just preengage, and uses same time slot to carry out the data transmission thereby avoided other to send terminal.But all just step reservations of the channel booking algorithm that they propose (, only finish the time slot that ensuing data grouping is about to use and preengage) promptly by sending the current data grouping.As everyone knows, transmission error is inevitable on wireless channel.In some cases, such transmission error rate is also than higher.When the wireless channel transmission characteristic is comparatively abominable, can not guarantee that once step reservation algorithm the channel booking information of broadcasting is away sent terminal by as much as possible other and obtains.So also just can't further avoid the generation of packet collisions.Emulation experiment shows that the performance of step reservation algorithm is to Channel Transmission mistake very responsive (significantly descending along with the increase of Channel Transmission error rate).
For solving packet collisions problem in IEEE 802.11 WLAN (wireless local area network), we have proposed a kind of block conflict resolving method based on step channel reservation multi in application for a patent for invention 200710017816.5.Adopt this method can effectively improve the utilance of network spectrum resource.
Yet realize the block conflict resolving method that patent application 200710017816.5 proposes, also need a simply and efficiently virtual group contention resolution.So-called virtual group conflict just is meant two or more transmission terminals owing to the channel booking information of failing to receive each other each other, thereby has made same channel booking, has promptly preengage identical channel time slot.Solve such virtual group conflict if do not take measures, these send terminal will send data simultaneously on this channel time slot, thereby will produce real packet collisions.Therefore, just must take measures to solve the virtual group conflict, thereby avoid the generation of real packet collisions in case certain sends the generation that terminal detected the virtual group conflict (be other send terminals preengage the channel time slot identical with him).In application for a patent for invention 200710017816.5, the virtual group contention resolution has been continued to use Korea S Choi doctor J. and has been waited the method that proposes.Wait in the virtual group contention resolution that proposes Korea S Choi doctor J., suppose that the virtual group conflict occurs in (being that A and B have made same channel time slot reservation) between terminal A and the B, and terminal A has detected the generation of this virtual group conflict, A will abandon this channel time slot of its reservation so, and seek by the idle time slot of other transmission terminal reservations of periphery.After finding, A is labeled as new reservation channel time slot with it.Simultaneously, for peripheral other-end, as terminal C, if it also detects the generation (be it detect a channel time slot successively preengage repeatedly by a plurality of terminals) of this virtual group conflict, in order on channel booking, to keep synchronous with terminal A, C also carries out the virtual group conflict resolution algorithm same with A, thereby also finds another one idle channel time slot (the channel time slot position that this channel time slot and A find should be identical), and it is labeled as is preengage.The problem that this method exists is when the virtual group conflict takes place, as long as the numerous transmission terminal of periphery detects the generation of this virtual group conflict, must move same virtual group conflict resolution algorithm.Obviously, this has all brought heavy computational burden to each transmission terminal in the network.The another one problem that this method exists is, when big and virtual group conflict takes place when the system business amount, sends terminal and searches out the idle channel time slot in addition and will become more and more difficult.This is to have preengage because a lot of channel time slot is all sent terminal by periphery.So, when the virtual group conflict takes place, the transmission terminal will spend more operand and remove to reorientate the idle channel time slot, thereby bring extra computing expense.In some cases, even can not find suitable idle channel time slot, thereby cause the decline of channel utilization, and the increasing of packet collisions probability.
Summary of the invention
In order to overcome the deficiency of the big and poor-performing of prior art operand, the present invention proposes a kind of virtual group contention resolution that is applicable to the step channel reservation multi method.This method has advantages such as realize simple and performance is better.
The technical solution adopted for the present invention to solve the technical problems is: the WLAN (wireless local area network) (if the channel communication quality is good, all communication terminals in the primary service area " BBS (Basic Service Set) " all can " be heard " the transmission activity of other-end on channel mutually) of considering a single-hop.Send packet A if send terminal A to terminal B
n(footmark " n " is represented the sequence number of this packet).For fear of packet collisions takes place, sending A
nThe time, A will be at medium other the follow-up grouping A to be sent of its transmit queue
N+1, A
N+2..., A
N+mThe backoff counter initial value x that will use
A_n+1, x
A_n+2..., x
A_n+mBe inserted into the current grouping A that promptly will send
nThe header information territory in (concrete reservation time slot position can calculate) by these backoff counter initial values.Like this, sending A
nThe time m grouping that it is follow-up pairing m backoff counter initial value broadcast away in advance, thereby played the purpose of channel booking.In the service area other send terminal and are receiving A
nAfter, from wherein extracting backoff counter initial value x
A_n+1, x
A_n+2..., x
A_n+m, and calculate the absolute position of corresponding reservation time slot, thus avoid on these time slots, sending grouping.By such booking-mechanism, can guarantee that the channel booking information broadcasted is sent terminals with very high success rate by other of periphery and obtains, and then avoid the generation of packet collisions.
Yet, utilize above-mentioned step channel reservation multi mechanism can not avoid the generation of virtual group conflict.In order effectively to solve contingent virtual group conflict, may be in the transmission Packet State or be in the monitor channel state at communication terminal, proposed to solve the measure of virtual group conflict in the present invention accordingly: when communication terminal is in the transmission Packet State, before and after the time slot that will preengage, add some idle time slots; Promptly when the transmission terminal is carried out time slot reservation, this transmission terminal should guarantee that the channel time slot that will preengage is idle (promptly being sent terminals by other does not preengage), and individual time slot of front p (＞0) and the individual time slot of back p (＞0) that should the free time time slot be idle time slot.Like this, just, before and after the channel time slot of being preengage, introduced 2p protection time slot.When communication terminal is in the monitor channel state, detects virtual collision and protect time slot method to avoid by reservation.
The idle time slot method of above-mentioned adding specifically comprises the steps:
Step 1: produce the backoff counter initial value.For in the medium packet to be sent of formation that sends terminal, produce corresponding backoff counter initial value respectively.When producing these initial values, should guarantee that its a pairing channel time slot and a front and back 2p channel time slot thereof all are idle.
Specifically, consider that sends a terminal A, when the value of its No. 1 backoff counter was decremented to 0, according to the regulation of IEEE802.11DCF, at this moment A was with first packet in the transmit queue.A need finish the transmission of ensuing m grouping (not comprising the current grouping that will send at once) is preengage before packet is sent.Such reservation is by calculating the initial value of maximum m backoff counter, and the transmission that is accompanied by current group is broadcasted away and finished.
In order narrating conveniently, to establish current will the transmission and be grouped into A
nSuppose sending its front grouping A
N-iWhen (i 〉=1), finished follow-up grouping A
N+j(reservation of 1≤j≤mr) (that is to say this m
rThe existing backoff counter initial value of individual grouping is corresponding respectively with it).Establish again and send current group A
nAfter, also remaining m in the transmit queue of A
wIndividual packet awaits sends (obvious m
w〉=m
r), so A also need calculate min (m, m
w)-m
rIndividual backoff counter initial value.That is to say that when sending current group, A need broadcast out m altogether
A=min (m, m
w) individual backoff counter initial value.
The method that produces each backoff counter initial value is identical, and therefore the production method of a backoff counter initial value only is described here.If will produce with the pairing backoff counter initial value of i backoff counter be x
A_iKnown previous backoff counter, i.e. i-1 backoff counter, the position of the time slot of being preengage in the channel booking window is T
A_i-1During initial calculation, make q=1.At first, 1 and min[q (CW
Min-1), (CW
Max-1) evenly produces a random number x]
1As backoff counter initial value (CW
MinExpression minimum competition window size, CW
MaxThe maximum of expression backoff counter), i.e. x
1=uniform (1, min[q (CW
Min-1), (CW
Max-1)]).If the pairing time slot of this value with and front and back amount to 2p time slot, i.e. time slot (T
A_i-1+ x
1+ s) mod (1024 * m) (any one time slot among p≤s≤p) is preengage by other-end, just shows the x of generation
1Pairing time slot does not meet our requirement, so just produce second random number x once more
2=uniform (1, min[q (CW
Min-1), (CW
Max-1)]).If the continuous random number x that produces for L time
1, x
2..., x
LPairing time slot does not all meet our requirement, then current q value is added 1.Utilization and top same method are until producing satisfactory value as the backoff counter initial value x that finally produces then
A_iLike this, the position of time slot in the channel booking window of A preengage of i backoff counter is T
A_i=(T
A_i-1+ x
A_i) mod (1024 * m).
Step 2: mark has been preengage time slot.Be filled up in the corresponding backoff counter producing good backoff counter initial value, and the time slot that will preengage recently in the channel booking window of its maintenance is labeled as " being preengage ".
Specifically, produce m
ABehind the individual backoff counter initial value, A they are filled up in the corresponding backoff counter (promptly from No. 1 backoff counter to m
AAnd the time slot that will preengage recently in the channel booking window of its maintenance is labeled as " being preengage " number backoff counter).Because m is arranged
rIndividual time slot by reservation (promptly having carried out mark), therefore only needed remaining m before sending current group here
A-m
rIndividual reservation time slot carries out mark.After current group was sent out away, A will be with the value of No. 1 backoff counter as the new initial value of keeping out of the way, and finished its ensuing keeping out of the way and transmit operation according to the regulation of IEEE 802.11DCF.
Step 3: send packet.Be filled up in the header territory of the packet that is about to send producing good backoff counter initial value, and this packet is sent.
Above-mentioned detection virtual collision and the method for avoiding by reservation protection time slot specifically may further comprise the steps:
Step 1: virtual collision detects.
After a certain communication terminal detects other transmission terminals to have made the channel booking the same with it (promptly all having preengage on the same channel time slot), then expression has detected the generation of virtual group conflict.
Step 2: virtual collision is avoided.
When detecting the virtual collision generation, this transmission terminal just detects in its 2p of having been reserved in advance protection time slot whether the idle channel time slot of not preengage is arranged before and after this has preengage time slot.Such testing process is according to being carried out one by one by reservation time slot order from the near to the remote apart from this, up to detect one from this by the reservation time slot till the nearest idle time slot, and should the free time time slot as new reservation time slot.
Corresponding with the concrete grammar of the idle time slot of above-mentioned adding, establish current terminal A and receive the grouping that other transmission terminals (as terminal B) are sent, and therefrom obtained m
BIndividual counter initial value
If the current time slots position indicator pointer that A safeguarded is T
A, the time slot that terminal B preengage pairing time slot position in the channel booking window of A is respectively
Below with the concrete virtual group contention resolution of false code explanation.Wherein, statement 1 is to statement 4, corresponding virtual collision testing process; Statement 5 is to statement 8, and corresponding virtual collision is avoided process.
When statement 1 is initial, make j=1;
If statement 3 T
B_j≠ T
A_i(1≤i≤m
A), then jump to statement 9;
If statement 4 T
B_j=T
A_i(1≤i≤m
A), show the virtual group conflict has taken place, then enter the virtual group conflict and solve flow process statement 5;
If statement 5
Pairing time slot is idle time slot, and A will
Pairing time slot is labeled as its new reservation time slot, carries out x
A_t=x
A_t-p
x, and jump to statement 9;
If statement 6
Pairing time slot is idle time slot, and A will
Pairing time slot is labeled as its new reservation time slot, carries out x
A_t=x
A_t+ p
x, and jump to statement 9;
If statement 7 p
x＜p then carries out p
x=p
x+ 1, and jump to statement 5;
If statement 10 j＜m
B, then carry out j=j+1, and jump to statement 2 execution.
Notice that the selection of protection number of time slots 2p (＞0) should be moderate.Too small protection timeslot number will reduce the effect of virtual collision avoidance method.And excessive protection timeslot number will reduce the utilance of channel.Suggestion is got p=2 and is advisable.
The invention has the beneficial effects as follows: have only when certain sends terminal and detects the virtual group conflict and occur on the channel time slot that it preengages, this transmission terminal just takes measures to avoid the generation of further packet collisions.Send terminal for other, even if they have also detected the generation (promptly detect a plurality of transmission terminals and preengage identical channel time slot) of virtual group conflict, if this conflict time slot does not belong to the time slot that they preengage,, these must not take further virtual group conflict solution just sending terminal.So just reduced respectively to send the operand of terminal significantly.If do not reserve the protection time slot, when the system business amount is big, seeks the idle channel time slot in addition and will expend bigger operand, even also can not find suitable idle channel time slot sometimes as new reservation time slot.So just, influenced the performance of system.In the present invention, when sending idle channel time slot of terminal reservation, there is the idle time slot of some the front and back that need guarantee this reservation time slot simultaneously, promptly protect time slot.When sending terminal and detect the virtual group conflict and occur on the channel time slot that it preengages, what this transmission terminal can be very fast finds another idle channel time slot as its new reservation time slot from the protection time slot of its reservation.Consider that from the complexity and the operand aspect that realize the method that the present invention proposes all has remarkable advantages, has better practicality.
The present invention is further described below in conjunction with drawings and Examples.
Description of drawings
Fig. 1 is that the embodiment of the invention sends channel booking window and the backoff counter schematic diagram that terminal A is safeguarded constantly at k;
Fig. 2 is that the embodiment of the invention sends channel booking window and the backoff counter schematic diagram that terminal A is safeguarded constantly at k+1;
Fig. 3 is that the embodiment of the invention sends channel booking window and the backoff counter schematic diagram that terminal A is safeguarded constantly at k+2;
Fig. 4 is the embodiment of the invention its channel booking window and backoff counter view after k+3 sends terminal A to execute the virtual group conflict resolution algorithm constantly.
Embodiment
Method embodiment:
When communication terminal is in the transmission Packet State:
Suppose to adopt under the situation of two step channel bookings, send at the moment k terminal A channel booking window, current time slots position indicator pointer and two backoff counter state as shown in Figure 1.
Step 1: produce the backoff counter initial value.
Be located at k constantly, send grouping without any sending terminal on the channel.According to the regulation of IEEE 802.11DCF, after the 20 μ s (promptly an idle time slots after), system enters new time slot, also promptly enters k+1 constantly accordingly.Under the k+1, the state of channel booking window, current time slots position indicator pointer and two backoff counter of transmission terminal A as shown in Figure 2 constantly.The current time slots position indicator pointer has pointed to next time slot position (i.e. No. 3 time slot positions), and No. 1 backoff counter value subtracts 1 simultaneously.Further hypothesis sends grouping without any sending terminal on moment k+1 channel.Therefore, after the idle time slots, system will enter next time slot, promptly enter k+2 constantly.
Under the k+2, the state of channel booking window, current time slots position indicator pointer and two backoff counter of transmission terminal A as shown in Figure 3 constantly.The current time slots position indicator pointer has pointed to next time slot position (i.e. No. 4 time slot positions, this time slot position just in time is the time slot that terminal A is preengage), and No. 1 backoff counter value reduces to 0 simultaneously.Therefore, terminal A enters and sends the current data Packet State.Send before the current group, A preengages No. 10 time slots, and therefore the A position that only need calculate 1 reservation time slot again gets final product here.During initial calculation, make q=1.At first, 1 and min[q (CW
Min-1), (CW
Max-1) evenly produces a random number x]
1(make CW as the backoff counter initial value
Min=31, CW
Max=1024), i.e. x
1=uniform (1, min[q (CW
Min-1), (CW
Max-1)]).If x
1=20, its pairing time slot position is (10+20) mod (1024 * 2)=30, establishes this time slot and is preengage by other-end, so just produce x once more
2=uniform (1, min[q (CW
Min-1), (CW
Max-1)]).If x
2=3, its pairing time slot position is (10+3) mod (1024 * 2)=13.If the position is also preengage by other transmission terminals by 13 time slot and its front and back respectively have p=2 idle time slot (can be used as the protection time slot), so x
2The=3rd, the new backoff counter initial value that produces.
Step 2: mark has been preengage time slot.
The value of No. 2 backoff counter copies in No. 1 backoff counter, and the backoff counter initial value x that produces recently
2=3 write (and corresponding No. 13 time slots are labeled as by subscription state) in No. 2 counters.Current group is sent out away back (no matter this process of transmitting whether success), and A will be with the value of No. 1 backoff counter as the new initial value of keeping out of the way, and finishes its ensuing keeping out of the way and transmit operation according to the regulation of IEEE 802.11DCF.
Step 3: send packet.
The backoff counter initial value (being respectively 6 and 3) that generation is good is filled up to and is about to send in the header territory of packet, and this packet is sent.
When communication terminal is in the monitor channel state:
Be located at k+3 constantly, terminal A listens to the grouping that terminal B is sent, and has therefrom obtained 2 counter initial values and (be respectively x
B_1=3 and x
B_2=5).The time slot position that the current time slots position indicator pointer that A safeguarded points at present is T
A=5, the time slot that terminal B preengage pairing time slot position in the channel booking window of A is respectively T
B_1=(5+3) mod (1024 * 2)=8 and T
B_2=(5+3+5) mod (1024 * 2)=13.
Step 1: virtual collision detects.
At first, the A terminal detects T
B_1=8 whether identical with the time slot position of its reservation (promptly whether and T
A_1=10 or T
A_2=13).Obviously, T
B_1Be not equal to T
A_1And T
A_2So, with T
B_1=8 pairing No. 8 time slots are labeled as by subscription state.
Once more, the A terminal detects T
B_2=13 whether identical with the time slot position of its reservation (promptly whether and T
A_1=10 or T
A_2=13).Because, T
B_2=T
A_2, show the virtual group conflict taken place between A and B.
Step 2: virtual collision is avoided.
In order to solve this virtual group conflict, A detects time slot T
B_2 ,-1=(T
A_2-1) (whether 1024 * m)=12 be idle time slot to mod.Because No. 12 time slot be the free time, so A is labeled as it by subscription state, and revises its No. 2 backoff counter x
A_2=x
A_2-1=2.Afterwards, A is with T
B_2Pairing No. 13 time slot is labeled as by subscription state.Behind the above EO, the channel booking window of A and the state of backoff counter are seen shown in Figure 4.
Simulation result:
Below, provide the technique effect that this method can reach by simulation result.In emulation, system's major parameter is provided with reference to the regulation of IEEE 802.11b.In IEEE 802.11b, MAC header+FCS (Frame Check Sequence)=224 bit.Also need the data field of additional 10 * m+3 bit to be used for the subscription information (formal definition of Frame referring to the detailed description of application for a patent for invention 200710017816.5 appropriate sections) of broadcast transmission terminal in the method to channel time slot; PHY head expense=192 μ s; ACK=112bits+PHY head expense; Channel transmission rate R=11Mbps; Channel Transmission postpones=1 μ s; Idle slot length σ=20 μ s; SIFS length=10 μ s; DIFS length=50 μ s.The valid data load of all packets in the emulation is 2000 bytes, and the minimum competition window is of a size of 31, and the transmitted in packets error rate of all wireless channels all is set to P
Err=30%.Maximum channel reservation step number m value is 2.
Table one and table two have contrasted the performance comparison of the virtual group contention resolution of Choi doctor J. proposition and the method (adopting p=2) that patent of the present invention provides.Table one has provided in difference and has sent two kinds of percent of pass performance comparison that method can reach under the number of terminals.Table two has provided in difference and has sent the two kinds of pairing groupings transmission of method probabilities of failure under the number of terminals.As seen the virtual group contention resolution that this patent proposed can reach higher percent of pass and lower packet collisions probability (particularly under the more situation of network user's number).Consider that from the complexity and the operand aspect that realize the method that this patent proposes all has remarkable advantages.As seen this virtual group contention resolution has better practicality.
| Send number of terminals | The method of Choi J. | The method of this |
| 10 | 0.531401 | 0.522439 |
| 20 | 0.534601 | 0.531066 |
| 30 | 0.531894 | 0.531636 |
| 40 | 0.524856 | 0.534792 |
| 50 | 0.516308 | 0.532241 |
| 60 | 0.507133 | 0.532241 |
| 70 | 0.501124 | 0.533281 |
| 80 | 0.492789 | 0.533650 |
| 90 | 0.486299 | 0.535955 |
The percent of pass contrast of table 1 system
| Send number of terminals | The method of Choi J. | The method of this |
| 10 | 0.303065 | 0.302871 |
| 20 | 0.312973 | 0.302708 |
| 30 | 0.327990 | 0.306725 |
| 40 | 0.351629 | 0.304933 |
| 50 | 0.375617 | 0.310854 |
| 60 | 0.396254 | 0.313262 |
| 70 | 0.414970 | 0.312970 |
| 80 | 0.432011 | 0.313642 |
| 90 | 0.446874 | 0.311381 |
Table 2 grouping sends the probability of failure contrast
Claims (3)
1. the virtual group contention resolution based on step channel reservation multi is characterized in that comprising the steps: adding some idle time slots before and after the time slot that will preengage when communication terminal is in the transmission Packet State; Promptly when sending terminal and carry out time slot reservation, this transmission terminal should guarantee that the channel time slot that will preengage is idle, and front p＞0 time slot and back p＞0 time slot that should the free time time slot be idle time slot; When communication terminal is in the monitor channel state, detects virtual collision and protect time slot method to avoid by reservation; Described detection virtual collision also comprises the steps: by reservation protection time slot method
(a) after a certain communication terminal detected other and sends terminals and made the channel booking the same with it, then expression had detected the generation that virtual group is conflicted;
(b) when detecting the virtual collision generation, this transmission terminal just detects in its 2p of having been reserved in advance protection time slot whether the idle channel time slot of not preengage is arranged before and after this has preengage time slot; Such testing process is according to being carried out one by one by reservation time slot order from the near to the remote apart from this, up to detect one from this by the reservation time slot till the nearest idle time slot, and should the free time time slot as new reservation time slot.
2. a kind of virtual group contention resolution based on step channel reservation multi according to claim 1 is characterized in that the some idle time slots of described adding comprise the steps:
(a) be in the medium packet to be sent of formation that sends terminal, produce corresponding backoff counter initial value respectively; When producing these initial values, should guarantee that its a pairing channel time slot and a front and back 2p channel time slot thereof all are idle;
(b) will produce good backoff counter initial value and be filled up in the corresponding backoff counter, and the time slot that will preengage recently in the channel booking window of its maintenance is labeled as " being preengage ";
(c) will produce good backoff counter initial value and be filled up in the header territory of the packet that is about to send, and this packet will be sent.
3. a kind of virtual group contention resolution based on step channel reservation multi according to claim 1, it is characterized in that: described protection number of time slots is got p-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100173683A CN101232451B (en) | 2008-01-22 | 2008-01-22 | Solution method of virtual grouping conflict based on multi-step signal channel booking |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100173683A CN101232451B (en) | 2008-01-22 | 2008-01-22 | Solution method of virtual grouping conflict based on multi-step signal channel booking |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101232451A CN101232451A (en) | 2008-07-30 |
| CN101232451B true CN101232451B (en) | 2010-06-09 |
Family
ID=39898634
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100173683A Expired - Fee Related CN101232451B (en) | 2008-01-22 | 2008-01-22 | Solution method of virtual grouping conflict based on multi-step signal channel booking |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101232451B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883439B (en) * | 2010-06-24 | 2013-05-08 | 西北工业大学 | Method for reliably transmitting real-time service in wireless Ad Hoc network |
| CN106488563B (en) * | 2015-08-31 | 2020-08-14 | 大唐电信科技产业控股有限公司 | Resource selection method and device |
| CN107148051A (en) * | 2017-04-28 | 2017-09-08 | 扬州大学 | Based on the DCF channel access methods for keeping out of the way reservation |
| CN107466072B (en) * | 2017-07-21 | 2020-11-10 | 哈尔滨工程大学 | Multi-channel parallel negotiation MAC protocol implementation method based on geographical position information |
| CN108337187B (en) * | 2018-01-22 | 2022-03-25 | 京信网络系统股份有限公司 | Data transmission method, data transmission device, computer equipment and storage medium |
| CN109873741B (en) * | 2019-02-25 | 2019-12-31 | 南京金信通信息服务有限公司 | System and working method of single-wire shared bus protocol |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1585404A (en) * | 2004-06-04 | 2005-02-23 | 西安电子科技大学 | Distributive competition control of withdraw of radio local network |
| US20050169221A1 (en) * | 2004-02-03 | 2005-08-04 | Sharp Laboratories Of America, Inc. | Decentralized bandwidth reservation mechanism for wireless networks |
| US20050243794A1 (en) * | 2004-04-28 | 2005-11-03 | Samsung Electronics Co., Ltd. | Method for avoiding and resolving reservation conflict of time slots in wireless network |
| JP2005318633A (en) * | 2004-04-28 | 2005-11-10 | Samsung Electronics Co Ltd | Time slot reservation method and collision avoidance method |
| CN101034932A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Fast precontract and line transmission multi-address access method |
| CN101035074A (en) * | 2007-02-16 | 2007-09-12 | 北京航空航天大学 | Non-confliction on-demand multi-address access method |
| CN101051998A (en) * | 2007-05-10 | 2007-10-10 | 西北工业大学 | Block conflict resolving method of radio local net |
-
2008
- 2008-01-22 CN CN2008100173683A patent/CN101232451B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050169221A1 (en) * | 2004-02-03 | 2005-08-04 | Sharp Laboratories Of America, Inc. | Decentralized bandwidth reservation mechanism for wireless networks |
| US20050243794A1 (en) * | 2004-04-28 | 2005-11-03 | Samsung Electronics Co., Ltd. | Method for avoiding and resolving reservation conflict of time slots in wireless network |
| JP2005318633A (en) * | 2004-04-28 | 2005-11-10 | Samsung Electronics Co Ltd | Time slot reservation method and collision avoidance method |
| CN1585404A (en) * | 2004-06-04 | 2005-02-23 | 西安电子科技大学 | Distributive competition control of withdraw of radio local network |
| CN101034932A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Fast precontract and line transmission multi-address access method |
| CN101035074A (en) * | 2007-02-16 | 2007-09-12 | 北京航空航天大学 | Non-confliction on-demand multi-address access method |
| CN101051998A (en) * | 2007-05-10 | 2007-10-10 | 西北工业大学 | Block conflict resolving method of radio local net |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101232451A (en) | 2008-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11013031B2 (en) | Uplink PPDU transmission | |
| CN101232451B (en) | Solution method of virtual grouping conflict based on multi-step signal channel booking | |
| US8989158B2 (en) | Channel access method for very high throughput (VHT) wireless local access network system and station supporting the channel access method | |
| Li et al. | Performance analysis of the IEEE 802.11 e block ACK scheme in a noisy channel | |
| US20180367286A1 (en) | System for Coexistence of Wi-Fi HaLow Network and Low-Rate Wireless Personal Area Network (LR-WPAN) | |
| US20130308580A1 (en) | Multi-channel communication station for communicating a multi-channel ppdu and methods of reducing collisions on secondary channels in multi-channel wireless networks | |
| US9706575B2 (en) | Multiple access method and system with frequency multiplexing of several request to send messages per source node | |
| KR101529204B1 (en) | Media Access Control apparatus and method in wireless local area network system | |
| CN101815302A (en) | Frequency spectrum access method using idle channel in cognitive radio network | |
| CN102067652A (en) | Apparatus for collision mitigation of multicast transmissions in wireless networks | |
| EP1355450B1 (en) | Channel overlap mitigation in wireless LANs using a central medium access control | |
| CN103037531A (en) | Wireless station access channel method and wireless station access channel system | |
| US20150117343A1 (en) | Radio Frame Receiving Method and Device | |
| CN100588178C (en) | Block conflict resolving method of radio local net | |
| CN103619072A (en) | FD-MAC protocol based on RTS/CTS principle in wireless network | |
| US7397814B2 (en) | Method and apparatus to estimate collision rate parameter | |
| Ma et al. | A novel contention-based MAC protocol with channel reservation for wireless LANs | |
| US8050195B2 (en) | Traffic performance evaluation system in wireless network and method thereof | |
| Zhai et al. | Modified 802.11‐Based Opportunistic Spectrum Access in Cognitive Radio Networks | |
| CN101345611B (en) | Correcting method for grouping delay in multi-step channel reservation multi-access protocol | |
| Park et al. | Queueing analysis of IEEE 802.11 MAC protocol in wireless LAN | |
| US20120087351A1 (en) | Method and device for transmitting information in contention on time slots between transceiver nodes of an ad hoc network | |
| CN108366392A (en) | Accidental access method based on resource pattern | |
| Weng et al. | Performance study of IEEE 802.11 DCF with optimal contention window | |
| CN107659964A (en) | The method to set up and device of a kind of network allocation vector |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100609 Termination date: 20130122 |