AN OVERLAPPING COALITIONAL GAME FOR COOPERATIVE SPECTRUM SENSING AND ACCESS IN COGNITIVE RADIO NETWORKS
Cognitive radio networks (CRNs) provide an effective solution to address the increasing demand for spectrum resources. In this project, traffic-demand-based cooperation strategy of SUs in multichannel CRNs, in which each SU makes its own cooperative sensing decision according to its traffic demand are studied. When an SU has high traffic demand, it can choose to sense multiple channels in the sensing period and obtain more chances to use spectrum resources. If an SU has no data to transmit, it can choose not to perform spectrum sensing. We formulate this problem as a non-transferable utility (NTU) overlapping coalitional game. In this game, each SU implements a cooperation strategy according to its expected payoff, which takes into account the expected throughput and energy efficiency. Two different algorithms, namely, an overlapping coalition formation (OCF) algorithm and a sequential coalition formation (SCF) algorithm, to obtain a coalition structure. The OCF algorithm guarantees that the coalition structure is stable, whereas the SCF algorithm has lower computational complexity and less information exchange among SUs. Moreover, when being assigned a certain channel, SU implements an adaptive transmission power control scheme to further improve its energy efficiency.
Algorithm:1 The Overlapping Coalition Formation(OCF) Algorithm in CRN for SU i ∈ N
Algorithm:2 The Sequential Coalition Formation(SCF) Algorithm in CRN
Reference Paper: An Overlapping Coalitional Game for Cooperative Spectrum Sensing and Access in Cognitive Radio Networks
Author’s Name: Zhiyu Dai, ZehuaWang, and VincentW. S. Wong
Source: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 65, NO. 10
Year:2016
Request source code for academic purpose, fill REQUEST FORM or contact +91 7904568456 by WhatsApp or info@verilogcourseteam.com, fee applicable.
SIMULATION VIDEO DEMO
