Study of distributed Fair Scheduling in wireless local area networks /
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 unfa...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2000.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | 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. |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | vii, 45 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references (leaves 442-44). |