Scalable max-min fairness in wireless ad hoc networks

Authors:
Congzhou Zhou;N. F. Maxemchuk
Affiliations:
Department of Electrical Engineering, Columbia University, NY, United States;Department of Electrical Engineering, Columbia University, NY, United States and IMDEA Networks, Madrid, Spain
Venue:
Ad Hoc Networks
Year:
2011

Citing 12
Cited 2

Data networks

Data networks
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Determining Intra-Flow Contention along Multihop Paths in Wireless Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Contention-Aware Admission Control for Ad Hoc Networks

IEEE Transactions on Mobile Computing
Simple Robotic Routing in Ad Hoc Networks

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
A Macro model of frequently changing mobile networks to perform flow and access control

Mobile Networks and Applications
Applying a Macro Model of Ad Hoc Networks to Access Control

ICN '08 Proceedings of the Seventh International Conference on Networking
Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial

IEEE Communications Surveys & Tutorials
The capacity of wireless networks

IEEE Transactions on Information Theory
Maxmin fair scheduling in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Stabilization of max-min fair networks without per-flow state

Theoretical Computer Science
Scheduling packets over multiple interfaces while respecting user preferences

Proceedings of the ninth ACM conference on Emerging networking experiments and technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our previous work proposes a macro model to perform flow and access control in wireless ad hoc networks. In this paper, we demonstrate specifically how to apply the model to achieve max-min fair rate allocation. Our proposed scheme is simple and scalable when comparing to other techniques in the literature. Moreover, it has the ability to provide stability in mobile environment. Simulation results show that our new method provides a good max-min fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications.