2014/08/14 by Tianyu Wang, Lingyang Song, Wang, Tianyu +5
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Cognitive Radio Networks and Spectrum Sensing #Computer Science and Game Theory (cs.GT) #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1408.3182
openalex publication_date 2014/08/14 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
Cooperative spectrum sensing has been shown to yield a significant performance improvement in cognitive radio networks. In this paper, we consider distributed cooperative sensing (DCS) in which secondary users (SUs) exchange data with one another instead of reporting to a common fusion center. In most existing DCS algorithms, the SUs are grouped into disjoint cooperative groups or coalitions, and within each coalition the local sensing data is exchanged. However, these schemes do not account for the possibility that an SU can be involved in multiple cooperative coalitions thus forming overlapping coalitions. Here, we address this problem using novel techniques from a class of cooperative games, known as overlapping coalition formation games, and based on the game model, we propose a distributed DCS algorithm in which the SUs self-organize into a desirable network structure with overlapping coalitions. Simulation results show that the proposed overlapping algorithm yields significant performance improvements, decreasing the total error probability up to 25% in the Qm+Qf criterion, the missed detection probability up to 20% in the Qm/Qf criterion, the overhead up to 80%, and the total report number up to 10%, compared with the state-of-the-art non-overlapping algorithm.