Sequential learning for optimal monitoring of multi-channel wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1152-1160

  Arora, Pallavi ^a   Szepesvári, Csaba ^b   Zheng, Rong ^a  

^a University of Houston ^*  (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL ASSIGNMENT; EFFICIENT LEARNING; MULTI ARMED BANDIT; MULTI-CHANNEL; NOVEL TECHNIQUES; NUMBER OF ARMS; SEQUENTIAL LEARNING; TIME SLOTS;

WIRELESS NETWORKS;

EID: 79960873049     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934892     Document Type: Conference Paper

References (28)

1. Robbins H., "Some aspects of the sequential design of experiments," Bulletin of the American Mathematical Society, vol. 58, pp. 527-535, 1952.
2. T L Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Advances in Applied Mathematics, vol. 6, no. 1, pp. 4-22, 1985.
3. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer, "Finite-time analysis of the multiarmed bandit problem," Mach. Learn., vol. 47, no. 2-3, pp. 235-256, 2002.
4. Anand Balachandran, Geoffrey M. Voelker, Paramvir Bahl, and P. Venkat Rangan, "Characterizing user behavior and network performance in a public wireless LAN," SIGMETRICS Perform. Eval. Rev., vol. 30, no. 1, pp. 195-205, 2002.
5. Tristan Henderson, David Kotz, and Ilya Abyzov, "The changing usage of a mature campus-wide wireless network," in Mobicom, 2004, pp. 187-201.
6. Jihwang Yeo, Moustafa Youssef, and Ashok Agrawala, "A framework for wireless LAN monitoring and its applications," in WiSe "04: Proceedings of the 3rd ACM workshop on Wireless security, 2004, pp. 70-79.
7. Maya Rodrig, Charles Reis, Ratul Mahajan, David Wetherall, and John Zahorjan, "Measurement-based characterization of 802.11 in a hotspot setting," in Proceedings of the 2005 ACM SIGCOMM workshop on Experimental approaches to wireless network design and analysis, 2005, pp. 5-10.
8. Yu-Chung Cheng, John Bellardo, Péter Benkö, Alex C. Snoeren, Geoffrey M. Voelker, and Stefan Savage, "Jigsaw: solving the puzzle of enterprise 802.11 analysis," in SIGCOMM, 2006.
9. Dong-Hoon Shin and Saurabh Bagchi, "Optimal monitoring in multichannel multi-radio wireless mesh networks," in MobiHoc, 2009, pp. 229-238.
10. Chandra Chekuri and Amit Kumar, "Maximum coverage problem with group budget constraints and applications," in APPROX, 2004, pp. 72-83.
11. Arun Chhetri, Huy Nguyen, Gabriel Scalosub, and Rong Zheng, "On quality of monitoring for multi-channel wireless infrastructure networks," in The ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2010.
12. Rajeev Agrawal, "Sample mean based index policies with o(log n) regret for the multi-armed bandit problem," Advances in Applied Probability, 1995.
13. Paat Rusmevichientong and John N. Tsitsiklis, "Linearly parameterized bandits," Math. Oper. Res., vol. 35, no. 2, pp. 395-411, 2010.
14. V Dani, TP Hayes, and SM Kakade, "Stochastic linear optimization under bandit feedback," in COLT-2008, 2008, pp. 355-366.
15. N. Cesa-Bianchi, G. Lugosi, and G. Stoltz, "Regret minimization under partial monitoring," Mathematics of Operations Research, vol. 31, pp. 562-580, 2006.
16. Lifeng Lai, Hesham El Gamal, Hai Jiang, and H. Vincent Poor, "Cognitive medium access: Exploration, exploitation and competition," CoRR, vol. abs/0710.1385, 2007.
17. Lifeng Lai, Hai Jiang, and H.V. Poor, "Medium access in cognitive radio networks: A competitive multi-armed bandit framework," in Signals, Systems and Computers, 2008 42nd Asilomar Conference on, 26-29 2008, pp. 98-102.
18. Keqin Liu and Qing Zhao, "Decentralized multi-armed bandit with multiple distributed players," CoRR, vol. abs/0910.2065, 2009, informal publication.
19. A. Anandkumar, N. Michael, and A.K. Tang, "Opportunistic Spectrum Access with Multiple Users: Learning under Competition," in Proc. of IEEE INFOCOM, San Deigo, USA, Mar. 2010.
20. Yi Gai, B. Krishnamachari, and R. Jain, "Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation," in New Frontiers in Dynamic Spectrum, 2010 IEEE Symposium on, 6-9 2010, pp. 1-9.
21. Jeremy Elson, Lewis Girod, and Deborah Estrin, "Fine-grained network time synchronization using reference broadcasts," SIGOPS Oper. Syst. Rev., vol. 36, no. SI, pp. 147-163, 2002.
22. V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple playspart i: I.i.d. rewards," Automatic Control, IEEE Transactions on, vol. 32, no. 11, pp. 968-976, nov 1987.
23. J-Y Audibert, R. Munos, and Cs. Szepesvári, "Tuning bandit algorithms in stochastic environments," in Algorithmic Learning Theory - 18th International Conference, ALT 2007. 2007, pp. 150-165, Springer.
24. J.-Y. Audibert, R. Munos, and Cs. Szepesvári, "Exploration- exploitation tradeoff using variance estimates in multi-armed bandits," Theoretical Computer Science, vol. 410, no. 19, pp. 1876-1902, 2009.
25. P. Auer, "Using upper confidence bounds for online learning," in Proceedings of the 41th Annual Symposium on Foundations of Computer Science. 2000, pp. 270-293, IEEE Computer Society.
26. A Garivier and E Moulines, "On upper-confidence bound policies for non-stationary bandit problems," Tech. Rep., LTCI, Dec 2008.
27. N. Cesa-Bianchi and G. Lugosi, "Combinatorial bandits," in COLT 2009, S. Dasgupta and A. Klivans, Eds., 2009.
28. R. Agrawal, M.V. Hedge, and D. Teneketzis, "Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost," IEEE Transactions on Automatic Control, vol. 33, no. 10, pp. 899-906, 1988.