Random multi-access algorithms in networks with partial interaction: a mean field analysis

Authors:
Charles Bordenave;David McDonald;Alexandre Proutiere
Affiliations:
University of California, Berkeley;University of Ottawa, Canada;KTH, the Royal Institute of Technology, Sweden
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 3
Cited 0

Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network with a fixed number of links whose transmitters are saturated and access a channel using a random back-off algorithm. Some of the links may be hidden in the sense that they do not interfere with all other links but rather with a subset of the links. Using mean field techniques, we analyze a variety of random back-off algorithms by explicit calculating the throughput of the links in such networks. We apply our results to analyze the performance of the exponential back-off algorithm in networks with partial interaction. The results are striking and confirm experimental results. Hidden transmitters that fail to sense collisions with other links unfairly grab too much bandwidth at the expense of transmitters that comply with the back-off rules. We believe the model can be used to develop new algorithms realizing an adequate trade-off between fairness and efficiency.