CN104661319B - Based on the wireless local area network access method for making a turn scheduling - Google Patents
Based on the wireless local area network access method for making a turn scheduling Download PDFInfo
- Publication number
- CN104661319B CN104661319B CN201510021404.3A CN201510021404A CN104661319B CN 104661319 B CN104661319 B CN 104661319B CN 201510021404 A CN201510021404 A CN 201510021404A CN 104661319 B CN104661319 B CN 104661319B
- Authority
- CN
- China
- Prior art keywords
- user
- round
- competition
- users
- priority
- 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
Abstract
It is based on the wireless local area network access method for making a turn scheduling, this method the invention discloses a kind of：When user attempts access wireless channel, according to the service QoS demand of itself suitable priority will be selected to access, high-priority users compete round execution at first and make a turn scheduling, and low priority user competes round at first and immediately begins to compete；The user to win in upper competition round continues to participate in competition into next round, reaches maximum contention round until being eliminated or continuously winning, and the user being eliminated directly exits competition selection process, and the user finally to win accesses channel.This method solve thes problems, such as that a large number of users accesses WLAN by the competition selection process of more rounds, the chance that ensure that high-priority users have maximum probability to be successfully accessed channel by making a turn dispatching method at the same time, and the fairness between All factors being equal, preference will be give to level user is also guaranteed.
Description
Technical field
The invention belongs to the media access field in the communication technology, it is related to and a kind of is connect based on the WLAN for making a turn scheduling
Enter method, this method can be used for the access of user in a wireless local area network.
Background technology
In distributed wireless local area network, user's classification is to provide service quality (QoS, Quality of Service) guarantor
The main method of card, user are divided into different priority, for low priority user, Gao You according to its business demand
First level user occupies more channel resources.802.11 DCF agreements of IEEE are common access protocols in WLAN, it
Continuous collision problem between accessing user is solved using binary exponential backoff method, Idea of Classification is applied to IEEE
802.11 DCF agreements mainly have following several method：1) based on the stage division for keeping out of the way window, including home window classification, window
The classification of mouth growth factor, maximum window size classification；2) stage division based on frame period, mainly including Arbitration Inter Frame Space
The classification of (AIFS, Arbitration Inter frame Space)；3) both above method, i.e., be combined by mixed method.
Strengthening distributed coordination to access (EDCA, Enhanced Distributed Channel Access) is used in WLAN
In the typical protocol for providing user's QoS guarantee, it is a kind of mixing-classifying agreement, and different access priority users has difference
AIFS intervals and contention window size.When network user's number is very big, EDCA adds the collision of user access network
Probability, may cause low priority user can not access network, and the fairness between user cannot be guaranteed.
In order to solve the problems, such as that large-capacity user accesses WLAN, it is suggested based on the superseded cut-in method of competition,
Accessing user sends signal pulse by randomly choosing time slot and carries out information exchange and determined according to the sequence number of signal pulse
Victor.Obtain significantly being lifted using the handling capacity of this method WLAN, and the fairness of user is also protected
Card.But for the QoS sensitive users that delay requirement is higher or data volume is bigger, this method cannot make us full
Meaning.
Therefore, necessary proposition one kind can solve a large number of users access network while can ensure that each priority is used
The wireless local area network access method of fairness between the QoS demand at family and user.
The content of the invention
Goal of the invention：There is provided it is a kind of based on the wireless local area network access method for making a turn scheduling, to solve prior art presence
The above problem.
Technical solution：It is a kind of based on the wireless local area network access method for making a turn scheduling, when user attempts access wireless channel
When, select suitable priority to access according to the service QoS demand of itself, high-priority users compete round at first and perform
Scheduling is made a turn, low priority user competes round at first and starts to compete；
The user to win in upper competition round continues to participate in competition into next round, until being eliminated or connecting
Continuous win reaches maximum contention round, and the user being eliminated directly exits competition selection process.
In a further embodiment, this method is specific as follows：
S1, each accessing user select respective priority to be accessed according to the QoS demand of itself, while competition round
Indicator variable C is set to 1；Execution makes a turn scheduling during high-priority users compete round at first, and it is straight to be carried out at the same time carrier sense
To the data signal pulses for detecting other users transmission, low priority user participates in the competition of first round；
S2, the value R each participated in accessing user's random selection [1, m] that this round competes launch as epicycle to be believed
Feel the pulse the slot index of punching；
S3, specifically include：S31, judge whether current time slots number are equal to its randomly selected slot index R, if so, S32,
The user sends signal pulse notice other users, and it wins；If it is not, S33, the user perform carrier sense；S34, judge whether
Detect pulse signal, wheel more than this time is exited if the signal pulse that other users transmission is detected in current time slots the user
Compete, otherwise return to step S31；
Competition round indicator variable C is added 1 by the channel competition that S4, the user enter next round at the same time, if currently
Competition round indicator variable C is equal to maximum contention wheel number k, and the user then accesses channel and starts data transfer, otherwise repeats
Step is stated, is equal to maximum contention wheel number k until competing round indicator variable C, or the user is eliminated and exits this competition
Selection process.
In a further embodiment, single-wheel competition round maximum timeslot number be m, it is assumed that once competition selection process it
Slot length be L, then maximum contention wheel number k is L/m, is maximum competing by single-wheel maximum timeslot number, k of m for one
The WLAN of wheel number is striven, it is m that it, which competes the number of vector,k, in order to make the sum maximum of competition vector to mkDerivation simultaneously makes
It is 0, so as to obtain dependent variable m equal to 3.
In a further embodiment, maximum contention wheel number k values are 7, to ensure that the handling capacity of WLAN needs
Ask.
Beneficial effect：The present invention is proposed based on the wireless local area network access method for making a turn scheduling, and advantage is by making a turn
The method of scheduling meets the QoS demand of each priority users well, and high-priority users are there is a greater chance that competing
In win and occupy channel；The total number of users that eliminating method network by the competition taken turns more at the same time can accommodate greatly improves,
And because sending the randomness of signal pulse time slot, the fairness between same priority user is also guaranteed.
Brief description of the drawings
Fig. 1 is that schematic diagram is eliminated in user's competition.
Fig. 2 is user's access process figure.
Fig. 3 is single-wheel competition flow chart.
Embodiment
In the following description, a large amount of concrete details are given in order to provide more thorough understanding of the invention.So
And it is obvious to the skilled person that the present invention may not need one or more of these details and be able to
Implement.In other examples, in order to avoid with the present invention obscure, for some technical characteristics well known in the art not into
Row description.
Related notion is described as follows：
Compete round：User carries out the minimum unit of access contention.By taking Fig. 1 as an example, it is each compete round eliminate 1 respectively,
0th, 2,0,1,1,0 users.
Signal pulse：For notifying other occupied a bit of data flows of accessing user's current time slots channel in network,
As shown in grid frame in Fig. 1.
Make a turn scheduling：User performs carrier sense in current competitive round, and detecting on channel has signal pulse then to terminate.
Compete vector：Sequence of the user in the randomly selected signal pulse transmission time slot number composition of each round.With B tables
Show that the user makes a turn in epicycle time, representing that the user has been eliminated with X is not engaged in the competition of epicycle., should by taking B223XXX as an example
User competes round at first and makes a turn, and competing round at second and the 3rd selects second time slot to send pulse signal,
Round is competed at the 4th to be eliminated.
The present invention technological thought be：When user attempts access wireless channel, the user selects according to the QoS demand of itself
Select the access of suitable priority, high-priority users, which at first compete round and perform, makes a turn scheduling, and low priority user is the
One competition round immediately begins to compete.The user to win in one competition round continues to participate in competition into next round,
Reach maximum contention round until being eliminated or continuously winning, the user being eliminated directly exits competition selection process.
The specific implementation of the present invention comprises the following steps and carries out according to the sequence：
1) each accessing user is accessed according to QoS demand selection respective priorities such as itself handling capacity, time delays, together
When competition round indicator variable C is set to 1.High-priority users perform in first competition round and make a turn scheduling, while into
The data signal pulses that row carrier sense is sent until detecting other users, low priority user participate in the competing of first round
Strive；
2) the value R each participated in accessing user's random selection [1, m] of this round competition launches letter as epicycle
Feel the pulse the slot index of punching；
If 3) current time slots number are equal to its randomly selected timeslot number R, the user sends signal pulse and notifies other use
Family it win；If current time slots number are not equal to R, the user performs carrier sense, if detected in current time slots the user
The signal pulse sent to other users then exits wheel competition more than this time, otherwise still carries out carrier sense simultaneously in next time slot
Repeat step 3)；
4) the user enters the channel competition of next round while competition round indicator variable C is added 1, if current competing
Strive round indicator variable C and be equal to k, the user then accesses channel and starts data transfer, otherwise repeats the above steps 2)~3) until
Competition round indicator variable C is equal to k, or the user is eliminated and exits this competition selection process.
The maximum timeslot number of the single-wheel competition round is m.It is assumed that once its slot length of competition selection process is
L, then maximum contention wheel number k is L/m, for one by single-wheel maximum timeslot number of m, the nothing that k is maximum contention wheel number
Line LAN, it is m that it, which competes the number of vector,k, in order to make the sum maximum of competition vector to mkDerivation simultaneously makes it as 0 so as to obtain
It is equal to 3 to dependent variable m.
The value of user's maximum contention wheel number k should ensure that the throughput demand of WLAN, general value
For 7.
Exemplified by shown in Fig. 1, maximum contention round k is 7, and single-wheel maximum timeslot number m is 3, user terminal S1、S2、S3、S4、
S5、S6、S7Channel, wherein S are accessed by way of competition1、S4、S5Belong to high-priority users, S2、S3、S6、S7Belong to low excellent
First level user.
High-priority users make a turn in first round and are not involved in competing, and perform carrier sense.S3In first round
It is eliminated in low priority user competition, because its randomly selected transmitting signal slot is 3, and other low priority users are equal
For 2.High-priority users and remaining low priority user are at war with second round, all with winning per family.3rd
User S in wheel competition round5、S7It is eliminated.User S in fourth round competition round1、S2、S4、S6Win.In 5th wheel competition
S4Randomly selected transmitting signal slot is 2, the time slot of other competition users is 1, S4It is eliminated.User S in 6th wheel competition2
It is eliminated, user S1、S6Win.S1、S6Launch signal slot in the competition of 7th round and have selected 3, therefore access letter at the same time
Road brings collision.User S1、S2、S3、S4、S5、S6、S7It is failed in this access attempts, therefore start next time
More wheel access contention selection process.
The competition vector of 7 users is as shown in table 1 in this example.
The competition vector example of 1.7 users of table
| Accessing user number | Compete vector |
| S1 | B323123 |
| S2 | 232313X |
| S3 | 3XXXXXX |
| S4 | B3232XX |
| S5 | B33XXXX |
| S6 | 2323123 |
| S7 | 233XXXX |
Specific implementation is as shown in Fig. 2 and attached 3, and Fig. 3 is the flow chart of the single-wheel competition process in attached drawing 2, corresponding to following
Step g).
The specific implementation of this method comprises the following steps and carries out according to the sequence：
A) each accessing user is accessed according to QoS demand selection respective priorities such as itself handling capacity, time delays, together
When competition round indicator variable C is set to 1.
B) judge whether present node is priority node, if it is, entering step c), if it is not, then entering step
It is rapid f)；Execution makes a turn scheduling during high-priority users compete round at first, is carried out at the same time carrier sense until detecting it
The data signal pulses that his user sends, low priority user participate in the competition of first round；
C) carrier sense is performed；
D) judge whether to detect signal pulse, if so, then entering step e), if not, continuing step c)；
E) enter next one to compete, C=C+1；
F) judge whether C is equal to round maximum k, if so, then entering step i), such as otherwise enter step g)；
G) single-wheel time competition is carried out；
H) judge whether the node is eliminated, if so, then entering step i), such as otherwise return to step e)；
I) terminate.
Fig. 3 is gone to, to each single-wheel time competition：
1) the value R each participated in accessing user's random selection [1, m] of this round competition launches letter as epicycle
Feel the pulse the slot index of punching；The maximum timeslot number of single-wheel competition round is m.It is assumed that once compete selection process its slot length
For L, then maximum contention wheel number k is L/m, by single-wheel maximum timeslot number, k of m is maximum contention wheel number for one
WLAN, it is m that it, which competes the number of vector,k, in order to make the sum maximum of competition vector to mkDerivation and make its for 0 so as to
Dependent variable m is obtained equal to 3.
2) 2.1, judge whether current time slots number are equal to its randomly selected slot index R, if so, 2.2, the user sends
Signal pulse notice other users it win；If it is not, 2.3, the user performs carrier sense；2.4th, judge whether to detect pulse
Signal, exits wheel competition more than this time, otherwise if the signal pulse that other users transmission is detected in current time slots the user
Return to step 2.1；
3) the user enters the channel competition of next round while competition round indicator variable C is added 1, if current competing
Strive round indicator variable C and be equal to k, the user then accesses channel and starts data transfer, otherwise repeats the above steps 1)~2) until
Competition round indicator variable C is equal to k, or the user is eliminated and exits this competition selection process.
The value of user's maximum contention wheel number k should ensure that the throughput demand of WLAN, and general value is 7.
In short, if the competition in a competition round can be not involved in view of a user, then compared to other
For user, the probability that it has bigger is won in this competition selection process, that is to say, that is held by competing round at one
Row makes a turn scheduling, and the user can have more chances to occupy channel, the handling capacity of such user obtains by this method
Lifted and reduce the access delay of business datum.This method can support the access of a large number of users, while disclosure satisfy that each
The QoS demand of priority users simultaneously ensures the fairness between accessing user.
Above-mentioned implementation system and method can be applied to using any carrier sensing method and signal pulse launching technique
WLAN access procedure.All all any modification, equivalent and improvement done within spirit of the invention and principle etc.,
Within protection scope of the present invention.It is it is further to note that each described in above-mentioned embodiment
Particular technique feature, in the case of reconcilable, can be combined by any suitable means.In order to avoid unnecessary
Repeat, the present invention no longer separately illustrates various combinations of possible ways.In addition, the present invention a variety of embodiments it
Between can also be combined, as long as its without prejudice to the present invention thought, its should equally be considered as it is disclosed in this invention in
Hold.
Claims (3)
- It is 1. a kind of based on the wireless local area network access method for making a turn scheduling, it is characterised in that when user attempts access wireless channel When, select suitable priority to access according to the service QoS demand of itself, high-priority users compete round at first and perform Scheduling is made a turn, low priority user competes round at first and starts to compete；The user to win in upper competition round enters Next round continues to participate in competition, reaches maximum contention round until being eliminated or continuously winning, the user being eliminated is straight Connect and exit competition selection process, the method is specific as follows：S1, each accessing user select respective priority to be accessed according to the QoS demand of itself, while competition round is indicated Variable (C) is set to 1；High-priority users first compete round in perform make a turn scheduling, be carried out at the same time carrier sense until Detect the data signal pulses that other users are sent, low priority user participates in the competition of first round；S2, the value R each participated in accessing user's random selection [1, m] that this round competes launch signal arteries and veins as epicycle The slot index of punching；S3, specifically include：S31, judge whether current time slots number are equal to its randomly selected slot index (R), if so, S32, should User sends signal pulse notice other users, and it wins；If it is not, S33, the user perform carrier sense；S34, judge whether to examine Pulse signal is measured, it is competing to exit the round if the signal pulse that other users transmission is detected in current time slots the user Strive, otherwise return to step S31；S4, the user enter the channel competition of next round at the same time competition round indicator variable (C) plus 1, if current competing Strive round indicator variable (C) and be equal to maximum contention wheel number (k), the user then accesses channel and starts data transfer, otherwise repeats Above-mentioned steps S2-S3, is equal to maximum contention wheel number (k) until competing round indicator variable (C), or the user is eliminated and moves back Go out this competition selection process.
- 2. as claimed in claim 1 based on the wireless local area network access method for making a turn scheduling, it is characterised in that single-wheel competition wheel Secondary maximum timeslot number is m, it is assumed that once its slot length of competition selection process is L, then maximum contention wheel number k is L/ M, for one by single-wheel maximum timeslot number of m, the WLAN that k is maximum contention wheel number, its compete vector number For mk, in order to make the sum of competition vector maximum to mk derivations and to make it be 0, so as to obtain dependent variable m equal to 3.
- 3. as claimed in claim 2 based on the wireless local area network access method for making a turn scheduling, it is characterised in that maximum contention wheel Number k values are 7, to ensure the throughput demand of WLAN.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510021404.3A CN104661319B (en) | 2015-01-15 | 2015-01-15 | Based on the wireless local area network access method for making a turn scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510021404.3A CN104661319B (en) | 2015-01-15 | 2015-01-15 | Based on the wireless local area network access method for making a turn scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104661319A CN104661319A (en) | 2015-05-27 |
| CN104661319B true CN104661319B (en) | 2018-04-20 |
Family
ID=53251889
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510021404.3A Expired - Fee Related CN104661319B (en) | 2015-01-15 | 2015-01-15 | Based on the wireless local area network access method for making a turn scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104661319B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100362821C (en) * | 2003-11-21 | 2008-01-16 | 北京邮电大学 | Method for improving heavyload performance of energy-saving mechanism in wireless local area network |
| CN101931954A (en) * | 2009-06-22 | 2010-12-29 | 南京中兴软件有限责任公司 | Method for improving quality of service (QoS) of real-time service in wireless local area network based on service differentiation |
| CN102123515A (en) * | 2011-03-10 | 2011-07-13 | 西安电子科技大学 | Superframe-based efficient media access control method in wireless body area network |
| CN103200695A (en) * | 2013-02-16 | 2013-07-10 | 华为技术有限公司 | Method, device and system of contention access channel |
| US8811311B2 (en) * | 2008-06-23 | 2014-08-19 | Nokia Corporation | Method and apparatus for performing random access procedure using soft dedicated preambles |
-
2015
- 2015-01-15 CN CN201510021404.3A patent/CN104661319B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100362821C (en) * | 2003-11-21 | 2008-01-16 | 北京邮电大学 | Method for improving heavyload performance of energy-saving mechanism in wireless local area network |
| US8811311B2 (en) * | 2008-06-23 | 2014-08-19 | Nokia Corporation | Method and apparatus for performing random access procedure using soft dedicated preambles |
| CN101931954A (en) * | 2009-06-22 | 2010-12-29 | 南京中兴软件有限责任公司 | Method for improving quality of service (QoS) of real-time service in wireless local area network based on service differentiation |
| CN102123515A (en) * | 2011-03-10 | 2011-07-13 | 西安电子科技大学 | Superframe-based efficient media access control method in wireless body area network |
| CN103200695A (en) * | 2013-02-16 | 2013-07-10 | 华为技术有限公司 | Method, device and system of contention access channel |
Non-Patent Citations (2)
| Title |
|---|
| A First-Round-Bye Based Priority Scheme for WLANs with Two Access Categories;Yiwei Mao，etc;《IEEE WCSP，2015 international conference on》;20151017;全文 * |
| 一种提供服务质量保证的区分优先级的分组调度架构;邹君妮等;《电子与信息学报》;20070331;第29卷(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104661319A (en) | 2015-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102474883B (en) | In half random back method of wireless local network resource reservation | |
| CN104994591B (en) | Method of adjustment, adjustment system and the base station of channel occupancy probabilities | |
| CN108924945B (en) | A kind of cut-in method and device | |
| KR100570830B1 (en) | method for medium access in wireless local area network system based on carrier sense multiple access with collision avoidance and apparatus thereof | |
| Sheu et al. | A priority MAC protocol to support real-time traffic in ad hoc networks | |
| CN102883460B (en) | A kind of service data transmission method and system | |
| CN106851852A (en) | For the method and apparatus of media interviews in network based on competition | |
| CN110290593A (en) | Wireless distributed network chance channel access method based on double jump threshold | |
| KR20050040445A (en) | Method for providing discriminated services based on priority in wireless lan environment | |
| CN108347746A (en) | Connection control method, access network elements and user equipment | |
| EP3952536A1 (en) | Information sending method and apparatus | |
| CN106686663A (en) | Uplink transmission method and device | |
| JP2001237839A (en) | Wireless packet priority control method | |
| CN103281750B (en) | Guarantee service quality and the collaboration multi-address access method of fairness and system | |
| CN104219017B (en) | A kind of physical layer data package transmission method and access node | |
| CN108271213A (en) | Communication control method, unauthorized transmission method and device | |
| CN106572499A (en) | Chanel access method based on decimal backoff | |
| CN105874847A (en) | Information sending method and apparatus | |
| CN109548061A (en) | One kind being based on markovian cognition wireless network saturation throughput method for solving | |
| CN106358316B (en) | A kind of channel access method and device | |
| CN104661319B (en) | Based on the wireless local area network access method for making a turn scheduling | |
| CN113766658A (en) | Self-organizing network for guaranteeing reliable transmission of high-priority time-sensitive service | |
| Kim et al. | Deterministic priority channel access scheme for QoS support in IEEE 802.11 e wireless LANs | |
| Jung et al. | MAC throughput analysis of HomePlug 1.0 | |
| Dugar et al. | Priority and fair scheduling in a wireless LAN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180420 Termination date: 20200115 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |