Adaptive Algorithms for Bayesian Spectrum Sensing Based on Markov Model

• Published in: KSII transactions on Internet and information systems 2018, 12(7), , pp.3095-3111
• Main Authors: Peng, Shengliang, Gao, Renyang, Zheng, Weibin, Lei, Kejun
• Format: Article
• Language: English
• Subjects: Algorithms; Analysis; Markov processes; 컴퓨터학
• ISSN: 1976-7277; 1976-7277
• DOI: 10.3837/tiis.2018.07.007

Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms. Keywords: Spectrum sensing, Markov model, Bayesian cost, Adaptive threshold