TY - GEN
T1 - Almost optimal dynamically-ordered multi-channel accessing for cognitive networks
AU - Li, Bowen
AU - Yang, Panlong
AU - Li, Xiang Yang
AU - Tang, Shaojie
AU - Liu, Yunhao
AU - Wu, Qihui
PY - 2012
Y1 - 2012
N2 - For cognitive wireless networks, one challenge is that the status of the channels' availability and quality is difficult to predict and quantify. 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 ordering. 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 conducted extensive simulations to compare the performance of our method with traditional MAB-based approach. Our simulation results show that our scheme improves the throughput by more than 30% and speed up the learning process by more than 100%.
AB - For cognitive wireless networks, one challenge is that the status of the channels' availability and quality is difficult to predict and quantify. 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 ordering. 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 conducted extensive simulations to compare the performance of our method with traditional MAB-based approach. Our simulation results show that our scheme improves the throughput by more than 30% and speed up the learning process by more than 100%.
UR - https://www.scopus.com/pages/publications/84861586434
U2 - 10.1109/INFCOM.2012.6195764
DO - 10.1109/INFCOM.2012.6195764
M3 - Conference contribution
AN - SCOPUS:84861586434
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 3081
EP - 3085
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -