The impact of access probabilities on the delay performance of Q-CSMA algorithms in wireless networks

Authors:
Javad Ghaderi;R. Srikant
Affiliations:
Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 13
Cited 0

Approximating the permanent

SIAM Journal on Computing
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics

Computing in Science and Engineering
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks

IEEE/ACM Transactions on Networking (TON)
Distributed throughput maximization in wireless mesh networks via pre-partitioning

IEEE/ACM Transactions on Networking (TON)
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint 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
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks

IEEE Transactions on Mobile Computing
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
Hardness of Low Delay Network Scheduling

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

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been recently shown that queue-based carrier sense multiple access (CSMA) algorithms are throughput-optimal. In these algorithms, each link of the wireless network has two parameters: a transmission probability and an access probability. The transmission probability of each link is chosen as an appropriate function of its queue length, however the access probabilities are simply regarded as some random numbers since they do not play any role in establishing the network stability. In this paper, we show that the access probabilities control the mixing time of the CSMA Markov chain and, as a result, affect the delay performance of the CSMA. In particular, we derive formulas that relate the mixing time to access probabilities and use these to develop the following guideline for choosing access probabilities: Each link i should choose its access probability equal to1/(di+1), where di is the number of links that interfere with link i. Simulation results show that this choice of access probabilities results in good delay performance.