Optimal Rate Sampling in 802.11 systems

Rate Adaptation (RA) is a fundamental mechanism in 802.11 systems. It allows transmitters to adapt the coding and modulation scheme as well as the MIMO transmission mode to the radio channel conditions, and in turn, to learn and track the (mode, rate) pair providing the highest throughput. So far, the design of RA mechanisms has been mainly driven by heuristics. In contrast, in this paper, we rigorously formulate such design as an online stochastic optimisation problem. We solve this problem and present ORS (Optimal Rate Sampling), a family of (mode, rate) pair adaptation algorithms that provably learn as fast as it is possible the best pair for transmission. We study the performance of ORS algorithms in stationary radio environments where the successful packet transmission probabilities at the various (mode, rate) pairs do not vary over time, and in non-stationary environments where these probabilities evolve. We show that under ORS algorithms, the throughput loss due to the need to explore sub-optimal (mode, rate) pairs does not depend on the number of available pairs. This is a crucial advantage as evolving 802.11 standards offer an increasingly large number of (mode, rate) pairs. We illustrate the efficiency of ORS algorithms (compared to the state-of-the-art algorithms) using simulations and traces extracted from 802.11 test-beds.

[1]  Edward W. Knightly,et al.  Modulation Rate Adaptation in Urban and Vehicular Environments: Cross-Layer Implementation and Experimental Evaluation , 2008, IEEE/ACM Transactions on Networking.

[2]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[3]  Thierry Turletti,et al.  IEEE 802.11 rate adaptation: a practical approach , 2004, MSWiM '04.

[4]  John C. Bicket,et al.  Bit-rate selection in wireless networks , 2005 .

[5]  Eric Moulines,et al.  On Upper-Confidence Bound Policies for Switching Bandit Problems , 2011, ALT.

[6]  W. R. Thompson.  ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .

[7]  Victor C. M. Leung,et al.  A rate adaptation algorithm for IEEE 802.11 WLANs based on MAC-layer loss differentiation , 2005, 2nd International Conference on Broadband Networks, 2005..

[8]  Shie Mannor,et al.  Piecewise-stationary bandit problems with side observations , 2009, ICML '09.

[9]  T. L. Graves,et al.  Asymptotically Efficient Adaptive Choice of Control Laws inControlled Markov Chains , 1997 .

[10]  Aleksandrs Slivkins,et al.  Contextual Bandits with Similarity Information , 2009, COLT.

[11]  Reginald L. Lagendijk,et al.  Hybrid rate control for IEEE 802.11 , 2004, MobiWac '04.

[12]  David Wetherall,et al.  Predictable 802.11 packet delivery from wireless channel measurements , 2010, SIGCOMM '10.

[13]  Edward W. Knightly,et al.  Opportunistic media access for multirate ad hoc networks , 2002, MobiCom '02.

[14]  Aurélien Garivier,et al.  The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond , 2011, COLT.

[15]  Ratul Mahajan,et al.  Measurement-based models of delivery and interference in static wireless networks , 2006, SIGCOMM.

[16]  Peter Steenkiste,et al.  Efficient channel-aware rate adaptation in dynamic environments , 2008, MobiSys '08.

[17]  Shie Mannor,et al.  Unimodal Bandits , 2011, ICML.

[18]  Dinan Gunawardena,et al.  Dynamic channel, rate selection and scheduling for white spaces , 2011, CoNEXT '11.

[19]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[20]  Andreas Springer,et al.  Novel SINR-to-CQI Mapping Maximizing the Throughput in HSDPA , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[21]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[22]  Vaduvur Bharghavan,et al.  Robust rate adaptation for 802.11 wireless networks , 2006, MobiCom '06.

[23]  J. J. Garcia-Luna-Aceves,et al.  A practical approach to rate adaptation for multi-antenna systems , 2011, 2011 19th IEEE International Conference on Network Protocols.

[24]  Songwu Lu,et al.  MIMO rate adaptation in 802.11n wireless networks , 2010, MobiCom.

[25]  Leo Monteban,et al.  WaveLAN®-II: A high-performance wireless LAN for the unlicensed band , 1997, Bell Labs Technical Journal.

[26]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[27]  Hari Balakrishnan,et al.  Cross-layer wireless bit rate adaptation , 2009, SIGCOMM '09.

[28]  T. L. Lai Andherbertrobbins.  Asymptotically Efficient Adaptive Allocation Rules , 2022 .

[29]  H. Robbins.  Some aspects of the sequential design of experiments , 1952 .

[30]  Eli Upfal,et al.  Adapting to a Changing Environment: the Brownian Restless Bandits , 2008, COLT.

[31]  Sung-Ju Lee,et al.  CSI-SF: Estimating wireless channel state using CSI sampling & fusion , 2012, 2012 Proceedings IEEE INFOCOM.

[32]  Kevin C. Almeroth,et al.  Joint rate and channel width adaptation for 802.11 MIMO wireless networks , 2013, 2013 IEEE International Conference on Sensing, Communications and Networking (SECON).

[33]  Paramvir Bahl,et al.  A rate-adaptive MAC protocol for multi-Hop wireless networks , 2001, MobiCom '01.

[34]  Dongwook Kim,et al.  Optimal modulation and coding scheme selection in cellular networks with hybrid-ARQ error control , 2008, IEEE Transactions on Wireless Communications.

[35]  Aurélien Garivier,et al.  On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems , 2008, 0805.3415.

[36]  Haitao Wu,et al.  A Practical SNR-Guided Rate Adaptation , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[37]  Seongkwan Kim,et al.  CARA: Collision-Aware Rate Adaptation for IEEE 802.11 WLANs , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.