Random access in wireless networks: how much aggressiveness can cause instability?

Authors:
Javad Ghaderi;Sem Borst;Phil Whiting
Affiliations:
University of Illinois, Urbana-Champaign;Alcatel-Lucent Bell Labs, Murray Hill;Alcatel-Lucent Bell Labs, Murray Hill
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2014

Citing 6
Cited 0

Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay optimal queue-based CSMA

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
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)
Backlog-based random access in wireless networks: fluid limits and delay issues

Proceedings of the 23rd International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random access schemes are simple and inherently distributed, yet capable of matching the optimal throughput performance of centralized scheduling algorithms. The throughput optimality however has been established for activation rules that are relatively sluggish, and may yield excessive queues and delays. More aggressive/persistent access schemes have the potential to improve the delay performance, but it is not clear if they can offer any universal throughput optimality guarantees. In this paper, we identify a limit on the aggressiveness of nodes, beyond which instability is bound to occur in a broad class of networks.