Departmental Papers (ESE)


We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network. We design a fully distributed algorithm that combines a token generation scheme with maximal scheduling policy so as to attain maxmin fair rates within the feasible region of maximal scheduling. We next present throughput guarantees of maximal scheduling that quantify the performance loss of each session due to the use of local information based scheduling. We show that the performance loss for each session depends on the maximum “interference degree” in its neighborhood. We also demonstrate that the performance penalties can not be localized any further

Document Type

Conference Paper

Date of this Version



Suggested Citation:
Sarkar, S., P. Chaporkar, and K. Kar, "Fairness and Throughput Guarantees with Maximal Scheduling in Multi-hop Wireless Networks," Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium. pp. 1- 13, 03-06 April 2006

©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.



Date Posted: 12 October 2010