Reconstructing Spectrum Occupancies for Wideband Cognitive Radio Networks: A Matrix Completion via Belief Propagation

In wideband cognitive radio networks having multiple channels, it improves the efficiency of spectrum access to predict the states of unsensed channels at different locations. On considering the channel states as a matrix, whose rows are the indices of locations and columns are the indices of channels, the prediction of channel states is essentially a matrix completion, i.e. reconstructing the whole matrix by using a few known entries. Due to the challenges of high dimensionality and decentralization, as well as the {\em a priori} information about the similarity between adjacent channels or locations, the traditional matrix completion approaches, like singular value decomposition (SVD) and nuclear norm optimization, are inefficient. In this paper, we propose to apply the framework of Belief Propagation (BP) for the matrix completion. Both centralized and decentralized versions are introduced. Numerical simulation results show that the proposed BP framework can effectively predict the channel states and thus efficiently orient the spectrum sensing of secondary users. Numerical simulations have shown that, for a scenario with 20000 frequency-space pairs, we can achieve a reconstruction error rate less than 20% (5%) with sampling rate 1% (15%). It is also demonstrated that our proposed algorithm significantly outperforms the general-purpose SVD based matrix completion algorithm.

[1]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[2]  Olgica Milenkovic,et al.  Sublinear compressive sensing reconstruction via belief propagation decoding , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[4]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[5]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[6]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, ISIT.

[7]  Ananthram Swami,et al.  A Decision-Theoretic Framework for Opportunistic Spectrum Access , 2007, IEEE Wireless Communications.

[8]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[10]  Prabhakar Raghavan,et al.  Competitive recommendation systems , 2002, STOC '02.

[11]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[12]  Hai Jiang,et al.  Medium access in cognitive radio networks: A competitive multi-armed bandit framework , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

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