Hedonic Coalition Formation Game for Cooperative Spectrum Sensing and Channel Access in Cognitive Radio Networks

• Published in: IEEE transactions on wireless communications 2012-11, Vol.11 (11), p.3968-3979
• Main Authors: Xiaolei Hao, Man Hon Cheung, Wong, V. W. S., Leung, V. C. M.
• Format: Article
• Language: English
• Subjects: Access methods and protocols, osi model; Accuracy; Applied sciences; coalitional game theory; Cognitive radio; Cognitive radio networks; cooperative spectrum sensing; Data communication; Energy consumption; Exact sciences and technology; Game theory; hedonic coalition formation; Information, signal and communications theory; Interference; Radiocommunication specific techniques; Radiocommunications; Sensors; Signal and communications theory; Signal representation. Spectral analysis; Signal, noise; Switching and signalling; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2012.092412.111833

Cooperative spectrum sensing is an effective technique to improve the sensing performance and increase the spectrum efficiency in cognitive radio networks (CRNs). In this paper, we consider a CRN with multiple primary users (PUs) and multiple secondary users (SUs). We first propose a cooperative spectrum sensing and access (CSSA) scheme for all the SUs, where the SUs cooperatively sense the licensed channels of the PUs in the sensing subframe. If a channel is determined to be idle, the SUs which have sensed that channel will have a chance to transmit packets in the data transmission subframe. We then formulate this multi-channel spectrum sensing and channel access problem as a hedonic coalition formation game, where a coalition corresponds to the SUs that have chosen to sense and access a particular channel. The value function of each coalition and the utility function of each SU take into account both the sensing accuracy and the energy consumption. We propose an algorithm for decision node selection in a coalition. Moreover, we propose an algorithm based on the switch rule to allow the SUs to make decisions on whether to join or leave a coalition. We prove analytically that the set with all the SUs converges to a final network partition, which is both Nash-stable and individually stable. Besides, the proposed algorithms are adaptive to changes in network conditions. Simulation results show that our proposed CSSA scheme achieves a better performance than the closest PU (CPU) scheme and the noncooperative spectrum sensing and access (NSSA) scheme in terms of the average utility of the SUs.