Research Article
How to Optimally Schedule Cooperative Spectrum Sensing in Cognitive Radio Networks
@INPROCEEDINGS{10.1007/978-3-642-11664-3_11, author={Ke Lang and Yuan Wu and Danny Tsang}, title={How to Optimally Schedule Cooperative Spectrum Sensing in Cognitive Radio Networks}, proceedings={Access Networks. 4th International Conference, AccessNets 2009, Hong Kong, China, November 1-3, 2009, Revised Selected Papers}, proceedings_a={ACCESSNETS}, year={2012}, month={10}, keywords={cognitive radio cooperative sensing scheduling partially observable Markov decision process}, doi={10.1007/978-3-642-11664-3_11} }- Ke Lang
Yuan Wu
Danny Tsang
Year: 2012
How to Optimally Schedule Cooperative Spectrum Sensing in Cognitive Radio Networks
ACCESSNETS
Springer
DOI: 10.1007/978-3-642-11664-3_11
Abstract
In cognitive radio (CR) networks, secondary users can be coordinated to perform spectrum sensing so as to detect primary user activities more accurately. However, in a dynamic spectrum environment, more sensing cooperations may induce every secondary user to sense more channels, thus decreasing their transmission time. In this paper, we study this tradeoff by using the theory of partially observable Markov decision process (POMDP). This formulation leads to an optimal sensing scheduling policy that determines which secondary users sense which channels with what miss detection probability and false alarm probability. A myopic policy with lower complexity yet comparable performance is also proposed. Numerical and simulation results are provided to illustrate that our design can utilize the spectrum more efficiently for cognitive radio users.
