CN1529471A - Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN - Google Patents
Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN Download PDFInfo
- Publication number
- CN1529471A CN1529471A CNA2003101004800A CN200310100480A CN1529471A CN 1529471 A CN1529471 A CN 1529471A CN A2003101004800 A CNA2003101004800 A CN A2003101004800A CN 200310100480 A CN200310100480 A CN 200310100480A CN 1529471 A CN1529471 A CN 1529471A
- Authority
- CN
- China
- Prior art keywords
- value
- window
- website
- initial
- incidentally
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
Based on measured congestion state, different adaptive parameters are assigned to sites with different priority respectively. That is to say different parameters possess adjustment ranges with different initial competition window. Based on collision situation, in allowed adjustment range, site own can adjust size of initial competition window, i.e. self-adaptive control of access probability and transmission of each site. Thus, under heavy load, bandwidth of user with high priority is ensured; whole utilization rate of system is guaranteed or total throughput of system is raised. The invention solves disadvantages of lowering bandwidth of user with low priority and low performances of system when there are lots of sites in wireless local network (IEEE802.11) and under heavy load.
Description
Technical field
The present invention relates to a kind of in the IEEE802.11 WLAN (wireless local area network), the assurance and provide the implementation method of bandwidth preferably, belong to the improvement in performance and the enhancement techniques field of wireless network in the radio communication for high-priority users.
Background technology
In recent years, because radio communication can provide convenience for the user, insert means efficiently, wireless communication technology is subjected to people's attention in the industry day by day, and obtains develop rapidly.A kind of important means that WLAN (wireless local area network) inserts as wireless local, military project and civilian aspect all be with a wide range of applications.The improvement in performance of relevant protocol of wireless local area network becomes the focus that people pay close attention to naturally.For this reason, Institute of Electrical and Electronics IEEE formulated the standard IEEE 802.11 of WLAN (wireless local area network) in 1999, so that the network broadband, that support asynchronous or synchronous service to be provided.The basic access way of IEEE802.11 is the distributed reciprocity access way (DCF, Distributed Coordination Function) of asynchronous shared channel.This access way is to suppose all websites all with identical probability access channel, and its implementation is with an initial contention window value access channel, in case meet with collision, this window value exponential backoff realizes alleviating and collides.This mechanism has certain adaptive characteristic; But under more, the competitive heavy duty situation of website number, systematic function is low.
In addition, owing in the current wireless network, need to support multiple different service quality, the user who for example has under heavy duty, still can access the bandwidth assurance.Therefore, just become inevitable development trend with the different probability access channel with the service quality that guarantees high-priority users, for example the EDCF draft formulated recently of IEEE802.11 is exactly in order to guarantee the service quality of high-priority users.These mechanism usually always take to sacrifice methods of low priority user bandwidth, and this method can reach certain bandwidth under underload in order to be effective, but can sacrifice the utilance of whole system; Situation performance under heavy duty more becomes badly, and the bandwidth of high-priority users usually can not get effective assurance.According to applicant's retrieval, not finding in document in the past as yet has when mechanism supports that different probability inserts preferably, in the service quality that guarantees high-priority users, can also make throughput of system approach optimum method.
Summary of the invention
The purpose of this invention is to provide a kind of implementation method that in the IEEE802.11 WLAN (wireless local area network), guarantees the bandwidth of high-priority users, simultaneously, also will guarantee the utilance of system.This method can solve the defective that the prior wireless network technology exists preferably.
The object of the present invention is achieved like this: a kind of implementation method that guarantees the high-priority users bandwidth in the IEEE802.11 WLAN (wireless local area network), it is characterized in that: by the Measurement Network congestion state, website to different priorities is given different auto-adaptive parameters respectively, the adjustable range that promptly has different initial competition windows respectively, each website is adjusted the size of initial competition window in the initial competition window adjustable range that this website allows according to collision situation simultaneously, it is the access probability that self adaptation is regulated this website, control the transmission of each website, thereby under the heavy duty situation, make the bandwidth of high-priority users be guaranteed, simultaneously, improve the total throughout of system.
This method comprises following concrete operations step:
A, Measurement Network congestion state: with numeric representation current network collision and the congestion condition of the average collision duration of each website in each virtual transmission cycle, with load factor 1 numerical value and its optimal value l of actual measurement with the load factor 1 of the ratio of average free time length
OptCompare, and deposit comparative result in counter; The number m of the packet that successfully transmits with this website number of times is as a comparison promptly comprising total duration L of virtual transmission cycle that m success transmits again
pIn, the load factor 1 that the each success of actual measurement is transmitted all with its optimal value l
OptCompare one by one, and with the last numerical value of comparative result counter as measurement result;
B, adjust the initial contention window value Qi W of this website according to measurement result
Init: the numerical values recited according to the comparative result counter is judged network condition, and counter values is big, illustrates that load factor 1 is big, and network is in congested, then initial contention window value is doubled to enlarge, to reduce collision; Otherwise counter values is little, illustrates that load factor 1 is little, and network is in the free time, then initial contention window value is reduced by half and dwindles, to increase the access channel probability; If the initial contention window size after the change drops on outside the initial competition window scope of this website permission, then it is adjusted within this scope;
C, by packet mode incidentally, this website is published in the network through above-mentioned adjusted initial contention window value; Whether the window numerical value that incidentally arrives this website in the receiving station judgment data bag within the initial competition window adjustable range of such user, if not within this scope, is then adjusted to it within this scope; Each website with the assurance equal priority all is with identical initial contention window value access channel; Return steps A again and carry out cycling.
Described steps A further comprises following concrete operations step:
A1, initiation parameter: the initial value of load factor 1 is made as optimal value l
Opt=0.86, and with number of comparisons counter and the zero setting respectively of comparative result counter;
A2, detection network collision situation: before each successful swap data, calculate present load factor l numerical value; Concrete computational methods are mean collision time length and mean down time length ratios in each virtual transmission cycle of statistics; And after each computational load factor, the number of comparisons calculator is added 1;
Do you A3, judge that load factor l is near optimal value 0.86: judge that load factor l triggers thresholding σ greater than 0.86+? if after then the comparative result counter adds 1, enter the A4 operating procedure; Do you if not, judge that again load factor l triggers thresholding σ less than 0.86-? if after then the comparative result counter subtracts 1, enter the A4 operating procedure; If not, directly enter the A4 operating procedure;
A4, after the numerical value of number of comparisons counter reaches m, whether the numerical value of judging the comparative result counter is greater than its upper limit threshold value m/2, perhaps,, then need the initial contention window value of this website is regulated if satisfy above-mentioned condition less than its lower limit threshold value-m/2.
Described step B further comprises following concrete operations step:
B1, judge the comparative result counter numerical value whether greater than its upper limit threshold value m/2, if, after initial contention window value doubled, enter the B3 operating procedure, if not, order is carried out the subsequent operation step;
B2, judge the comparative result counter numerical value whether less than its lower limit threshold value-m/2, if, after initial contention window value reduced by half, enter the B3 operating procedure, if not, order is carried out the subsequent operation step;
Whether B3, the initial competition window after judge regulating be in the initial competition window scope that this website allows, if the lower limit threshold value after regulating is less than lower bound, then directly it is adjusted to the lower limit threshold value, if the upper limit threshold value after regulating then directly is adjusted to it upper limit threshold value greater than the upper bound; Respectively to relatively number of times counter and the zero setting of comparative result counter;
Described step C further comprises following concrete operations step: after each website carries out successfully transmitting for m time, and the incidentally window value W after above-mentioned adjusted initial contention window value regulated as this website
Piggyback, and incidentally go out by the packet that last successfully transmits; Described incidentally window value W
PiggybackIt is the byte that the initiating terminal of the packet that transmits of success is in the end set up, be used for this website and incidentally broadcast the adjusted initial contention window value of this website to other websites at packet, so as all normally detect other each website that this packet successfully sends can both be according to the incidentally window value W of this packet
PiggybackUpgrade the initial contention window value of oneself.
Receiving station among the described step C is receiving that the method for adjustment behind the initial competition window of the movable website of window incidentally is: if incidentally window is greater than the upper bound of the initial competition window adjustable range of this receiving station, then directly this numerical value is set to the upper bound of its initial competition window adjustable range; If incidentally window is less than the lower bound of the initial competition window adjustable range of this receiving station, then directly this numerical value is set to the lower bound of its initial competition window adjustable range; Otherwise, the direct window value that the initial competition window of this receiving station is arranged to incidentally come in the packet.
The incidentally window value W of a described byte
PiggybackFirst bit be sign position, this sign position be 1 expression its be the Frame of window incidentally, the sign position be 0 expression its be the Frame of window incidentally not; Next seven bits are window factors, the initial contention window value W after this window factor representation is regulated
Init+ 1, its numerical value is (window minimum value W
Min+ 1) multiple.
Described window minimum value W
MinBe 31.
The initial contention window value scope of the preferential website of described bandwidth is: [W
Min, α * (W
Min+ 1)-1], the initial contention window value scope of other websites is: [W
Min, W
Max]; Wherein α is the parameter of control bandwidth, and the size of adjusting α can obtain the throughput of different preferential access websites.
M value in the described number of comparisons counter is according to initial competition window W
InitNumerical value calculates, and its result of calculation is as follows: as initial contention window value W
InitBe respectively: 31,63,127,255,511,1023 o'clock, the number of comparisons m of corresponding low priority user was respectively: 25,12,6,3,2,1; The number of comparisons m of high-priority users then is 4 times of low priority user.
The present invention is a kind of implementation method that guarantees the bandwidth of high-priority users in the IEEE802.11 WLAN (wireless local area network), this method is to give different auto-adaptive parameters to the preferential website of difference, it is the adjustable range of different initial competition window, simultaneously, each website is adjusted the size of initial competition window in the scope that this website allows according to collision situation, be the access probability that self adaptation is regulated this website, can reach the doulbe-sides' victory purpose that guarantees high priority website bandwidth and improve the entire system throughput.
When in prior art and document, all not having to find to have preferably agreement or rules can support the wireless site access to LAN of different probability, can make the entire system throughput approach optimum method.Common agreement or rules can reach certain bandwidth under underload in order to be effective, but can the sacrificial system overall utilization rate; It is abominable that performance under heavy duty more becomes.Advantage of the present invention and effect have overcome these weak points of conventional method just to a great extent, also can guarantee that the entire system throughput also is improved for high-priority users provides good bandwidth under heavy duty.
Description of drawings
Fig. 1 is the sequential schematic diagram in virtual transmission cycle among the present invention.
Fig. 2 be among the present invention in packet each website sequential schematic diagram during incidentally initial competition window.
Fig. 3 is each website sequential schematic diagram in the initial competition window periodic refresh of the present invention process.
Fig. 4 is the overview flow chart of implementation method of the present invention.
Fig. 5 is the flow chart of Measurement Network congestion state operating procedure of the present invention.
Fig. 6 is that the present invention adjusts the initial competition window of this website and utilizes incidentally mode of packet according to measurement result, should adjusted initial contention window value be published in the network, adjust the flow chart of the operating procedure of its initial competition window for receiving station according to the incidentally window numerical value in the packet.
Embodiment
Describe the working mechanism and the concrete operations step of the inventive method in detail below in conjunction with accompanying drawing.
Implementation method of the present invention mainly is based on IEEE802.11 protocol of wireless local area network DCF access module, and in WLAN (wireless local area network) IEEE802.11 agreement, the competition access channel is finished by window exponential backoff mechanism between the website.When the website access channel, need watch idle time of channel earlier, if the minimum interval that two DCF frames send between the sequence surpasses distributed frame spacing (DIFS, Distributed-InterFrame-Space, DIFS is 50 μ s in the straight expansion mode of IEEE802.11 agreement), then begin to send the process of packet immediately; Otherwise, wait for that other website sends after, just begin to send packet after keeping out of the way d time slot.The value of d is a picked at random between [0, W].Wherein W represents the size of competition window.The W initial value is W
Init, in the IEEE802.11 agreement, use this parameter to be used to control website access channel probability.After this each experience collision just produces window to be kept out of the way, and the W value doubles.If two or more websites are chosen in same time slot and send packet, then packet can overlap, and causes these two or more packets all can not be received rectifying normal reception the, this situation to be called between the website and bumps.The collision that an important indicator of a good protocol of wireless local area network causes when being exactly the multi-site competition is less.Obviously, initial contention window value is more little, and the website access probability is just big more, easy bumping more just between the website; Otherwise initial contention window value is big more, and the website access probability is just more little, just is not easy to bump more between the website.
Referring to Fig. 2, people with all send request transmission control frame RTS (Request-To-Send) do not observe afterwards expression once shake hands success, to the situation of the feedback response signal CTS (Clear-To-Send) of this RTS frame with send the situation that does not observe feedback response signal ACK after the Frame DATA and all think collision.The present invention adopts the numerical value of load factor l to reflect the collision and the congestion situation of current network.Load factor l is the average collision duration t_coll_avg of each website in each virtual transmission cycle (Virtual transmissiontime) t_v (for a website, virtual transmission period definition is the time difference of twice successful transfer data packets) and the ratio (referring to Fig. 1) of average free time length t_idle_avg.Fig. 1 is illustrated in the virtual transmission cycle t_v of a website, and collision length is surveyed and is that it is t_free (representing it with symbol # among the figure) that t_coll, free time length survey, and the duration that other websites successfully transmit is t_succ, and it is t_pack that this website successfully transmits duration.Distributed frame space D IFS represents that two DCF frames send the minimum interval between the sequence among Fig. 2, SIFS (Short-InterFrame-Space) is illustrated in Frame and sends the interval between the Frame and control frame in the sequence, DIFS is 50 μ s in the straight expansion mode of IEEE802.11, and SIFS then is 10 μ s.
In each virtual transmission cycle t_v, the formula of cycle calculations load factor l is as follows:
Average collision duration t_oll_avg=λ * t_coll_avg+ (1-λ) * t_coll;
Average free time length t_free_avg=λ * t_free_avg+ (1-λ) * t_free;
Load factor l=t_coll_avg/t_free_avg.
λ is the parameter of level and smooth shake in the formula, its span: [0.9～0.96].
Through Theoretical Calculation, under single probability access channel and many probability access channel situation, the optimal value l of load factor l
OptAll can think between [0.85,0.95] zone; Getting its value in the present invention is 0.86.L and 0.86 is relatively big or small to judge collision situation.If load factor l numerical value is greater than 0.86+ threshold value σ (this parameter considers that the disturbances factor of wireless communications environment is provided with, and can be made as about 0.2 usually), then the comparative result counter adds 1; Otherwise if less than 0.86-threshold value σ, then the comparative result counter subtracts 1.If in sending the cycle duration Lp of window incidentally, promptly successfully send for m time in the time of packet, through measuring for m time after the comparison, the numerical value of comparative result counter is then judged network congestion greater than m/2; At this moment, if the numerical value of comparative result counter is then judged the network free time less than-m/2.The m here is the numerical value that is provided with in the number of comparisons counter when initialization among the present invention, and the m value also is that the present invention is according to initial competition window W
InitNumerical value calculates, because its computational process is quite loaded down with trivial details, repeats no more here, and the present invention has only provided several result of calculations and selected for use for the user.
Method of the present invention is exactly to judge according to the numerical value of the comparative result counter of each website after measuring through m time and comparing load factor whether network is in congestion state, again give different initial contention window value to the website of different priorities again, promptly carry out self adaptation respectively and regulate the transmission of controlling each website, make that the bandwidth of high-priority users is guaranteed under the heavy duty situation, simultaneously, improve the throughput of system.
Referring to Fig. 4, specify three main operational steps of implementation method of the present invention:
1, Measurement Network congestion state: the present invention reflects the collision and the congestion situation of current network with the numerical value of load factor l.Specific practice is with load factor 1 numerical value of actual measurement and its optimal value l
OptCompare, and deposit comparative result in counter; Again to send the incidentally cycle duration L of window
pIn, the number m of the packet that this website successfully transmits is number of times as a comparison, promptly at L
pIn in m virtual transmission cycle of the successful transmission that comprises, to load factor 1 and its optimal value l of actual measurement
OptThe last numerical value that carries out m later comparative result counter is as measurement result.
Fig. 5 is the further refinement description of flow diagram of the 1st operating procedure Measurement Network congestion condition:
11, initiation parameter: the initial value of load factor 1 is made as optimal value l
Opt=0.86, and with two counters (number of comparisons counter and comparative result counter) zero setting respectively;
12, detect the network collision situation: before each successful swap data, calculate present load factor l numerical value; Concrete computational methods are mean collision time length and mean down time length ratios in each virtual transmission cycle of statistics; And after each computational load factor, the number of comparisons calculator is added 1;
13, do you judge that load factor l is near optimal value 0.86: judge that load factor l triggers thresholding σ greater than 0.86+? if after then the comparative result counter adds 1, enter 14 operating procedures; Do you if not, judge that again load factor l triggers thresholding σ less than 0.86-? if after then the comparative result counter subtracts 1, enter the A4 operating procedure; If not, directly enter 14 operating procedures;
14, after the numerical value of number of comparisons counter reaches m, whether the numerical value of judging the comparative result counter is greater than its upper limit threshold value m/2, perhaps,, then need the initial contention window value of this website is regulated if satisfy above-mentioned condition less than its lower limit threshold value-m/2.
2, adjust the initial contention window value W of this website according to measurement result
Init: the numerical values recited according to the comparative result counter is judged network condition, and counter values is big, illustrates that load factor 1 is big, and network is in congested, then initial contention window value is doubled to enlarge, to reduce collision; Otherwise counter values is little, illustrates that load factor 1 is little, and network is in the free time, then initial contention window value is reduced by half and dwindles, to increase the access channel probability.First three step operation among Fig. 6 is the further refinement description of flow diagram of the 2nd operating procedure:
21, whether the numerical value of judging the comparative result counter greater than its upper limit threshold value m/2, if, after initial contention window value doubled, enter 23 operating procedures, if not, order is carried out the subsequent operation step;
22, whether the numerical value of judging the comparative result counter less than its lower limit threshold value-m/2, if, after initial contention window value reduced by half, enter 23 operating procedures, if not, order is carried out the subsequent operation step;
23, whether the initial competition window after judge regulating is in the initial competition window scope that this website allows, if the lower limit threshold value after regulating is less than lower bound, then directly it is adjusted to the lower limit threshold value, if the upper limit threshold value after regulating then directly is adjusted to it upper limit threshold value greater than the upper bound; Respectively to relatively number of times counter and the zero setting of comparative result counter.
3, pass through incidentally mode of packet, this website is published in the network through above-mentioned adjusted initial contention window value, whether the window numerical value that incidentally arrives this website in receiving station judgment data bag is within the initial competition window adjustable range of such user, if not within this scope, then it is adjusted within this scope; Each website with the assurance equal priority all is with identical initial contention window value access channel.Back two steps operation among Fig. 6 is the further refinement description of flow diagram of the 3rd operating procedure:
24, utilize incidentally mode of packet, this website is published in the network through adjusted initial contention window value.
After each website carries out successfully transmitting for m time, the incidentally window value W after above-mentioned adjusted initial contention window value regulated as this website
Piggyback, and incidentally go out by the packet that last successfully transmits; This is window value W incidentally
PiggybackIt is the byte (referring to Fig. 2) that the initiating terminal of the packet that transmits of success is in the end set up, be used for this website and incidentally broadcast the adjusted initial contention window value of this website to other websites at packet, so as all normally detect other each website that this packet successfully sends can both be according to the incidentally window value W of this packet
PiggybackUpgrade the initial contention window value of oneself.The incidentally window value W of this byte
PiggybackFirst bit be sign position, this sign position be 1 expression its be the Frame of window incidentally, the sign position be 0 expression its be the Frame of window incidentally not; Next seven bits are window factors, the initial contention window value W after this window factor representation is regulated
Init+ 1, its numerical value is (window minimum value W
Min+ 1) multiple.Window minimum value W
MinBe 31.W for example
Init=127, then window value incidentally the time W field be 10000100.Wherein the first sign position be 1 expression its be the Frame of window incidentally, its window factor (Binary Zero 000100) is 4 times of window minimum value, i.e. W
Init=4 * (W
Min+ 1)-1=4 * (31+1)-1=127.
25, whether the window numerical value that incidentally arrives this website in receiving station judgment data bag within the initial competition window adjustable range of such user site, if not within this scope, is then adjusted to it within this scope.Concrete method of adjustment is: if incidentally window is greater than the upper bound of the initial competition window adjustable range of receiving station, then directly this numerical value is set to the upper bound of the initial competition window adjustable range of this website; If incidentally window is less than the lower bound of the initial competition window adjustable range of receiving station, then directly this numerical value is set to the lower bound of the initial competition window adjustable range of this website; Otherwise, the direct window value that the initial competition window of this receiving station is arranged to incidentally come in the packet.
Referring to the signal of window of the present invention refresh cycle shown in Figure 3, the square frame of each computational load factor is corresponding to a virtual transmission cycle among Fig. 1 among the figure.After if process successfully transmits for m time, m altogether measured load factor l numerical value has MAX_counter greater than optimal value l after finding successfully to transmit at every turn
Opt+ threshold value σ or MAX_counter is arranged less than optimal value l
Opt-threshold value σ then carries out corresponding initial competition window adjustment, and incidentally to other websites; Otherwise window parameter is constant, and this moment equally need be with the initial competition window of this website incidentally to other websites.The l value has MAX_counter greater than optimal value l
Opt+ threshold value σ, or have MAX_counter less than optimal value l
Opt-threshold value σ illustrates that WLAN (wireless local area network) is in too congested or too idle situation.The present invention judges by above comparative approach whether WLAN (wireless local area network) is in too congested or too idle situation, thereby whether decision needs to adjust the initial contention window value of each website.
The initial contention window value scope that the present invention is provided with the preferential website of bandwidth is: [W
Min, α * (W
Min+ 1)-1], and promptly [31, α * (31+1)-1].The initial contention window value scope of other websites is: [W
Min, W
Max], i.e. [31,1023].Wherein α is the parameter of control bandwidth, and the size of adjusting α can obtain the throughput of different preferential access websites.In order to prevent that preferential access station from naming a person for a particular job wicket incidentally to the website of doing one's best, the present invention is set to generally to insert about 4 times of website to the window update cycle m (being the m value in the number of comparisons counter) of preferential access website.Each preferential guaranteed bandwidth value S of website that inserts
gCan estimate with corresponding equation group.The present invention also recommends to provide according to initial competition window W
InitThe window update cycle m of the general access website that numerical value calculates (be the m value in the number of comparisons counter because computational process is quite loaded down with trivial details, the Therefore, omited it.The m value of high-priority users is 4 times of low priority user):
| Initial contention window value (W init) | Low priority user number of comparisons (m) |
| ????31 | ????25 |
| ????63 | ????12 |
| ????127 | ????6 |
| ????255 | ????3 |
| ????511 | ????2 |
| ????1023 | ????1 |
Implementation method of the present invention has been carried out the analogue simulation test on computers, and test is successful, below alpha parameter and high-priority service user obtain in the simple declaration test data bandwidth S
gBetween relation.The size of adjusting α can obtain different preferential access website throughput S
g
For example: get W
Max=1023, W
Min=31, α=2.0 o'clock can obtain according to calculating: the bandwidth S of a resultant assurance of high-priority users
g=0.0867S (S is the total bandwidth capacity of system).
Suppose that current system available bandwidth is S=1.3Mb/s, when satisfying 11.67N
g+ N
oDuring≤134.59 conditions, preferentially inserting user bandwidth can guarantee at S
gAbout=110Kb/s.
Claims (10)
1, a kind of implementation method that in the IEEE802.11 WLAN (wireless local area network), guarantees the high-priority users bandwidth, it is characterized in that: by the Measurement Network congestion state, website to different priorities is given different auto-adaptive parameters respectively, the adjustable range that promptly has different initial competition windows respectively, each website is adjusted the size of initial competition window in the initial competition window adjustable range that this website allows according to collision situation simultaneously, it is the access probability that self adaptation is regulated this website, control the transmission of each website, thereby under the heavy duty situation, make the bandwidth of high-priority users be guaranteed, simultaneously, improve the total throughout of system.
2, the implementation method of the bandwidth of assurance high-priority users according to claim 1 is characterized in that: comprise following concrete operations step:
A, Measurement Network congestion state: with numeric representation current network collision and the congestion condition of the average collision duration of each website in each virtual transmission cycle, with load factor l numerical value and its optimal value l of actual measurement with the load factor l of the ratio of average free time length
OptCompare, and deposit comparative result in counter; The number m of the packet that successfully transmits with this website number of times is as a comparison promptly comprising total duration L of virtual transmission cycle that m success transmits again
pIn, the load factor l that the each success of actual measurement is transmitted all with its optimal value l
OptCompare one by one, and with the last numerical value of comparative result counter as measurement result;
B, adjust the initial contention window value W of this website according to measurement result
Init: the numerical values recited according to the comparative result counter is judged network condition, and counter values is big, illustrates that load factor l is big, and network is in congested, then initial contention window value is doubled to enlarge, to reduce collision; Otherwise counter values is little, illustrates that load factor l is little, and network is in the free time, then initial contention window value is reduced by half and dwindles, to increase the access channel probability; If the initial contention window size after the change drops on outside the initial competition window scope of this website permission, then it is adjusted within this scope;
C, by packet mode incidentally, this website is published in the network through above-mentioned adjusted initial contention window value; Whether the window numerical value that incidentally arrives this website in the receiving station judgment data bag within the initial competition window adjustable range of such user, if not within this scope, is then adjusted to it within this scope; Each website with the assurance equal priority all is with identical initial contention window value access channel; Return steps A again and carry out cycling.
3, the implementation method of the bandwidth of assurance high-priority users according to claim 2 is characterized in that: described steps A further comprises following concrete operations step:
A1, initiation parameter: the initial value of load factor l is made as optimal value l
Opt=0.86, and with number of comparisons counter and the zero setting respectively of comparative result counter;
A2, detection network collision situation: before each successful swap data, calculate present load factor l numerical value; Concrete computational methods are mean collision time length and mean down time length ratios in each virtual transmission cycle of statistics; And after each computational load factor, the number of comparisons calculator is added 1;
Do you A3, judge that load factor l is near optimal value 0.86: judge that load factor l triggers thresholding σ greater than 0.86+? if after then the comparative result counter adds 1, enter the A4 operating procedure; Do you if not, judge that again load factor l triggers thresholding σ less than 0.86-? if after then the comparative result counter subtracts 1, enter the A4 operating procedure; If not, directly enter the A4 operating procedure;
A4, after the numerical value of number of comparisons counter reaches m, whether the numerical value of judging the comparative result counter is greater than its upper limit threshold value m/2, perhaps,, then need the initial contention window value of this website is regulated if satisfy above-mentioned condition less than its lower limit threshold value-m/2.
4, the implementation method of the bandwidth of assurance high-priority users according to claim 2 is characterized in that: described step B further comprises following concrete operations step:
B1, judge the comparative result counter numerical value whether greater than its upper limit threshold value m/2, if, after initial contention window value doubled, enter the B3 operating procedure, if not, order is carried out the subsequent operation step;
B2, judge the comparative result counter numerical value whether less than its lower limit threshold value-m/2, if, after initial contention window value reduced by half, enter the B3 operating procedure, if not, order is carried out the subsequent operation step;
Whether B3, the initial competition window after judge regulating be in the initial competition window scope that this website allows, if the lower limit threshold value after regulating is less than lower bound, then directly it is adjusted to the lower limit threshold value, if the upper limit threshold value after regulating then directly is adjusted to it upper limit threshold value greater than the upper bound; Respectively to relatively number of times counter and the zero setting of comparative result counter;
5, the implementation method of the bandwidth of assurance high-priority users according to claim 2, it is characterized in that: described step C further comprises following concrete operations step: after each website carries out successfully transmitting for m time, and the incidentally window value W after above-mentioned adjusted initial contention window value regulated as this website
Piggyback, and incidentally go out by the packet that last successfully transmits; Described incidentally window value W
PiggybackIt is the byte that the initiating terminal of the packet that transmits of success is in the end set up, be used for this website and incidentally broadcast the adjusted initial contention window value of this website to other websites at packet, so as all normally detect other each website that this packet successfully sends can both be according to the incidentally window value W of this packet
PiggybackUpgrade the initial contention window value of oneself.
6, according to the implementation method of the bandwidth of claim 2 or 5 described assurance high-priority users, it is characterized in that: the receiving station among the described step C is receiving that the method for adjustment behind the initial competition window of the movable website of window incidentally is: if incidentally window is greater than the upper bound of the initial competition window adjustable range of this receiving station, then directly this numerical value is set to the upper bound of its initial competition window adjustable range; If incidentally window is less than the lower bound of the initial competition window adjustable range of this receiving station, then directly this numerical value is set to the lower bound of its initial competition window adjustable range; Otherwise, the direct window value that the initial competition window of this receiving station is arranged to incidentally come in the packet.
7, the implementation method of the bandwidth of assurance high-priority users according to claim 5 is characterized in that: the incidentally window value W of a described byte
PiggybackFirst bit be sign position, this sign position be 1 expression its be the Frame of window incidentally, the sign position be 0 expression its be the Frame of window incidentally not; Next seven bits are window factors, the initial contention window value W after this window factor representation is regulated
Init+ 1, its numerical value is (window minimum value W
Min+ 1) multiple.
8, the implementation method of the bandwidth of assurance high-priority users according to claim 7 is characterized in that: described window minimum value W
MinBe 31.
9, the implementation method of the bandwidth of assurance high-priority users according to claim 1 and 2 is characterized in that: the initial contention window value scope of the preferential website of described bandwidth is: [W
Min, α * (W
Min+ 1)-1], the initial contention window value scope of other websites is: [W
Min, W
Max]; Wherein α is the parameter of control bandwidth, and the size of adjusting α can obtain the throughput of different preferential access websites.
10, according to the implementation method of the bandwidth of claim 3 or 4 described assurance high-priority users, it is characterized in that: the m value in the described number of comparisons counter is according to initial competition window W
InitNumerical value calculates, and its result of calculation is as follows: as initial contention window value W
InitBe respectively: 31,63,127,255,511,1023 o'clock, the number of comparisons m of corresponding low priority user was respectively: 25,12,6,3,2,1; The number of comparisons m of high-priority users then is 4 times of low priority user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101004800A CN100456717C (en) | 2003-10-17 | 2003-10-17 | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101004800A CN100456717C (en) | 2003-10-17 | 2003-10-17 | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1529471A true CN1529471A (en) | 2004-09-15 |
| CN100456717C CN100456717C (en) | 2009-01-28 |
Family
ID=34304062
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101004800A Expired - Fee Related CN100456717C (en) | 2003-10-17 | 2003-10-17 | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100456717C (en) |
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006136113A1 (en) * | 2005-06-24 | 2006-12-28 | Huawei Technologies Co., Ltd. | A method for ensuring quality of service for customer in wireless communication system |
| CN1330158C (en) * | 2004-09-30 | 2007-08-01 | 中国联合通信有限公司 | A mobile communication multimedia gateway system and multimedia processing method thereof |
| CN1330127C (en) * | 2004-09-30 | 2007-08-01 | 中国联合通信有限公司 | Mobile communication multimedia information source interface system and method |
| CN100337445C (en) * | 2005-01-11 | 2007-09-12 | 中国科学院计算技术研究所 | QoS scheduler for voice service in broadband wireless MAN and method thereof |
| WO2008092402A1 (en) * | 2007-01-26 | 2008-08-07 | Huawei Technologies Co., Ltd. | Closed-loop clock synchronization |
| US7675945B2 (en) | 2006-09-25 | 2010-03-09 | Futurewei Technologies, Inc. | Multi-component compatible data architecture |
| CN101119585B (en) * | 2006-08-01 | 2010-05-12 | 华为技术有限公司 | Distributed non-cooperation multipoint-to-multipoint network, node and connection establishing method |
| CN101098296B (en) * | 2006-06-30 | 2010-05-26 | 西门子（中国）有限公司 | Method and apparatus for controlling wireless channel access competitiveness |
| CN101207535B (en) * | 2006-12-18 | 2010-06-09 | 华为技术有限公司 | Method, system and apparatus of network switch-in |
| US7809027B2 (en) | 2006-09-25 | 2010-10-05 | Futurewei Technologies, Inc. | Network clock synchronization floating window and window delineation |
| US7813271B2 (en) | 2006-09-25 | 2010-10-12 | Futurewei Technologies, Inc. | Aggregated link traffic protection |
| CN101212371B (en) * | 2006-12-29 | 2010-11-24 | 华为技术有限公司 | Channel access parameter configuration method, access point, server, and communication system |
| WO2010145527A1 (en) * | 2009-06-30 | 2010-12-23 | 中兴通讯股份有限公司 | Priority-based contention ranging method and apparatus for mobile terminals |
| US7961751B2 (en) | 2006-09-25 | 2011-06-14 | Futurewei Technologies, Inc. | Multiplexed data stream timeslot map |
| US7986700B2 (en) | 2006-09-25 | 2011-07-26 | Futurewei Technologies, Inc. | Multiplexed data stream circuit architecture |
| US8010672B2 (en) | 2005-07-29 | 2011-08-30 | Alcatel Lucent | Methods and systems for controlling utilization of resources of contention |
| CN102244683A (en) * | 2011-07-22 | 2011-11-16 | 北京邮电大学 | Method for improving service quality of mixed businesses in vehicular networking application |
| CN102395213A (en) * | 2011-10-28 | 2012-03-28 | 浙江工业大学 | Mathematical modeling method of competition window average length of IEEE 802.11 wireless network node |
| CN101292475B (en) * | 2005-10-21 | 2012-05-02 | 国际商业机器公司 | Adaptive bandwidth control method and device |
| US8295310B2 (en) | 2006-09-25 | 2012-10-23 | Futurewei Technologies, Inc. | Inter-packet gap network clock synchronization |
| US8340101B2 (en) | 2006-09-25 | 2012-12-25 | Futurewei Technologies, Inc. | Multiplexed data stream payload format |
| CN102870378A (en) * | 2010-01-26 | 2013-01-09 | 卡波施交通公司 | Adaptive contention window in discontinuous wireless communication channels |
| US8494009B2 (en) | 2006-09-25 | 2013-07-23 | Futurewei Technologies, Inc. | Network clock synchronization timestamp |
| US8532094B2 (en) | 2006-09-25 | 2013-09-10 | Futurewei Technologies, Inc. | Multi-network compatible data architecture |
| CN101385383B (en) * | 2006-02-21 | 2013-12-18 | 诺基亚西门子通信有限责任两合公司 | Centralized congestion avoidance in passive optical network |
| US8660152B2 (en) | 2006-09-25 | 2014-02-25 | Futurewei Technologies, Inc. | Multi-frame network clock synchronization |
| CN103795643A (en) * | 2014-01-28 | 2014-05-14 | 广西大学 | Method for processing synchronous priority bursty flow in data center network |
| CN103905328A (en) * | 2012-12-25 | 2014-07-02 | 中国移动通信集团公司 | Data transmission control system and method and related equipment |
| US8976796B2 (en) | 2006-09-25 | 2015-03-10 | Futurewei Technologies, Inc. | Bandwidth reuse in multiplexed data stream |
| CN104796355A (en) * | 2008-01-10 | 2015-07-22 | 苹果公司 | Apparatus and methods for network resource allocation |
| CN105163393A (en) * | 2015-09-28 | 2015-12-16 | 上海理工大学 | Wireless link resource management method for use in intelligent traffic |
| CN112630821A (en) * | 2020-12-30 | 2021-04-09 | 核工业北京地质研究院 | Variable frequency control device applied to seismic data acquisition and control method thereof |
| CN115442314A (en) * | 2022-09-05 | 2022-12-06 | 天津大学 | Practical data center network active transmission system and method |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9719316D0 (en) * | 1997-09-12 | 1997-11-12 | Power X Limited | Priority selection means for data transmission apparatus |
| US6160812A (en) * | 1998-05-04 | 2000-12-12 | Cabletron Systems, Inc. | Method and apparatus for supplying requests to a scheduler in an input buffered multiport switch |
| JP4879436B2 (en) * | 2000-02-23 | 2012-02-22 | マイクロソフト コーポレーション | Quality of service over communication paths with wireless links |
| CN1398091A (en) * | 2001-07-13 | 2003-02-19 | 深圳市中兴通讯股份有限公司 | Random routing method |
| US7142552B2 (en) * | 2002-04-08 | 2006-11-28 | International Business Machines Corporation | Method and system for priority enforcement with flow control |
-
2003
- 2003-10-17 CN CNB2003101004800A patent/CN100456717C/en not_active Expired - Fee Related
Cited By (51)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1330158C (en) * | 2004-09-30 | 2007-08-01 | 中国联合通信有限公司 | A mobile communication multimedia gateway system and multimedia processing method thereof |
| CN1330127C (en) * | 2004-09-30 | 2007-08-01 | 中国联合通信有限公司 | Mobile communication multimedia information source interface system and method |
| CN100337445C (en) * | 2005-01-11 | 2007-09-12 | 中国科学院计算技术研究所 | QoS scheduler for voice service in broadband wireless MAN and method thereof |
| CN100384300C (en) * | 2005-06-24 | 2008-04-23 | 华为技术有限公司 | Method of guarantee user service quality in radio communication system |
| WO2006136113A1 (en) * | 2005-06-24 | 2006-12-28 | Huawei Technologies Co., Ltd. | A method for ensuring quality of service for customer in wireless communication system |
| US8010672B2 (en) | 2005-07-29 | 2011-08-30 | Alcatel Lucent | Methods and systems for controlling utilization of resources of contention |
| CN101292475B (en) * | 2005-10-21 | 2012-05-02 | 国际商业机器公司 | Adaptive bandwidth control method and device |
| CN101385383B (en) * | 2006-02-21 | 2013-12-18 | 诺基亚西门子通信有限责任两合公司 | Centralized congestion avoidance in passive optical network |
| CN101098296B (en) * | 2006-06-30 | 2010-05-26 | 西门子（中国）有限公司 | Method and apparatus for controlling wireless channel access competitiveness |
| CN101119585B (en) * | 2006-08-01 | 2010-05-12 | 华为技术有限公司 | Distributed non-cooperation multipoint-to-multipoint network, node and connection establishing method |
| US8401010B2 (en) | 2006-09-25 | 2013-03-19 | Futurewei Technologies, Inc. | Multi-component compatible data architecture |
| US8660152B2 (en) | 2006-09-25 | 2014-02-25 | Futurewei Technologies, Inc. | Multi-frame network clock synchronization |
| US7813271B2 (en) | 2006-09-25 | 2010-10-12 | Futurewei Technologies, Inc. | Aggregated link traffic protection |
| US9106439B2 (en) | 2006-09-25 | 2015-08-11 | Futurewei Technologies, Inc. | System for TDM data transport over Ethernet interfaces |
| US9019996B2 (en) | 2006-09-25 | 2015-04-28 | Futurewei Technologies, Inc. | Network clock synchronization floating window and window delineation |
| US7961751B2 (en) | 2006-09-25 | 2011-06-14 | Futurewei Technologies, Inc. | Multiplexed data stream timeslot map |
| US7986700B2 (en) | 2006-09-25 | 2011-07-26 | Futurewei Technologies, Inc. | Multiplexed data stream circuit architecture |
| US8982912B2 (en) | 2006-09-25 | 2015-03-17 | Futurewei Technologies, Inc. | Inter-packet gap network clock synchronization |
| US8976796B2 (en) | 2006-09-25 | 2015-03-10 | Futurewei Technologies, Inc. | Bandwidth reuse in multiplexed data stream |
| US8837492B2 (en) | 2006-09-25 | 2014-09-16 | Futurewei Technologies, Inc. | Multiplexed data stream circuit architecture |
| US7809027B2 (en) | 2006-09-25 | 2010-10-05 | Futurewei Technologies, Inc. | Network clock synchronization floating window and window delineation |
| US8289962B2 (en) | 2006-09-25 | 2012-10-16 | Futurewei Technologies, Inc. | Multi-component compatible data architecture |
| US8295310B2 (en) | 2006-09-25 | 2012-10-23 | Futurewei Technologies, Inc. | Inter-packet gap network clock synchronization |
| US8340101B2 (en) | 2006-09-25 | 2012-12-25 | Futurewei Technologies, Inc. | Multiplexed data stream payload format |
| US8588209B2 (en) | 2006-09-25 | 2013-11-19 | Futurewei Technologies, Inc. | Multi-network compatible data architecture |
| US7675945B2 (en) | 2006-09-25 | 2010-03-09 | Futurewei Technologies, Inc. | Multi-component compatible data architecture |
| US8494009B2 (en) | 2006-09-25 | 2013-07-23 | Futurewei Technologies, Inc. | Network clock synchronization timestamp |
| US8532094B2 (en) | 2006-09-25 | 2013-09-10 | Futurewei Technologies, Inc. | Multi-network compatible data architecture |
| CN101207535B (en) * | 2006-12-18 | 2010-06-09 | 华为技术有限公司 | Method, system and apparatus of network switch-in |
| CN101212371B (en) * | 2006-12-29 | 2010-11-24 | 华为技术有限公司 | Channel access parameter configuration method, access point, server, and communication system |
| US7787498B2 (en) | 2007-01-26 | 2010-08-31 | Futurewei Technologies, Inc. | Closed-loop clock synchronization |
| US8605757B2 (en) | 2007-01-26 | 2013-12-10 | Futurewei Technologies, Inc. | Closed-loop clock synchronization |
| WO2008092402A1 (en) * | 2007-01-26 | 2008-08-07 | Huawei Technologies Co., Ltd. | Closed-loop clock synchronization |
| CN104796355B (en) * | 2008-01-10 | 2018-06-01 | 苹果公司 | For Internet resources assigned unit and method |
| CN104796355A (en) * | 2008-01-10 | 2015-07-22 | 苹果公司 | Apparatus and methods for network resource allocation |
| WO2010145527A1 (en) * | 2009-06-30 | 2010-12-23 | 中兴通讯股份有限公司 | Priority-based contention ranging method and apparatus for mobile terminals |
| CN102870378A (en) * | 2010-01-26 | 2013-01-09 | 卡波施交通公司 | Adaptive contention window in discontinuous wireless communication channels |
| CN102870378B (en) * | 2010-01-26 | 2015-09-09 | 卡波施交通公司 | Self adaptation contention window in discontinuous radio communication channel |
| CN102244683B (en) * | 2011-07-22 | 2014-04-09 | 北京邮电大学 | Method for improving service quality of mixed businesses in vehicular networking application |
| CN102244683A (en) * | 2011-07-22 | 2011-11-16 | 北京邮电大学 | Method for improving service quality of mixed businesses in vehicular networking application |
| CN102395213A (en) * | 2011-10-28 | 2012-03-28 | 浙江工业大学 | Mathematical modeling method of competition window average length of IEEE 802.11 wireless network node |
| CN102395213B (en) * | 2011-10-28 | 2014-05-21 | 浙江工业大学 | Mathematical modeling method of competition window average length of IEEE 802.11 wireless network node |
| CN103905328A (en) * | 2012-12-25 | 2014-07-02 | 中国移动通信集团公司 | Data transmission control system and method and related equipment |
| CN103905328B (en) * | 2012-12-25 | 2017-09-12 | 中国移动通信集团公司 | A kind of data transfer control system, method and relevant apparatus |
| CN103795643A (en) * | 2014-01-28 | 2014-05-14 | 广西大学 | Method for processing synchronous priority bursty flow in data center network |
| CN103795643B (en) * | 2014-01-28 | 2017-02-15 | 广西大学 | Method for processing synchronous priority bursty flow in data center network |
| CN105163393A (en) * | 2015-09-28 | 2015-12-16 | 上海理工大学 | Wireless link resource management method for use in intelligent traffic |
| CN105163393B (en) * | 2015-09-28 | 2019-03-19 | 上海理工大学 | Air-link resources management method in a kind of wisdom traffic |
| CN112630821A (en) * | 2020-12-30 | 2021-04-09 | 核工业北京地质研究院 | Variable frequency control device applied to seismic data acquisition and control method thereof |
| CN112630821B (en) * | 2020-12-30 | 2024-01-12 | 核工业北京地质研究院 | Variable frequency control device applied to seismic data acquisition and control method thereof |
| CN115442314A (en) * | 2022-09-05 | 2022-12-06 | 天津大学 | Practical data center network active transmission system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100456717C (en) | 2009-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1529471A (en) | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN | |
| Lindgren et al. | Evaluation of quality of service schemes for IEEE 802.11 wireless LANs | |
| US9807802B2 (en) | Method and device for adjusting contention window value adaptively | |
| EP1507367B1 (en) | Management of frame bursting | |
| KR101260215B1 (en) | Method and apparatus for determining and managing congestion in a wireless communications system | |
| JP4435235B2 (en) | Method and apparatus for controlling wireless medium congestion by adjusting contention window size and separating selected mobile stations | |
| CN102625466B (en) | Distributed media access method used in wireless local area network | |
| US20060215686A1 (en) | Communication method for accessing wireless medium under enhanced distributed channel access | |
| Siris et al. | Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11 e WLANs: test-bed implementation and evaluation | |
| US8369350B2 (en) | Method for transmitting and receiving frame in wireless LAN | |
| CN1894986A (en) | Adaptive radio resource management for wireless local area networks | |
| WO2004077225A2 (en) | Quality of service differentiation in wireless networks | |
| EP2936912B1 (en) | Dynamically splitting a wi-fi access point into virtual access points according to the number of transmitting stations | |
| CN101150469A (en) | A packet dispatching method based on avoidance mechanism in WLAN | |
| CN1860375A (en) | Method and apparatus for determining a quality measure of a channel within a communication system | |
| JP6283879B2 (en) | Wireless communication device, CW maximum value acquisition device, CW maximum value acquisition method, and program | |
| Zhou et al. | Adaptive contention window tuning for IEEE 802.11 | |
| El Housseini et al. | Adaptive contention-window MAC algorithms for QoS-enabled wireless LANs | |
| EP3579503B1 (en) | Medium access control circuit and data processing method | |
| Tsai et al. | An analytical model for IEEE 802.11 e EDCA | |
| Lv et al. | A novel adaptively dynamic tuning of the contention window (CW) for distributed coordination function in IEEE 802.11 ad hoc networks | |
| Chern et al. | Enhanced distribution channel access—Modification of the intial & thereafter CW (EDCA-MITCW) | |
| CN111263463A (en) | IEEE802-11ax QoS channel access control method based on service priority | |
| Khalaj et al. | The effect of decreasing CW size on performance IEEE 802.11 DCF | |
| Chan et al. | A collision-aware backoff mechanism for IEEE 802.11 WLANs |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090128 Termination date: 20121017 |