Spatial fairness in linear random-access networks

Authors:
P. M. van de Ven;J. S. H. van Leeuwaarden;D. Denteneer;A. J. E. M. Janssen
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computer Science, Eindhoven, The Netherlands and EURANDOM, Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, Eindhoven, The Netherlands and EURANDOM, Eindhoven, The Netherlands;Philips Research Europe, Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Electrical Engineering, Eindhoven, The Netherlands and EURANDOM, Eindhoven, The Netherlands
Venue:
Performance Evaluation
Year:
2012

Citing 11
Cited 3

Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Spatial fairness in wireless multi-access networks

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Self-organization properties of CSMA/CA systems and their consequences on fairness

IEEE Transactions on Information Theory
Optimal tradeoff between exposed and hidden nodes in large wireless networks

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Equalizing throughputs in random-access networks

ACM SIGMETRICS Performance Evaluation Review
Distributed random access algorithm: scheduling and congestion control

IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Blocking probability and channel assignment in wireless networks

IEEE Transactions on Wireless Communications
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?

IEEE Communications Magazine
The Asymptotic Analysis of Some Packet Radio Networks

IEEE Journal on Selected Areas in Communications
IEEE 802.11s: WLAN mesh standardization and high performance extensions

IEEE Network: The Magazine of Global Internetworking

Comparing slotted and continuous CSMA: throughputs and fairness

ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Achieving target throughputs in random-access networks

Performance Evaluation
Balancing lifetime and classification accuracy of wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive consistently higher throughput than others. Recent studies show that this unfairness is due to local differences in the neighborhood structure: nodes with fewer neighbors receive better access. We study the unfairness in saturated linear networks, and adapt the random-access CSMA protocol to remove the unfairness completely, by choosing the activation rates of nodes as a specific function of the number of neighbors. We then investigate the consequences of this choice of activation rates on the network-average saturated throughput, and we show that these rates perform well in non-saturated settings.