DocumentCode :
460625
Title :
A Novel Fair Scheduling Scheme Based on Dynamic AIFS in 802.11 Wireless LANs
Author :
Zhijiang, Xu ; Limin, Meng
Author_Institution :
Coll. of Inf. Eng., Zhejiang Univ. of Technol., Hangzhou
Volume :
3
fYear :
2006
fDate :
25-28 June 2006
Firstpage :
1754
Lastpage :
1757
Abstract :
The aim of quality of service (QoS) mechanisms in IEEE 802.11 wireless LANs allows each flow passing through a network device to have a fair share of network resources to prevent starvation. In this paper, we propose a new fair scheduling scheme based on arbitration interframe space (AIFS) with the extension of distributed deficit round-Robin (DDRR) algorithm for queues of different priorities. The main idea presented is to increase or decrease the AIFS depending on the ratio between available (by estimated) and desired traffic, such that service differentiation is realized. It can further remove the unfair bandwidth allocation between high and low priority traffic as well as the jitter of throughput and delay proved by simulations, which also demonstrate the advantage of low complexity and easy implementation
Keywords :
bandwidth allocation; distributed algorithms; quality of service; queueing theory; scheduling; telecommunication traffic; wireless LAN; 802.11 wireless LAN; AIFS; DDRR; QoS; bandwidth allocation; distributed deficit round-Robin algorithm; dynamic arbitration interframe space; jitter; network device; network resources; priority queue; priority traffic; quality of service; scheduling scheme; Channel allocation; Delay; Dynamic scheduling; Jitter; Quality of service; Round robin; Scheduling algorithm; Throughput; Traffic control; Wireless LAN;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Circuits and Systems Proceedings, 2006 International Conference on
Conference_Location :
Guilin
Print_ISBN :
0-7803-9584-0
Electronic_ISBN :
0-7803-9585-9
Type :
conf
DOI :
10.1109/ICCCAS.2006.285013
Filename :
4064239
Link To Document :
بازگشت