Improved Weighted Average Consensus in Distributed Cooperative Spectrum Sensing Networks
Aislan Gabriel Hernandes, Mario Proenca Lemes Junior, Taufik, Abrao

TL;DR
This paper introduces an improved distributed consensus algorithm for cooperative spectrum sensing in cognitive radio networks, achieving high performance with low complexity and fast convergence without centralized fusion.
Contribution
It proposes a novel IWAC algorithm that combines channel condition-based weights for efficient, fully distributed spectrum sensing with comparable performance to centralized methods.
Findings
IWAC achieves similar detection performance to centralized CSS.
IWAC converges faster than traditional AC methods.
All proposed algorithms have similar computational complexity.
Abstract
This work proposes a fully distributed improved weighted average consensus (IWAC and WAC-AE) technique applied to cooperative spectrum sensing problem in cognitive radio systems. This method allows the secondary users cooperate based on only local information exchange without a fusion centre (FC). We have compared four rules of average consensus (AC) algorithms. The first rule is the simple AC without weights. The AC rule presents {performance comparable to the traditional cooperative spectrum sensing} (CSS) techniques, such as the equal gain combining (EGC) rule, which is a soft combining centralised method. Another technique is the weighted average consensus (WAC) rule using the weights based on the SUs channel condition. This technique results in a performance similar to the maximum ratio combining (MRC) with soft combining (centralised CSS). Two new AC rules are analysed, namely…
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.
