An Efficient Algorithm for Cooperative Spectrum Sensing in Cognitive Radio Networks
Vinod Sharma, ArunKumar Jayaprakasam

TL;DR
This paper introduces a distributed cooperative spectrum sensing algorithm for cognitive radio networks that achieves low detection delay, minimal energy consumption, and reduced interference, outperforming recent methods.
Contribution
The paper presents a novel distributed sequential detection algorithm for cooperative spectrum sensing that is energy-efficient and faster than existing approaches.
Findings
Detects spectrum changes faster than recent algorithms
Consumes significantly less energy
Causes low interference to primary users
Abstract
We consider the problem of Spectrum Sensing in Cognitive Radio Systems. We have developed a distributed algorithm that the Secondary users can run to sense the channel cooperatively. It is based on sequential detection algorithms which optimally use the past observations. We use the algorithm on secondary users with energy detectors although it can be used with matched filter and other spectrum sensing algorithms also. The algorithm provides very low detection delays and also consumes little energy. Furthermore it causes low interference to the primary users. We compare this algorithm to several recently proposed algorithms and show that it detects changes in spectrum faster than these algorithms and uses significantly less energy.
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.
Taxonomy
TopicsCognitive Radio Networks and Spectrum Sensing · Distributed Sensor Networks and Detection Algorithms · Advanced MIMO Systems Optimization
