Coalitional Games in Partition Form for Joint Spectrum Sensing and Access in Cognitive Radio Networks

被引:79
作者
Saad, Walid [1 ]
Han, Zhu [2 ,3 ]
Zheng, Rong [4 ]
Hjorungnes, Are [5 ]
Basar, Tamer [6 ]
Poor, H. Vincent [7 ]
机构
[1] Univ Miami, Elect & Comp Engn Dept, Coral Gables, FL 33146 USA
[2] Univ Houston, Elect & Comp Engn Dept, Houston, TX 77004 USA
[3] Kyung Hee Univ, Dept Elect & Radio Engn, Seoul 130701, South Korea
[4] Univ Houston, Dept Comp Sci, Houston, TX 77004 USA
[5] Univ Oslo, UNIK Univ Grad Ctr, N-2027 Kjeller, Norway
[6] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[7] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
Cognitive radio; cooperative games; game theory; sensing and access; CORE;
D O I
10.1109/JSTSP.2011.2175699
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Unlicensed secondary users (SUs) in cognitive radio networks are subject to an inherent tradeoff between spectrum sensing and spectrum access. Although each SU has an incentive to sense the primary user (PU) channels for locating spectrum holes, this exploration of the spectrum can come at the expense of a shorter transmission time, and, hence, a possibly smaller capacity for data transmission. This paper investigates the impact of this tradeoff on the cooperative strategies of a network of SUs that seek to cooperate in order to improve their view of the spectrum (sensing), reduce the possibility of interference among each other, and improve their transmission capacity (access). The problem is modeled as a coalitional game in partition form and an algorithm for coalition formation is proposed. Using the proposed algorithm, the SUs can make individual distributed decisions to join or leave a coalition while maximizing their utilities which capture the average time spent for sensing as well as the capacity achieved while accessing the spectrum. It is shown that, by using the proposed algorithm, the SUs can self-organize into a network partition composed of disjoint coalitions, with the members of each coalition cooperating to jointly optimize their sensing and access performance. Simulation results show the performance improvement that the proposed algorithm yields with respect to the noncooperative case. The results also show how the algorithm allows the SUs to self-adapt to changes in the environment such as changes in the traffic of the PUs, or slow mobility.
引用
收藏
页码:195 / 209
页数:15
相关论文
共 40 条
  • [1] [Anonymous], 2001, WIRELESS COMMUNICATI
  • [2] [Anonymous], P AS C SIGN SYST COM
  • [3] [Anonymous], P 2 INT WORKSH COGN
  • [4] [Anonymous], P INT C COMM BEIJ CH
  • [5] [Anonymous], PHYS COMMUN
  • [6] [Anonymous], 2007, A Game-Theoretic Perspective on Coalition Formation
  • [7] APT K, 2006, P INT WORKSH COMP SO
  • [8] Arachchige C., 2008, NEW FRONTIERS DYNAMI, P1, DOI [10.1109/DYSPAN.2008.78., DOI 10.1109/DYSPAN.2008.78]
  • [9] BLOEM M, 2007, P ICST ACM GAM WORKS
  • [10] The stability of hedonic coalition structures
    Bogomolnaia, A
    Jackson, MO
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2002, 38 (02) : 201 - 230