Designing a Distributed Fair Scheduling Algorithm in a Wireless Medium

Please enable javascript in your browser.

Raeis, Majid | 2014

1722 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 46365 (05)
University: Sharif University of Technology
Department: Electrical Engineering
Advisor(s): Golestani, Jamaloddin
Abstract:
Fair allocation of bandwidth between stations of a shared medium, is an important and challenging problem. It is even more challenging when there is no coordinator to arbitrate access to the medium and therefore, a distributed algorithm is needed to provide fairness. IEEE 802.11 DCF is the dominant distributed medium access control (MAC) protocol in a wireless LAN. However, DCF is not in general fair and suffers from short-term unfairness. In addition to that, it is desired to provide differentiated service for the stations of a LAN based on their demands. Since priority based protocols may lead to starvation of the low priority traffic, we are more interested in fair queuing. On the other hand, there is an intrinsic trade off between fairness and throughput of a shared medium. This Thesis proposes a new algorithm based on IEEE 802.11 DCF, providing fair queuing and high throughput performance at the same time. Furthermore, the proposed distributed algorithm emulates SCFQ so closely such that the maximum normalized service disparity among any pair of backlogged flows is always bounded
Keywords:
Wireless Local Area Network ; Justice ; Throughput ; Institiute Electrical and Electronic Engineers (IEEE)802.11 Standard ; Media Access Control Protocol