CN105873233A - IEEE802.11ax access enhancement method based on hierarchical scheduling - Google Patents
IEEE802.11ax access enhancement method based on hierarchical scheduling Download PDFInfo
- Publication number
- CN105873233A CN105873233A CN201610187164.9A CN201610187164A CN105873233A CN 105873233 A CN105873233 A CN 105873233A CN 201610187164 A CN201610187164 A CN 201610187164A CN 105873233 A CN105873233 A CN 105873233A
- Authority
- CN
- China
- Prior art keywords
- packet
- data
- queue
- access
- data service
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
Abstract
The invention discloses an IEEE802.11ax access enhancement method based on hierarchical scheduling. The method mainly solves the problem that the data waiting time is too long in the access mechanism scheduling in the prior art; the technical scheme is as follows: firstly dividing the data received by an access point into queues according to service types; and then dividing each data service queue into n sub-queues according to the size of the data packet, and using the highest response ratio priority algorithm to perform the first-level scheduling; using the output queue obtained through the first-level scheduling as a new data service queue, and then using carrier sense multi-path access and conflict avoidance access mechanism CSMA/CA to perform the second-level scheduling on the new data service queue; and finally transmitting the data through the second-level scheduling to one or more users. Through the adoption of the method disclosed by the invention, the system throughput is improved, the waiting time of the data packet is reduced, and multi-user can share the data information received from a network layer.
Description
Technical field
The invention belongs to communication technical field, further relate to a kind of IEEE 802.11ax based on layering scheduling and access Enhancement Method, can be used for multiple user and share the data message received from Internet.
Background technology
In order to effectively communicate under conditions of sharing resource multiple users, it is desirable to certain mechanism determines the right to use of resource, here it is multiple access access mechanism.Access mechanism can use traditional time division multiple acess, frequency division multiple access, CDMA, space division multiple access access way.Owing to channel resource is excessively wasted by fixing access way, IEEE802.11 uses Random Access more, Carrier Sense Multiple Access mode based on conflict avoidance and by the access way of access point AP centralized dispatching.Along with the development of wireless network, how to combine high density, the feature of rapidity, the radio switch-in method finding a kind of IEEE of being applicable to 802.11ax is a technical problem urgently to be resolved hurrily.
The patented technology " a kind of multipriority queue dispatching method based on probability " (Authorization Notice No. CN 102098217 B, application number 201110008627.8) that China Science & Technology University has discloses a kind of multipriority queue dispatching method based on probability.The method uses multiple logics or physical queue to realize multipriority, by checking whether queue is empty queue, non-empty queue is used probability generator stochastic generation probability function value, the queuing data at probability function value place is grouped and is scheduling by scheduler, achieving the fairness of scheduling, for empty queue, scheduler is first by the probability interval value dispensing non-empty queue of empty queue, it is scheduling the most again, it is achieved that bandwidth is used.But the method has carried out queue division only according to priority, do not account for the impact of packet length degree of exchanging time in same priority queue, the process employs probability generator and scheduler simultaneously, it is achieved be complicated.
Yin Debin, paper " a kind of new Weighted Fair Queuing algorithm " (computer engineering that Xie Jianying delivers at it, 2008,34 (4): 28-30) a kind of new Weighted Fair Queuing algorithm is proposed in, service probability and random number is used to realize weighted-fair scheduling, the weight parameter solving packet in conventional weight fair-queueing dispatching algorithm and weighted round-robin dispatching algorithm calculates complicated problem, uses self adaptation service probability to calculate simultaneously and solves the unjustness that the elongated degree of packet brings.The method calculates the average length of queue initially with event triggered fashion, then packet average length estimated value is used to carry out service probability calculating, greatly simplifie the calculating of service probability function, the weight of different business stream is embodied by service probability function, realize Weighted Service, thus avoid the problem needing each Business Stream weight of following calculation to change in most of weighted queue dispatching algorithm, but the method is not segmented queue, does not accounts for the problem that long data bag continuous transmission causes short packages to wait as long for.
Li Wenjie, paper " the short packets first dispatching algorithm of preemptive type in the input queue " (electronic letters, vol that Liu Bin delivers at it, 2005,33 (4): 577-583) by Internet service feature is analyzed in, devise a kind of low complex degree preemptive type switching fabric, and propose corresponding preemptive short packets first scheduling algorithm, solve long bag cell continuously transmits the problem causing short bag to wait as long for.The method is according to the feature of the short-and-medium bag of Internet: quantity is many but arrival rate is low, short bag is cached in an independent First Come First Served queue by dispatching algorithm, then short bag is preferentially transmitted by the long bag transmission of interruption, reduce averagely wrapping the waiting time of all bags, improve throughput of system, but the method does not accounts for the problem that short packages continuous transmission causes long data bag to wait as long for.
Summary of the invention
It is an object of the invention to overcome above-mentioned the deficiencies in the prior art, propose a kind of IEEE 802.11ax based on layering scheduling and access Enhancement Method, to reduce packet access delay, it is ensured that the fairness that packet accesses, improve access performance.
The thinking of the present invention is: on the basis of classifying based on data service, take into full account that packet is accessed the impact of channel by the length of packet, according to packet length, data service queue carried out secondary queue division, and the method using layering scheduling, use the highest response ratio priority algorithm to carry out schedule level one, calculate and analyze the fairness index of dispatching algorithm；In the other second-level dispatching of classes of data traffic, using contention access mode based on carrier sense, second-level dispatching mode is effectively improved the performance of access mechanism.Its implementation is as follows:
(1) initiate channel access: each access point AP, the network layer interface bag that will receive, classify by class of data traffic；
(2) tail mode is lost in the packet classified by class of service employing and form data service queue；
(3) each data service queue is divided into n unit's row according to the size of packet；
(4) n unit's row in each data service queue are carried out schedule level one:
(4a) first packet the recorded data packets length of each unit row are read；
(4b) use shannon formula, calculate transfer rate R of packet；
(4c) the transmission time of calculating kth packet:Wherein, L (k) represents kth data packet length；
(4d) waiting time of kth packet: T is calculatedw(k)=n*T1, wherein, n represents the packet number accessed, T1Represent the time that one packet of transmission needs to wait for, T1=T (AIFS)+T (ACK), wherein, T (AIFS) represents arbitration frame interval, and T (ACK) represents acknowledgement frame interval；
(4e) the access response ratio of kth packet in calculating i-th unit row:Wherein, TtK () represents the transmission time of kth packet, TwK () represents the waiting time of kth packet；
(4f) create an empty elongated queue and access response ratio p as output queue, comparison each unit rowiK the packet accessing response ratio maximum is also moved on to elongated queue by ()；
(4g) judge that each unit arranges whether non-NULL, if so, return step (4a), otherwise, using the output queue in step (4f) as new data service queue；
(5) use Carrier Sense Multiple Access and conflict avoidance access mechanism CSMA/CA, the new data service queue obtained is carried out second-level dispatching；
(6) channel access is terminated: the data through second-level dispatching are transferred to one or several user.
The present invention compared with prior art, has the advantage that
First, owing to each data service queue is carried out queue division according to packet length by the present invention, overcome and prior art does not accounts for the short bag inequitable problem of access, make present invention time delay when accessing channel lower, improve the fairness of packet and reduce the network delay of packet.
Second, the present invention is considering that short bag accesses on the premise of unfairness, consider the impact that packet accesses by the long bag waiting time, it is to avoid cause has short packages access to cause long data bag hunger problem always, it is effectively increased the fairness that long short packages is total, reduces network delay.
Accompanying drawing explanation
Fig. 1 is the use scene graph of the present invention.
Fig. 2 is the flowchart of the present invention.
Fig. 3 is the schematic diagram that unit's row carry out in the present invention schedule level one.
Fig. 4 is the schematic diagram that data service queue carries out in the present invention second-level dispatching.
Detailed description of the invention
Below in conjunction with accompanying drawing and example, the present invention is described in further detail；
With reference to Fig. 1, in radio communication scene, have many Location-Unknowns, random distribution and the node that can move, these nodes realize the access of wireless network by wireless access point AP.Wireless access point AP is the central point of WLAN, and it can be a stationary nodes, it is also possible to be a mobile node.Wireless access point AP is that the node being in its node-node transmission radius R sends data message, and wherein, data message includes voice messaging, video information, best-effort traffic information and background service data message.
With reference to Fig. 2, it is as follows that the present invention is embodied as step:
Step 1, initiates channel access.
Each access point AP, the network layer interface bag that MAC data operation layer is received, classify by class of data traffic, data service will be divided into voice, video, do one's best and Batch Processing these four classification；
The priority of described four kinds of data service access categories is spaced AIFS, send opportunity restricted T XOP, minimum competition window CW by parameter arbitration framemin, maximum contention window CWmaxDetermine.
Arbitration frame interval AIFS, refers to detect the fixing time slot that channel is the most idle, and AIFS=AIFSN*aSlotTime+aSIFSTime, wherein, AIFSN represents that arbitration interframe spacing number, aSlotTime represent the time of a time slot, and aSIFSTime represents a short frame period.Can arrange different idle waiting durations for different pieces of information business, AIFS numerical value is the biggest, and the idle waiting time of user is the longest, and the waiting time is the shortest, and the priority accessing channel is the highest.
Send opportunity restricted T XOP, definition once sends the greatest length of data, after referring to that user once competes successfully, can the maximum duration of busy channel.Its numerical value is the biggest, user once can the duration of busy channel the biggest, if 0, then can only send a data message after busy channel every time, if a frame causes the most greatly to be sent in a TXOP, then must burst.
Minimum competition window CWmin, refer to the least random number that can select when website is kept out of the way.
Maximum contention window CWmax, refer to the largest random number that can select when website is kept out of the way.
Minimum competition window CWminWith maximum contention window CWmaxDetermining average backing off time value, the two numerical value is the biggest, and the average backing off time of user is the longest, and access priority is the lowest.
Step 2, loses tail mode by the packet classified by class of service employing and forms data service queue.
Lose tail mode refer to when receive data packet length beyond queue can be data cached length time, then lose the packet beyond queue length.
Step 3, is divided into n unit's row by each data service queue according to the size of packet.
Each class of data traffic is divided into n queue, it is assumed that wherein queue 1 represents that data packet size is less than 100 bytes, queue 2 represent data packet size between 100～2000 bytes, queue n represents that data packet size is more than 10000 bytes.
Step 4, carries out schedule level one to n queue in each data service queue.
Reference Fig. 3, being implemented as follows of this step:
(4a) dispatch n unit's row in each data service queue, read first packet of each unit row；
(4b) judge that unit arranges whether non-NULL, if so, perform step (4c), otherwise, do not choose the packet in this unit row；
(4c) the following parameter of first packet is calculated:
(4c1) shannon formula is used, transfer rate R of calculating packet:Wherein, R represents the transfer rate of packet, and W represents the transmission bandwidth of packet, and lg () represents denary logarithm computing, and P represents that data transmission utilization measure, N represent channel noise power；
(4c2) the transmission time of calculating packet:Wherein, L represents data packet length；
(4c3) waiting time of packet: T is calculatedw=n*T1, wherein, n represents the packet number accessed, T1Represent the time that one packet of transmission needs to wait for, T1=T (AIFS)+T (ACK), wherein, T (AIFS) represents arbitration frame interval, and T (ACK) represents acknowledgement frame interval；
(4c4) the access response ratio of calculating packet:
(4d) create an empty elongated queue and access response ratio p as output queue, comparison each unit rowi, and the packet accessing response ratio maximum is moved on to elongated queue；
(4e) judge that each unit arranges whether non-NULL, if so, return step (4a), otherwise, using the output queue in step (4f) as new data service queue；
Step 5, uses Carrier Sense Multiple Access and conflict avoidance access mechanism CSMA/CA, the new data service queue obtained is carried out second-level dispatching.
Reference Fig. 4, being implemented as follows of this step:
(5a) four data service queue in scheduling AP, it is judged that each data service queue detection channel is the most idle, if so, perform step (5b), otherwise, proceed detection, until channel idle；
(5b) each data service queue waits an anchor-frame interval AIFS, and select a random number in competition window, after prolong random back time and access channel, if two or more data service queue terminate the random back time simultaneously, then by high-priority data service access channel, and double the competition window of lower-priority data service queue, so that it competes channel access next time.
Step 6, terminates channel access: the data through second-level dispatching are transferred to one or several user.
Above description is only example of the present invention; the most for those skilled in the art; after having understood present invention and principle; all may be in the case of without departing substantially from inventive principle of the present invention, structure; carry out the various corrections in form and details and change, but these corrections based on inventive concept and change are still within the claims of the present invention.
Claims (5)
1. IEEE 802.11ax based on layering scheduling accesses Enhancement Method, and its step includes the following:
(1) channel access is initiated: each access point AP, the network layer interface bag that will receive, by class of data traffic
Classify；
(2) tail mode is lost in the packet classified by class of service employing and form data service queue；
(3) each data service queue is divided into n unit's row according to the size of packet；
(4) n unit's row in each data service queue are carried out schedule level one:
(4a) first packet the recorded data packets length of each unit row are read；
(4b) use shannon formula, calculate transfer rate R of packet；
(4c) the transmission time of calculating kth packet:Wherein, L (k) represents that kth data are divided
Group length；
(4d) waiting time of kth packet: T is calculatedw(k)=n*T1, wherein, n represents that the data accessed are divided
Group number, T1Represent the time that one packet of transmission needs to wait for, T1=T (AIFS)+T (ACK), wherein, T (AIFS)
Representing arbitration frame interval, T (ACK) represents acknowledgement frame interval；
(4e) the access response ratio of kth packet in calculating i-th unit row:Wherein,
TtK () represents the transmission time of kth packet, TwK () represents the waiting time of kth packet；
(4f) create an empty elongated queue and access response ratio p as output queue, comparison each unit rowiK () also will connect
The packet entering response ratio maximum moves on to elongated queue；
(4g) judge that each unit arranges whether non-NULL, if so, return step (4a), otherwise, by step (4f)
Output queue is as new data service queue；
(5) Carrier Sense Multiple Access and conflict avoidance access mechanism CSMA/CA are used, to the new data obtained
Service queue carries out second-level dispatching；
(6) channel access is terminated: the data through second-level dispatching are transferred to one or several user.
IEEE 802.11ax based on layering scheduling the most according to claim 1 accesses Enhancement Method, it is characterised in that
Class of data traffic described in step (1) includes: speech business, video traffic, Best-Effort service and Batch Processing,
The priority of these business arranges from high to low.
IEEE 802.11ax based on layering scheduling the most according to claim 1 accesses Enhancement Method, it is characterised in that
Lose tail mode described in step (2), refer to when the data packet length received can be data cached beyond queue length
Time, then lose the packet beyond queue length.
IEEE 802.11ax based on layering scheduling the most according to claim 1 accesses Enhancement Method, it is characterised in that
Shannon formula described in step (4b) is as follows:
Wherein, R represents the transfer rate of packet, and W represents that the transmission bandwidth of packet, lg () expression with 10 are
The logarithm operation at the end, P represents that data transmission utilization measure, N represent channel noise power.
IEEE 802.11ax based on layering scheduling the most according to claim 1 accesses Enhancement Method, and its feature exists
In, step (6) use Carrier Sense Multiple Access and conflict avoidance access mechanism CSMA/CA to new data industry
Business queue carries out second-level dispatching, carries out as follows:
(6a) each data service queue detection channel is the most idle, if so, performs step (6b), otherwise, continue into
Row detection, until channel idle；
(6b) each data service queue waits an anchor-frame interval AIFS, and selects in competition window random
Number, after prolong random back time and access channel, if two or more data service queue terminates random back simultaneously
Time, then by high-priority data service access channel, and the competition window of lower-priority data service queue is doubled,
So that it competes channel access next time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610187164.9A CN105873233B (en) | 2016-03-29 | 2016-03-29 | IEEE802.11ax based on layering scheduling accesses Enhancement Method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610187164.9A CN105873233B (en) | 2016-03-29 | 2016-03-29 | IEEE802.11ax based on layering scheduling accesses Enhancement Method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105873233A true CN105873233A (en) | 2016-08-17 |
| CN105873233B CN105873233B (en) | 2019-03-01 |
Family
ID=56625191
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610187164.9A Active CN105873233B (en) | 2016-03-29 | 2016-03-29 | IEEE802.11ax based on layering scheduling accesses Enhancement Method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105873233B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106550481A (en) * | 2016-09-18 | 2017-03-29 | 上海无线通信研究中心 | A kind of wireless network medium MAC layer cut-in method and system based on competition |
| CN109242228A (en) * | 2017-07-10 | 2019-01-18 | 中国科学院沈阳自动化研究所 | A kind of PBS dispatching method that rule-based classification is autonomous |
| CN109917705A (en) * | 2019-02-25 | 2019-06-21 | 弗徕威智能机器人科技（上海）有限公司 | A kind of multi-task scheduling method |
| CN110784418A (en) * | 2019-10-24 | 2020-02-11 | 烽火通信科技股份有限公司 | Data sending method and system based on time delay constraint |
| CN111328148A (en) * | 2020-03-11 | 2020-06-23 | 展讯通信（上海）有限公司 | Data transmission method and device |
| CN116244050A (en) * | 2023-02-07 | 2023-06-09 | 四川大学 | High-response-ratio-based pneumatic characteristic example scheduling method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101489306A (en) * | 2008-01-15 | 2009-07-22 | 中兴通讯股份有限公司 | Initial access method based on high speed packet access enhanced technique |
-
2016
- 2016-03-29 CN CN201610187164.9A patent/CN105873233B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101489306A (en) * | 2008-01-15 | 2009-07-22 | 中兴通讯股份有限公司 | Initial access method based on high speed packet access enhanced technique |
Non-Patent Citations (2)
| Title |
|---|
| 戴志巍: "车联网中多用户接入协议的优化方法研究", 《中国优秀硕士学位论文全文数据库》 * |
| 陈晨: "无线网络中M2M通信大容量接入研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106550481A (en) * | 2016-09-18 | 2017-03-29 | 上海无线通信研究中心 | A kind of wireless network medium MAC layer cut-in method and system based on competition |
| CN109242228A (en) * | 2017-07-10 | 2019-01-18 | 中国科学院沈阳自动化研究所 | A kind of PBS dispatching method that rule-based classification is autonomous |
| CN109917705A (en) * | 2019-02-25 | 2019-06-21 | 弗徕威智能机器人科技（上海）有限公司 | A kind of multi-task scheduling method |
| CN109917705B (en) * | 2019-02-25 | 2021-10-22 | 弗徕威智能机器人科技（上海）有限公司 | Multi-task scheduling method |
| CN110784418A (en) * | 2019-10-24 | 2020-02-11 | 烽火通信科技股份有限公司 | Data sending method and system based on time delay constraint |
| CN111328148A (en) * | 2020-03-11 | 2020-06-23 | 展讯通信（上海）有限公司 | Data transmission method and device |
| CN116244050A (en) * | 2023-02-07 | 2023-06-09 | 四川大学 | High-response-ratio-based pneumatic characteristic example scheduling method |
| CN116244050B (en) * | 2023-02-07 | 2024-01-26 | 四川大学 | High-response-ratio-based pneumatic characteristic example scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105873233B (en) | 2019-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105873233A (en) | IEEE802.11ax access enhancement method based on hierarchical scheduling | |
| CN101286949A (en) | Wireless Mesh network MAC layer resource scheduling policy based on IEEE802.16d standard | |
| Costa et al. | A TDMA-based mechanism for real-time communication in IEEE 802.11 e networks | |
| CN114641085A (en) | Self-adaptive back-off optimization method of CSMA/CA mechanism based on IEEE802.15.4 | |
| CN107613570B (en) | Service quality optimization method and system based on ZigBee network | |
| CN114301730A (en) | Gateway scheduling method for vehicle-mounted Ethernet to CAN network | |
| Kuo et al. | A CSMA-based MAC protocol for WLANs with automatic synchronization capability to provide hard quality of service guarantees | |
| Anh et al. | An enhanced MAC-layer improving to support QoS for multimedia data in wireless networks | |
| Ahmed et al. | A QoS-aware scheduling with node grouping for IEEE 802.11 ah | |
| Zhou et al. | Optimisation method of MAC protocol based on SVM neural network in VANET | |
| Cena et al. | Evaluation of real-time communication performance in QoS-enabled infrastructure WLANs | |
| Gemikonakli et al. | Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services | |
| CN108200602A (en) | Multiple access method based on Load-aware in a kind of wireless self-networking | |
| Farhana et al. | A Novel Slotted Allocation Mechanism To Provide QoS For EDCF Protocol | |
| Jun et al. | Modified backoff algorithm considering priority in IEEE 802.11 | |
| Micó et al. | QoS mechanisms for IEEE 802.11 wireless LANs | |
| Yuan et al. | Research on QoS Optimization Method of Wireless Access Network | |
| Li et al. | Performance analysis of three gated service polling scheme on wireless network | |
| George et al. | Greatest Weight Based Packet Scheduling for Retransmission and Packet Drop | |
| Nwogu et al. | Transitive Grouping for Internet of Things Support IEEE 802.11 ah using Integrated Approach | |
| Yamakata et al. | Selective OFDMA Transmission Method Based on Downlink Communication Quality Requirements in IEEE 802.11 ax Wireless LANs | |
| Zhang et al. | Performance improvements of HCCA scheduling in V2R environments | |
| Zhang et al. | Competition-free Period Interleaved Time-Slot Allocation Strategy for Data Transmission of IoT System | |
| Feng et al. | IO-MAC: A novel hybrid MAC protocol with implicit ordering in WLANs | |
| Achary et al. | Enhanced QoS by service differentiation in MAC-layer for WLAN |
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 |