By Topic

A Coalition Formation Game for Energy-Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks with Multiple Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiaolei Hao ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Man Hon Cheung ; Wong, V.W.S. ; Leung, V.C.M.

Spectrum sensing is one of the key technologies to realize spectrum reuse and increase the spectrum efficiency in cognitive radio networks (CRNs). In this paper, we study energy-efficient cooperative multi-channel spectrum sensing in CRNs. We first propose a cooperative spectrum sensing and accessing (CSSA) scheme for all the secondary users (SUs). The SUs cooperatively sense the licensed channels of the primary users (PUs) in the sensing slot. 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 slot. We then formulate this multi- channel spectrum sensing problem as a coalition formation game, where a coalition corresponds to the SUs that have chosen to sense and access a particular channel. The utility function of each coalition takes into account both the sensing accuracy and energy efficiency. We propose distributed algorithms to find the optimal partition that maximizes the aggregate utility of all the coalitions in the system. We prove analytically that the proposed algorithms terminate at a stable partition that achieves the optimal aggregate utility. Simulation results show that the proposed algorithms result in the self-organization of the SUs that achieves a higher aggregate utility after each iteration. Also, the convergence and optimality of the proposed algorithms are proved by simulation results.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011