Almost Optimal Dynamically-Ordered Channel Sensing and Accessing for Cognitive Networks

作者：Li, Bowen^*; Yang, Panlong; Wang, Jinlong; Wu, Qihui; Tang, Shaojie; Li, Xiang-Yang; Liu, Yunhao

来源：IEEE Transactions on Mobile Computing, 2014, 13(10): 2215-2228.

DOI：10.1109/TMC.2013.98

• Cognitive radio networks
• online sequential sensing and accessing
• sequencing multi-armed bandit problem
• multichannel diversity

For cognitive wireless networks, one challenge is that the status and statistics of the channels' availability are difficult to predict. Numerous learning based online channel sensing and accessing strategies have been proposed to address such challenge. In this work, we propose a novel channel sensing and accessing strategy that carefully balances the channel statistics exploration and multichannel diversity exploitation. Unlike traditional MAB-based approaches, in our scheme, a secondary cognitive radio user will sequentially sense the status of multiple channels in a carefully designed order. We formulate the online sequential channel sensing and accessing problem as a sequencing multi-armed bandit problem, and propose a novel policy whose regret is in optimal logarithmic rate in time and polynomial in the number of channels. We conduct extensive simulations to compare the performance of our method with traditional MAB-based approach. Simulation results show that the proposed scheme improves the throughput by more than 30% and speeds up the learning process by more than 100%.

• 出版日期2014-10
• 单位清华大学