Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, and Zhu Han

TL;DR
This paper introduces novel matrix completion and joint sparsity recovery algorithms for collaborative spectrum sensing in cognitive radio networks, significantly reducing sensing and reporting requirements while accurately detecting spectrum holes.
Contribution
It proposes new algorithms that enable exact spectrum detection from sparse, incomplete reports, improving efficiency over traditional methods in cognitive radio networks.
Findings
Matrix completion achieves exact detection with ≤50% samples in small networks.
Joint sparsity recovery performs well in large-scale networks.
Numerical results confirm robustness and effectiveness of the proposed methods.
Abstract
Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio (CR). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking complete spectrum usage. Due to hardware limitations, each cognitive radio node can only sense a relatively narrow band of radio spectrum. Consequently, the available channel sensing information is far from being sufficient for precisely recognizing the wide range of unoccupied channels. Aiming at breaking this bottleneck, we propose to apply matrix completion and joint sparsity recovery to reduce sensing and transmitting requirements and improve sensing results. Specifically, equipped with a frequency selective filter, each cognitive radio node senses linear combinations of multiple channel information and reports them to the fusion center, where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
