z-logo
open-access-imgOpen Access
Unified fixed‐point analysis of IEEE 802.11 WLAN under saturated and unsaturated conditions
Author(s) -
Yu Hui,
Fu Luoyi,
Xu Youyun
Publication year - 2012
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1002/wcm.998
Subject(s) - computer science , uniqueness , throughput , markov chain , fixed point , initial value problem , value (mathematics) , degree of unsaturation , point (geometry) , wireless , mathematics , telecommunications , mathematical analysis , chemistry , geometry , organic chemistry , machine learning
Most of analysis so far for IEEE 802.11 wireless local area networks (WLANs) focuses on saturated condition. However, it is of practical value to take into account the unsaturation case. In this paper, we modified Bianchi's Markov back‐off model to make it applicable to unsaturated condition and the analytic results are provided by employing the renewal‐reward theorem . Under our proposed model, we study the fixed‐point solution of the system and provide a condition to guarantee both the uniqueness and balance of the fixed point. From the fixed point, we find that under unsaturated condition, network parameters should be adjusted according to the traffic load. Then, we study the system throughput. In the case where there are a large number of nodes, we provide closed‐form formulas for the collision probability, the aggregate attempt rate, and the throughput. We find that in such a scenario, the system yields similar performance as that under saturated situation. Moreover, we compare all the results with those under saturated condition and find the latter is a special case of our results. Hence, all of our analysis based on unsaturated condition well covers saturated condition. Our analytical results are validated through ns2 simulations. Copyright © 2010 John Wiley & Sons, Ltd.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here