A new localized approach to distributed fair scheduling in multihop wireless networks

Thumbnail Image
Date
2001
Authors
Zhou, Jianwei
Major Professor
Advisor
Somani, Arun K.
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Research Projects
Organizational Units
Journal Issue
Is Version Of
Versions
Series
Department
Abstract
Fairness is an important design criteria for medium access control protocol in multi-hop wireless networks. Fairness is a complex problem due to its many dimensions that include consideration of location-dependent contention, spatial reuse of channels, and desire to achieve fully distributed scheduling in the wireless communication systems. This thesis presents a localized and fully distributed algorithm with fair scheduling in multihop wireless networks. The proposed algorithm incorporates start time fair queuing (STFQ) into the Distributed Coordination Function (DCF) in IEEE 802.11. Our algorithm accounts for the services, that have already been received by the sender, to adjust the backoff timer, so that every flow can get fair service. We propose a simple data structure that every node (both sender and receiver) needs to maintain and updating mechanism to achieve the desired fairness in operation. Simulation results show that the proposed algorithm demonstrates performance improvement in terms of fairness. We also show that earlier proposals may not achieve fairness in many situations.
Comments
Description
Keywords
Citation
DOI
Source
Copyright