Impact of bursty error rates on the performance of wireless local area network (WLAN)

Abstract With an increasing popularity of DCF based wireless LAN, the modeling of 802.11 distributed coordination function (DCF) has attracted lots of research attention. Existing analysis of 802.11 DCF has been focused on the determination of the throughput and the packet delay under saturated traffic and ideal channel conditions. Although some recent papers address the saturated performance under a simple uniform error model, they can hardly capture the impact of bursty characteristics of wireless fading on the performance of 802.11 DCF. This paper presents exact formulae for the throughput and the delay in DCF for various traffic conditions when either saturated or unsaturated traffic load is present. A two-state Markov channel model is incorporated to present the bursty characteristics of channel errors. With our analysis, the impact of bursty channel error on unsuccessful transmission probability and the DCF performance can be determined. The results of our analytical framework reveal that the four-way handshaking scheme does not improve throughput substantially for light traffic load. However, for heavy traffic load, the four-way handshaking scheme is advantageous as compared to the basic access scheme. Also, extensive simulation is done to substantiate the accuracy of our analytical model.

[1]  Nitin Gupta,et al.  A Performance Analysis of the 802.11 Wireless Lan Medium Access Control , 2003, Commun. Inf. Syst..

[2]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[3]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[4]  Zoran Hadzi-Velkov,et al.  Saturation throughput - delay analysis of IEEE 802.11 DCF in fading channel , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  Yang Xiao,et al.  Saturation performance metrics of the IEEE 802.11 MAC , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[6]  Leonard Kleinrock,et al.  Throughput Analysis for Persistent CSMA Systems , 1985, IEEE Trans. Commun..

[7]  Kee Chaing Chua,et al.  A Capacity Analysis for the IEEE 802.11 MAC Protocol , 2001, Wirel. Networks.

[8]  Ashok K. Agrawala,et al.  Packet error model for the IEEE 802.11 MAC protocol , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[9]  Sunghyun Choi,et al.  Goodput enhancement of IEEE 802.11a wireless LAN via link adaptation , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[10]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[11]  Zongkai Yang,et al.  Performance evaluation of distributed access scheme in error-prone channel , 2002, 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings..

[12]  John G. Proakis,et al.  Digital Communications , 1983 .

[13]  Dharma P. Agrawal,et al.  Optimal packet size in error-prone channel for IEEE 802.11 distributed coordination function , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[14]  Haitao Wu,et al.  Performance of reliable transport protocol over IEEE 802.11 wireless LAN: analysis and enhancement , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Vladimir M. Vishnevsky,et al.  1 LANs: Saturation Throughput in the Presence of Noise , 2002, NETWORKING.

[16]  Fouad A. Tobagi,et al.  Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access , 1982, JACM.

[17]  Dharma P. Agrawal,et al.  Introduction to Wireless and Mobile Systems , 2002 .

[18]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[19]  Shang Zhi,et al.  A proof of the queueing formula: L=λW , 2001 .