IoT as a Service. 5th EAI International Conference, IoTaaS 2019, Xi’an, China, November 16-17, 2019, Proceedings

Research Article

Channel Exploration and Exploitation with Imperfect Spectrum Sensing for Multiple Users

Download
72 downloads
  • @INPROCEEDINGS{10.1007/978-3-030-44751-9_23,
        author={Zuohong Xu and Zhou Zhang and Ye Yan and Shilian Wang},
        title={Channel Exploration and Exploitation with Imperfect Spectrum Sensing for Multiple Users},
        proceedings={IoT as a Service. 5th EAI International Conference, IoTaaS 2019, Xi’an, China, November 16-17, 2019, Proceedings},
        proceedings_a={IOTAAS},
        year={2020},
        month={6},
        keywords={Multi-user channel sensing and access Distributed multi-armed bandit problem Logarithmic regret},
        doi={10.1007/978-3-030-44751-9_23}
    }
    
  • Zuohong Xu
    Zhou Zhang
    Ye Yan
    Shilian Wang
    Year: 2020
    Channel Exploration and Exploitation with Imperfect Spectrum Sensing for Multiple Users
    IOTAAS
    Springer
    DOI: 10.1007/978-3-030-44751-9_23
Zuohong Xu1, Zhou Zhang2,*, Ye Yan2, Shilian Wang1
  • 1: National University of Defense Technology
  • 2: Tianjin Artificial Intelligence Innovation Center (TAIIC)
*Contact email: zt.sy1986@163.com

Abstract

In this paper, the fundamental problem of multiple secondary users (SUs) contending for opportunistic spectrum sensing and access over multiple channels in cognitive radio networks is investigated, when sensing is imperfect and each SU can access up to a limited number of channels at a time. For each channel, the busy/idle state is independent from one slot to another. The availability information of channels is unknown and has to be estimated by SUs during channel sensing and access process. Learning loss, also referred as regret, is thus inevitable. To minimize the loss, we model the channel sensing and access process as a multi-armed bandit problem, and contribute to proposing policies for spectrum sensing and access among multiple SUs under both centralized and distributed framework. Through theoretical analysis, our proposed policies are proved with logarithmic regret asymptotically and in finite time, and their effectiveness is verified by simulations.