By Topic

A 3-D Markov Chain Queueing Model of IEEE 802.11 DCF with Finite Buffer and Load

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

3 Author(s)
R. P. Liu ; ICT Centre, CSIRO, Marsfield, NSW, Australia ; G. Sutton ; I. B. Collings

We introduce a 3-dimensional Markov chain that integrates the IEEE 802.11 DCF contention resolution and queueing processes into one model. Important QoS measures, delay and loss, plus throughput and queue length, can be obtained for a realistic systems with finite buffer under finite load. We present an efficient method for solving the steady state probabilities of the Markov chain. Simulations confirm the accuracy of our model, and demonstrate that the model provides new insights into the 802.11 DCF protocol.

Published in:

2009 IEEE International Conference on Communications

Date of Conference:

14-18 June 2009