Performance analysis of Markov modulated 1-persistent CSMA/CA protocols with exponential backoff scheduling

Authors:
Pui King Wong;Dongjie Yin;Tony T. Lee
Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, Sha Tin, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Sha Tin, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Sha Tin, Hong Kong and Department of Electronics Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
Wireless Networks
Year:
2011

Citing 8
Cited 0

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Stability of binary exponential backoff

Journal of the ACM (JACM)
Multiple access protocols: performance and analysis

Multiple access protocols: performance and analysis
Switching and Traffic Theory for Integrated Broadband Networks

Switching and Traffic Theory for Integrated Broadband Networks
Performance analysis of exponential backoff

IEEE/ACM Transactions on Networking (TON)
Throughput analysis and admission control for IEEE 802.11a

Mobile Networks and Applications
Modeling the 802.11 distributed coordination function in nonsaturated heterogeneous conditions

IEEE/ACM Transactions on Networking (TON)
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

This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with K-Exponential backoff scheduling algorithm. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of each individual head-of-line packet is derived from the Markov chain of the underlying scheduling algorithm. From the queueing model, we derive the characteristic equation of network throughput and obtain the stable throughput and bounded delay regions with respect to the retransmission factor. Our results show that the stable throughput region of the exponential backoff scheme exists even for an infinite population. Moreover, we find that the bounded delay region of exponential backoff is only a sub-set of its stable throughput region due to the large variance of the service time of input packets caused by the capture effect. All analytical results presented in this paper are verified by simulations.