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

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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Computer Engineering

Year dc:date.issued

2001

Author dc:creator

• Zhou, Jianwei

Advisor dc:contributor.advisor

• Somani, Arun K.

Language dc:language.iso

en

Repository record dc:identifier.uri

https://dr.lib.iastate.edu/handle/20.500.12876/jrl8x3Yr

OAI identifier oai:identifier

oai:dr.lib.iastate.edu:20.500.12876/jrl8x3Yr