Link adaptation is a critical component of IEEE 802.11 systems. In this paper, we analytically model a retransmission based Auto Rate Fallback (ARF) link adaptation algorithm. Both packet collisions and packet corruptions are modeled with the algorithm. The models can provide insights into the dynamics of the link adaptation algorithms and configuration of algorithms parameters. It is also observed that when the competing number of stations is high, packet collisions can largely affected the performance of ARF and make ARF operate with the lowest date rate, even when no packet corruption occur. This is in contrast to the existing assumption that packet collision will not affect the correct operation of ARF and can be ignored in the evaluation of ARF. The work presented in this paper can provide guidelines on configuring the link adaptation algorithms and designing new link adaptation algorithms for future high speed 802.11 systems.
|Translated title of the contribution||Modeling link adaptation algorithm for IEEE 802.11 wireless LAN networks|
|Title of host publication||3rd International Symposium on Wireless Communication Systems, 2006 (ISWCS '06), Valencia|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||500 - 504|
|Number of pages||4|
|Publication status||Published - 6 Sep 2006|
|Event||3rd International Symposium on Wireless Communication Systems - Valencia, Spain|
Duration: 6 Sep 2006 → …
|Conference||3rd International Symposium on Wireless Communication Systems|
|Period||6/09/06 → …|
Bibliographical noteConference Proceedings/Title of Journal: 3rd International Symposium on Wireless Communication Systems, 2006 (ISWCS '06)
Rose publication type: Conference contribution
Sponsorship: The work reported in this paper is part of the OSIRIS project within the 3C Research programme on convergent technology for digital media processing and communications, whose funding and support is gratefully acknowledged.
- wireless LAN networks