Performance guarantees through partial information based control in multichannel wireless networks

We consider a wireless system with multiple channels when each channel has several transmission states. A user learns about the instantaneous state of an available channel by transmitting a control packet in it. In presence of multiple channels, this process of probing every channel to find the best one consumes significant energy and time. So a user needs to select a channel based only on partial information about instantaneous states of available channels. Furthermore, a user not only needs to optimize its selection based on the information it has, but also needs to determine what and how much information it needs to acquire about the instantaneous states of the available channels. We investigate desired tradeoffs between information acquisition and exploitation in context of wireless networks. We seek to maximize a utility function which depends on both the cost and value of information, and obtain computationally simple joint information acquisition and exploitation strategies that attain constant factor approximations of the optimal solution.

[1]  Haim Kaplan,et al.  Learning with attribute costs , 2005, STOC '05.

[2]  Jennifer Widom,et al.  The Pipelined Set Cover Problem , 2005, ICDT.

[3]  Edward W. Knightly,et al.  Opportunistic Spectral Usage: Bounds and a Multi-Band CSMA/CA Protocol , 2007, IEEE/ACM Transactions on Networking.

[4]  Jennifer Widom,et al.  Adaptive ordering of pipelined stream filters , 2004, SIGMOD '04.

[5]  László Lovász,et al.  Approximating Min Sum Set Cover , 2004, Algorithmica.

[6]  Y. Freund,et al.  The non-stochastic multi-armed bandit problem , 2001 .

[7]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains , 1995 .

[8]  Jennifer Widom,et al.  Optimization of continuous queries with shared expensive filters , 2007, PODS.

[9]  Saswati Sarkar,et al.  Characterizing Temporal SNR Variation in 802.11 Networks , 2008, IEEE Transactions on Vehicular Technology.

[10]  U. Srivastava,et al.  Ordering Pipelined Query Operators with Precedence Constraints , 2005 .

[11]  Edith Cohen,et al.  Efficient sequences of trials , 2003, SODA '03.

[12]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[13]  Sudipto Guha,et al.  Optimizing transmission rate in wireless channels using adaptive probes , 2006, SIGMETRICS '06/Performance '06.

[14]  S. Guha,et al.  Jointly optimal transmission and probing strategies for multichannel wireless systems , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[15]  G. Simons Great Expectations: Theory of Optimal Stopping , 1973 .

[16]  Yi Yang,et al.  Exploiting medium access diversity in rate adaptive wireless LANs , 2004, MobiCom '04.

[17]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[18]  Joseph M. Hellerstein,et al.  Optimization techniques for queries with expensive methods , 1998, TODS.

[19]  Murali S. Kodialam The Throughput of Sequential Testing , 2001, IPCO.

[20]  Koushik Kar,et al.  Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks , 2006 .

[21]  Roch Guérin,et al.  Realizing the benefits of user-level channel diversity , 2005, CCRV.