Efficient Channel Search Algorithms for Cognitive Radio in a Multichannel System

In a cognitive radio (CR) network, secondary users (SUs) are allowed to opportunistically access a licensed spectrum that is not currently being occupied by primary users. This paper is concerned with the problem of how to quickly and accurately locate an unoccupied channel or determine that there is no unoccupied channel, from multiple (yet finite) candidate channels for a SU with a single detector. To design channel search algorithms, we propose a design criterion that minimizes average searching time subject to constraints on the error probabilities for a multichannel system. Relying on the proposed design criterion, we develop two efficient channel search algorithms that are based on a sequential application of the sequential probability ratio test and energy detection to the candidate channels.

[1]  Yonghong Zeng,et al.  Sensing-Throughput Tradeoff for Cognitive Radio Networks , 2008, IEEE Trans. Wirel. Commun..

[2]  R. Khan,et al.  Sequential Tests of Statistical Hypotheses. , 1972 .

[3]  H. Vincent Poor,et al.  Quickest Search Over Multiple Sequences , 2011, IEEE Transactions on Information Theory.

[4]  H. Vincent Poor,et al.  Wideband Spectrum Sensing in Cognitive Radio Networks , 2008, 2008 IEEE International Conference on Communications.

[5]  A. Wald Sequential Tests of Statistical Hypotheses , 1945 .

[6]  Georgios B. Giannakis,et al.  Rate-Optimal and Reduced-Complexity Sequential Sensing Algorithms for Cognitive OFDM Radios , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[7]  Vladimir Dragalin A simple and effective scanning rule for a multi-channel system , 1996 .

[8]  Honghai Zhang,et al.  SSCT: A Simple Sequential Spectrum Sensing Scheme for Cognitive Radio , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[9]  Shuguang Cui,et al.  Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks , 2008, IEEE Journal of Selected Topics in Signal Processing.