Symmetrical Fairness in Infrastructure Access in Multi-hop Wireless Networks

Authors:
Saumitra M. Das;Himabindu Pucha;Y. Charlie Hu
Affiliations:
Purdue University;Purdue University;Purdue University
Venue:
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Year:
2005

Citing 0
Cited 2

Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks

Ad Hoc Networks
An interference-aware fair scheduling for multicast in wireless mesh networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of providing fairness in multi-hop wireless infrastructure access. In such networks, it is well known that the use of current media access and transport protocols can result in severe unfairness and even starvation for flows originated from different numbers of hops away from a wired infrastructure point or gateway. In this paper, we study a different type of fairness that exists in such networks 驴 flows initiated by nodes that are similar numbers of hops away from the gateway can experience significant unfairness, and such unfairness exists even for perfectly symmetrical node distribution and channel conditions. We denote such fairness as symmetrical fairness. We first provide a framework to characterize and measure symmetrical fairness. We then perform an extensive set of simulation experiments to quantify the causes of symmetrical unfairness. Finally, we develop and study a distributed routing algorithm that significantly improves the symmetrical fairness.