Almost optimal dynamically-ordered multi-channel accessing for cognitive networks
暂无分享,去创建一个
[1] Qing Zhao,et al. Distributed Learning in Multi-Armed Bandit With Multiple Players , 2009, IEEE Transactions on Signal Processing.
[2] Mingyan Liu,et al. Online learning in opportunistic spectrum access: A restless bandit approach , 2010, 2011 Proceedings IEEE INFOCOM.
[3] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 1985 .
[4] Yunhao Liu,et al. Does Wireless Sensor Network Scale? A Measurement Study on GreenOrbs , 2013, IEEE Trans. Parallel Distributed Syst..
[5] Demosthenis Teneketzis,et al. Multi-Armed Bandit Problems , 2008 .
[6] H. Vincent Poor,et al. Cognitive Medium Access: Exploration, Exploitation, and Competition , 2007, IEEE Transactions on Mobile Computing.
[7] Shaojie Tang,et al. Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.
[8] A. Sahai,et al. How much white space is there ? , 2009 .
[9] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[10] Shaojie Tang,et al. Multicast Capacity Scaling Laws for Multihop Cognitive Networks , 2012, IEEE Transactions on Mobile Computing.