By Topic

Achieving fairness in distributed scheduling in wireless ad-hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. K. Somani ; Dept. of Electr. Eng. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Jianwei Zhou

Fairness is an important design criterion for medium access control protocol in multihop wireless networks. It 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 paper 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 to ensure that every flow gets a fair service. We propose a simple data structure that every node (sender or receiver) needs to maintain and an update mechanism that achieves fairness. We illustrate through simulations that the proposed algorithm achieves the desired fairness.

Published in:

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

Date of Conference:

9-11 April 2003