A queuing theoretic model for IEEE 802.11 DCF using RTS/CTS

Author

Özdemir, Mustafa ; McDonald, A. Bruce

Author_Institution

Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA

fYear

2004

fDate

25-28 April 2004

Firstpage

33

Lastpage

38

Abstract

An M/MMG1/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes that vary arbitrarily among nodes contending for channel access. This is fundamentally different from the earlier works. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is the effective reduction of the normally encountered complexity by effectively restoring the independence between service times and packet inter-arrivals.

Keywords

Markov processes; ad hoc networks; computational complexity; probability; queueing theory; statistical analysis; telecommunication channels; telecommunication services; telecommunication traffic; wireless LAN; IEEE 802.11 DCF; Markov arrivals; RTS-CTS; ad hoc networks; channel access; collision probabilities; computational complexity; contention window sizes; multihop scenarios; network traffic; packet interarrivals; queuing theoretic model; statistical analysis; transmission probabilities; Ad hoc networks; Performance analysis; Probability; Queueing analysis; Spread spectrum communication; Statistical analysis; Steady-state; Telecommunication traffic; Traffic control; Wireless LAN;

fLanguage

English

Publisher

ieee

Conference_Titel

Local and Metropolitan Area Networks, 2004. LANMAN 2004. The 13th IEEE Workshop on

Print_ISBN

0-7803-8551-9

Type

conf

DOI

10.1109/LANMAN.2004.1338396

Filename

1338396