By Topic

Threshold optimization for rate adaptation algorithms in IEEE 802.11 WLANs

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
$31 $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

4 Author(s)
Yang Song ; Dept. of Electr. & Comput. Eng., Univ. of Florida, Gainesville, FL, USA ; Xiaoyan Zhu ; Yuguang Fang ; Hailin Zhang

Rate adaptation algorithms play a crucial role in IEEE 802.11 WLANs. While the network performance depends greatly on the rate adaptation algorithms, the detailed implementation is left to vendors. Due to its simplicity and practicality, threshold-based rate adaptation algorithms are widely adopted in commercial IEEE 802.11 devices. Taking the popular ARF algorithm for example, the data rate is increased when ten consecutive transmissions are successful and a date rate downshift is triggered by two consecutive failed transmissions. Although widely deployed, the optimal selection of the up/down thresholds for the rate adaptation algorithms remains an open problem. In this paper, we first investigate the threshold-based rate adaptation algorithm via a reverse engineering approach where the implicit objective function is revealed. Next, we propose a threshold optimization algorithm which can dynamically adjust the up/down thresholds and converge to the stochastic optimum solution in arbitrary stationary random channel environment. The performance enhancement by tuning the thresholds optimally is validated by simulations.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:9 ,  Issue: 1 )