By Topic

A queuing theoretic model of ad hoc wireless LANs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Ozdemir ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA ; A. B. McDonald

In this paper, two Markov chain queuing models have been developed to obtain closed-form solutions for packet delay and packet throughput distributions in a real-time wireless communication environment using IEEE 802.11 DCF. An M/G/1/K queuing model is incorporated in both models. In the first model results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes vary arbitrarily among nodes contending for channel access. In the second model, however, the contention condition is limited by the assumption that collision probabilities remain constant among contending nodes. Results are presented for the fully-connected case. Two models are compared and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the sensitivity analysis.

Published in:

WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.  (Volume:3 )

Date of Conference:

22-24 Aug. 2005