A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load

Ren P. Liu; Gordon Sutton; Iain B. Collings

doi:10.1109/ICC.2009.5198576

A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load

Ren P. Liu, Gordon Sutton, Iain B. Collings

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

11 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	IEEE International Conference on Communications, ICC 2009
Subtitle of host publication	Proceedings
Place of Publication	Pistacaway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1-5
Number of pages	5
ISBN (Print)	9781424434350
DOIs	https://doi.org/10.1109/ICC.2009.5198576
Publication status	Published - 2009
Externally published	Yes
Event	2009 IEEE International Conference on Communications, ICC - 2009 - Dresden, Germany Duration: 14 Jun 2009 → 18 Jun 2009

Other

Other	2009 IEEE International Conference on Communications, ICC - 2009
Country/Territory	Germany
City	Dresden
Period	14/06/09 → 18/06/09

Access to Document

10.1109/ICC.2009.5198576

Cite this

@inproceedings{3140e277bf5b4ab28f192c45d229e178,

title = "A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load",

abstract = "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.",

author = "Liu, {Ren P.} and Gordon Sutton and Collings, {Iain B.}",

year = "2009",

doi = "10.1109/ICC.2009.5198576",

language = "English",

isbn = "9781424434350",

pages = "1--5",

booktitle = "IEEE International Conference on Communications, ICC 2009",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2009 IEEE International Conference on Communications, ICC - 2009 ; Conference date: 14-06-2009 Through 18-06-2009",

}

Liu, RP, Sutton, G & Collings, IB 2009, A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load. in IEEE International Conference on Communications, ICC 2009: Proceedings., 5198576, Institute of Electrical and Electronics Engineers (IEEE), Pistacaway, NJ, pp. 1-5, 2009 IEEE International Conference on Communications, ICC - 2009, Dresden, Germany, 14/06/09. https://doi.org/10.1109/ICC.2009.5198576

A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load. / Liu, Ren P.; Sutton, Gordon; Collings, Iain B.
IEEE International Conference on Communications, ICC 2009: Proceedings. Pistacaway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2009. p. 1-5 5198576.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load

AU - Liu, Ren P.

AU - Sutton, Gordon

AU - Collings, Iain B.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449494115&partnerID=8YFLogxK

U2 - 10.1109/ICC.2009.5198576

DO - 10.1109/ICC.2009.5198576

M3 - Conference proceeding contribution

AN - SCOPUS:70449494115

SN - 9781424434350

SP - 1

EP - 5

BT - IEEE International Conference on Communications, ICC 2009

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Pistacaway, NJ

T2 - 2009 IEEE International Conference on Communications, ICC - 2009

Y2 - 14 June 2009 through 18 June 2009

ER -

A 3-D Markov Chain queueing model of IEEE 802.11 DCF with finite buffer and load

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this