Analysis of Contention Based Access for Best Effort Traffic on Fixed WiMAX

Shehan Perera; Harsha Sirisena

4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Analysis of Contention Based Access for Best Effort Traffic on Fixed WiMAX

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/BROADNETS.2007.4550482,
    author={Shehan Perera and Harsha Sirisena},
    title={Analysis of Contention Based Access for Best Effort Traffic on Fixed WiMAX},
    proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2010},
    month={5},
    keywords={IEEE802.16 Markov chain contention best effort traffic},
    doi={10.1109/BROADNETS.2007.4550482}
}

Shehan Perera
Harsha Sirisena
Year: 2010
Analysis of Contention Based Access for Best Effort Traffic on Fixed WiMAX
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2007.4550482

Shehan Perera¹^,*, Harsha Sirisena¹^,*

1: Department of Electrical & Computer Engineering, University of Canterbury, New Zealand.

*Contact email: shehan@elec.canterbury.ac.nz, sirisehr@elec.canterbury.ac.nz

Abstract

In this paper we analyze the medium access control (MAC) of fixed WiMAX with respect to best effort (BE) traffic. WiMAX employs a contention based method with exponential backoff to facilitate multiple access. A two-dimensional Markov chain can be used to accurately model the backoff procedure. From this we derived expressions for channel access probability, access delay, system throughput and resource usage. The accuracy of the model and its results are validated by simulations carried out on an IEEE 802.16d simulator. Constraints and limitations of the model are also discussed. Insight from this model can be used to optimize bandwidth usage and channel partitioning.

Keywords: IEEE802.16 Markov chain contention best effort traffic

Published: 2010-05-16
Publisher: IEEE
Modified: 2010-05-16

: http://dx.doi.org/10.1109/BROADNETS.2007.4550482