Maxmin fair scheduling in wireless ad hoc networks

Authors:
L. Tassiulas;S. Sarkar
Affiliations:
Comput. Eng. & Telecommun. Dept., Univ. of Thessaly, Volos, Greece;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 13

Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
On scheduling and clustering in hierarchical TH-PPM UWB wireless ad hoc networks

The Journal of Supercomputing
Fair End-to-End Session Rates in Multihop Wireless Networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Service index-based fairness scheduling in wireless ad hoc networks

Computer Communications
Existence and uniqueness of fair rate allocations in lossy wireless networks

IEEE Transactions on Wireless Communications
Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

The Journal of Supercomputing
Scalable max-min fairness in wireless ad hoc networks

Ad Hoc Networks
Traffic-sensitive S-TDMA schedule based on traffic load estimate for maintenance self-organized radio wireless network

ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
Making sensornet MAC protocols robust against interference

EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Weighted flow contention graph and its applications in wireless ad hoc networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Design a novel fairness model in WiMAX mesh networks

Computer Communications
Fair packet scheduling in Wireless Mesh Networks

Ad Hoc Networks

Quantified Score

Hi-index	0.07

Visualization

Abstract

We investigate from an algorithmic perspective the maxmin fair allocation of bandwidth in wireless ad hoc networks. We formalize the maxmin fair objective under wireless scheduling constraints, and present a necessary and sufficient condition for maxmin fairness of a bandwidth allocation. We propose an algorithm that assigns weights to the sessions dynamically such that the weights depend on the congestion in the neighborhood, and schedules the sessions that constitute a maximum weighted matching. We prove that this algorithm attains the maxmin fair rates, even though it does not use any information about the statistics of the packet arrival process.