Collaborative spectrum sensing from sparse observations using matrix completion for cognitive radio networks

In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking complete spectrum usage states. Unfortunately, due to power limitation and channel fading, available channel sensing information is far from being sufficient to tell the unoccupied channels directly. Aiming at breaking this bottleneck, we apply recent matrix completion techniques to greatly reduce the sensing information needed. We formulate the collaborative sensing problem as a matrix completion subproblem and a joint-sparsity reconstruction subproblem. Results of numerical simulations that validated the effectiveness and robustness of the proposed approach are presented. In particular, in noiseless cases, when number of primary user is small, exact detection was obtained with no more than 8% of the complete sensing information, whilst as number of primary user increases, to achieve a detection rate of 95.55%, the required information percentage was merely 16.8%.

[1]  Mislav Grgic,et al.  Dynamic spectrum access in cognitive radio , 2009, 2009 International Symposium ELMAR.

[2]  Shiqian Ma,et al.  Fixed point and Bregman iterative methods for matrix rank minimization , 2009, Math. Program..

[3]  A. Ghasemi,et al.  Collaborative spectrum sensing for opportunistic access in fading environments , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[4]  Ekram Hossain,et al.  Dynamic Spectrum Access and Management in Cognitive Radio Networks: Introduction , 2009 .

[5]  Zhu Han,et al.  Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks , 2009, IEEE INFOCOM 2009.

[6]  William A. Arbaugh,et al.  Dynamic spectrum access in cognitive radio networks , 2006 .

[7]  Shiqian Ma,et al.  Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization , 2009, Found. Comput. Math..

[8]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.

[9]  Zhu Han,et al.  Sampling rate reduction for 60 GHz UWB communication using compressive sensing , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[10]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[11]  Zhu Han,et al.  Sparse event detection in wireless sensor networks using compressive sensing , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

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

[13]  Donald Goldfarband Shiqian CONVERGENCE OF FIXED POINT CONTINUATION ALGORITHMS FOR MATRIX RANK MINIMIZATION , 2010 .

[14]  Wei Zhang,et al.  Cluster-Based Cooperative Spectrum Sensing in Cognitive Radio Systems , 2007, 2007 IEEE International Conference on Communications.

[15]  E. Candès,et al.  Exact low-rank matrix completion via convex optimization , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[16]  Petros Drineas,et al.  Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix , 2006, SIAM J. Comput..