Analysis of Search Schemes in Cognitive Radio

Cognitive radio systems face an important challenge - fast and reliable channel searching to enable secondary users to optimize available spectral resources. We revisit conventional URN models for channel occupancy and analyze the performance of several search schemes in terms of the mean time to detection. In particular, we focus on correlated Markov models for bin occupancy and highlight the performance of n-step serial search (nSS) algorithm.

[1]  Joseph Mitola,et al.  Cognitive radio: making software radios more personal , 1999, IEEE Wirel. Commun..

[2]  Anant Sahai,et al.  Cooperative Sensing among Cognitive Radios , 2006, 2006 IEEE International Conference on Communications.

[3]  Olgica Milenkovic,et al.  Probabilistic Transforms for Combinatorial Urn Models , 2004, Combinatorics, Probability and Computing.

[4]  Rajarathnam Chandramouli,et al.  Dynamic spectrum access in open spectrum wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Ian F. Akyildiz,et al.  NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey , 2006, Comput. Networks.

[6]  Simon Haykin,et al.  Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Stefan Mangold,et al.  Spectrum agile radio: radio resource measurements for opportunistic spectrum usage , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[8]  A.A.M. Saleh,et al.  A Statistical Model for Indoor Multipath Propagation , 1987, IEEE J. Sel. Areas Commun..

[9]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[10]  Sumit Roy,et al.  On acquisition of wideband direct-sequence spread spectrum signals , 2006, IEEE Transactions on Wireless Communications.

[11]  Kang G. Shin,et al.  What and how much to gain by spectrum agility? , 2007, IEEE Journal on Selected Areas in Communications.