Abstract
A Fair Scheduling policy is required to support differentiated QoS requirements of contending flows in a wireless channel. This thesis presents a study of the Distributed Fair Scheduling (DFS) algorithm proposed for wireless Local Area Networks. The thesis evaluates DFS protocol and studies the unfairness in IEEE 802.11 standard. The wireless channel capacity varies with time and location due to the presence of location-dependent wireless errors. Therefore, the error-free scheduling specification is not sufficient for fair allocation of channel capacity amongst contending flows in an error-prone wireless channel. This thesis borrows the idea of dynamic weight adjustment from prior work and applies it in the Distributed Fair Scheduling algorithm to provide long-term fairness in the presence of wireless errors.
Gupta, Seema (2000). Study of distributed Fair Scheduling in wireless local area networks. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -2000 -THESIS -G866.