Sciweavers

Share
INFOCOM
2002
IEEE

Maxmin fair scheduling in wireless networks

4 years 3 months ago
Maxmin fair scheduling in wireless networks
—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possible to analytically prove that this policy attains both short term and long term fairness. We consider more generalized fairness notions, and suggest mechanisms to attain these objectives.
Leandros Tassiulas, Saswati Sarkar
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where INFOCOM
Authors Leandros Tassiulas, Saswati Sarkar
Comments (0)
books