Q-CSMA: queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

Authors:
Jian Ni;Bo Tan;R. Srikant
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, NY;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 13
Cited 4

MACAW: a media access protocol for wireless LAN's

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Network optimization and control

Foundations and Trends® in Networking
Performance of random medium access control, an asymptotic approach

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
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
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks

IEEE Transactions on Mobile Computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

IEEE/ACM Transactions on Networking (TON)
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Exploiting the past to reduce delay in CSMA scheduling: a high-order markov chain approach

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
The impact of access probabilities on the delay performance of Q-CSMA algorithms in wireless networks

IEEE/ACM Transactions on Networking (TON)
Throughput-optimal CSMA with imperfect carrier sensing

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, in general they may only achieve a fraction of the capacity region. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our results is a discrete-time distributed randomized algorithm that is based on a generalization of the so-called Glauber dynamics from statistical physics, where multiple links are allowed to update their states in a single timeslot. The algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to incorporate heuristics that lead to very good delay performance while retaining the throughput-optimality property.