Optimal Rate Sampling in 802.11 systems

Combes, Richard; Proutière, Alexandre; Yun, Donggyu; Ok, Jungseul; Ye, Yi

doi:10.1109/infocom.2014.6848225

Cited by 43 publications

(43 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pefkianakis et al [2] investigated the link adaptation problem in 802.11n WLANs and observed the non-monotonicity between [7] explore the fundamental limits of sampling based rate adaptation algorithms and design a family of algorithms called ORS that learn the optimal settings as fast as possible (not necessarily the same as the optimizing the overhead due to sampling). Underlying ORS algorithms are certain unrealistic assumptions such as prior knowledge of the speed at which the environment is changing, which makes them more of theoretical interest.…”

Section: Related Workmentioning

confidence: 99%

SampleLite

Kriara

Marina

2015

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

We consider the link adaptation problem in 802.11n wireless LANs that involves adapting MIMO mode, channel bonding, modulation and coding scheme, and frame aggregation level with varying channel conditions. Through measurement-based analysis, we find that adapting all available 802.11n features results in higher goodput than adapting only a subset of features, thereby showing that holistic link adaptation is crucial to achieve best performance. We then design a novel hybrid link adaptation scheme termed SampleLite that adapts all 802.11n features while being efficient compared to sampling-based open-loop schemes and practical relative to closed loop schemes. SampleLite uses sender-side RSSI measurements to significantly lower the sampling overhead, by exploiting the monotonic relationship between best settings for each feature and the RSSI. Through analysis and experimentation in a testbed environment, we show that our proposed approach can reduce the sampling overhead by over 70% on average compared to the widely used Minstrel HT scheme. We also experimentally evaluate the goodput performance of SampleLite in a wide range of controlled and realworld interference scenarios. Our results show that SampleLite, while performing close to the ideal, delivers goodput that is 35-100% better than with existing schemes.

show abstract

Section: Related Workmentioning

confidence: 99%

SampleLite

Kriara

Marina

2015

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…6, 7, and 8, we consider fixed bandwidth for 802.11. However, 802.11 can be rate-controlled through adopting different rate adaptation mechanisms [76]- [83]. If we would accommodate any such rate adaptation mechanism, then we need to put corresponding mathematical formulation of the rate achieved over 802.11 [81]- [84] in place of BW B in the equations.…”

Section: B Mathematical Model For Optimal Backpack Densitymentioning

confidence: 99%

“…Note that the usage of RTS/CTS can be replaced by a different rate adaptation mechanism pertinent for 802.11 [76]- [83], as RTS/CTS may not be required in case of small-sized sensed packets [85], [86]. In such a case, we need to put corresponding mathematical formulation of the rate achieved over 802.11 [81]- [84] in place of BW B in Eq.…”

Section: B Mathematical Model For Optimal Backpack Densitymentioning

confidence: 99%

Backpacking: Energy-Efficient Deployment of Heterogeneous Radios in Multi-Radio High-Data-Rate Wireless Sensor Networks

et al. 2014

View full text Add to dashboard Cite

The early success of wireless sensor networks has led to a new generation of increasingly sophisticated sensor network applications, such as HP's CeNSE. These applications demand high network throughput that easily exceeds the capability of the low-power 802.15.4 radios most commonly used in today's sensor nodes. To address this issue, this paper investigates an energy-efficient approach to supplementing an 802.15.4-based wireless sensor network with high bandwidth, high power, longer range radios, such as 802.11. Exploiting a key observation that the high-bandwidth radio achieves low energy consumption per bit of transmitted data due to its inherent transmission efficiency, we propose a hybrid network architecture that utilizes an optimal density of dual-radio (802.15.4 and 802.11) nodes to augment a sensor network having only 802.15.4 radios. We present a cross-layer mathematical model to calculate this optimal density, which strikes a delicate balance between the low energy consumption per transmitted bit of the high-bandwidth radio and low sleep power of the 802.15.4. Experimental results obtained using a wireless sensor network testbed reveal that our architecture improves the average energy per bit, time elapsed before the first node drains its battery, time elapsed before half of the nodes drain their batteries, and end-to-end delay by significant margins compared with a network having only 802.15.4. INDEX TERMSAd hoc networks, cyberspace, radio communication, wireless sensor networks, network topology.

show abstract

“…The goal is to quantify the performance gain due to a given type of structure, and both regret lower bounds and asymptotically optimal algorithms have been proposed for certain structures. Structured MABs are interesting because they naturally arise in the design of computer systems (at large), for instance: wireless networks [9], shortest-path routing [13], search engines [23] and ad-display optimization [22].…”

Section: Introductionmentioning

confidence: 99%

Bandits with Budgets

Combes

Chong

Srikant

2015

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Self Cite

View full text Add to dashboard Cite

We investigate multi-armed bandits with budgets, a natural model for ad-display optimization encountered in search engines. We provide asymptotic regret lower bounds satisfied by any algorithm, and propose algorithms which match those lower bounds. We consider different types of budgets: scenarios where the advertiser has a fixed budget over a time horizon, and scenarios where the amount of money that is available to spend is incremented in each time slot. Further, we consider two different pricing models, one in which an advertiser is charged for each time her ad is shown (i.e., for each impression) and one in which the advertiser is charged only if a user clicks on the ad. For all of these cases, we show that it is possible to achieve O(log(T )) regret. For both the cost-per-impression and cost-per-click models, with a fixed budget, we provide regret lower bounds that apply to any uniformly good algorithm. Further, we show that B-KL-UCB, a natural variant of KL-UCB, is asymptotically optimal for these cases. Numerical experiments (based on a real-world data set) further suggest that B-KL-UCB also has the same or better finite-time performance when compared to various previously proposed (UCB-like) algorithms, which is important when applying such algorithms to a real-world problem.

show abstract

Optimal Rate Sampling in 802.11 systems

Cited by 43 publications

References 30 publications

SampleLite

SampleLite

Backpacking: Energy-Efficient Deployment of Heterogeneous Radios in Multi-Radio High-Data-Rate Wireless Sensor Networks

Bandits with Budgets

Contact Info

Product

Resources

About