Non-cooperative spectrum access in cognitive radio networks: A game theoretical model

被引:23
作者
Elias, Jocelyne [1 ]
Martignon, Fabio [2 ,4 ]
Capone, Antonio [3 ]
Altman, Eitan
机构
[1] Univ Paris 05, Sorbonne Paris Cite, France
[2] Univ Paris 11, LRI, Paris, France
[3] Politecn Milan, Milan, Italy
[4] Univ Bergamo, Bergamo, Italy
关键词
Cognitive radio networks; Spectrum access; Game theory; Price of Anarchy; Elastic/non-elastic traffic; DYNAMIC GAME;
D O I
10.1016/j.comnet.2011.07.022
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate in a certain spectrum band: their access can only be controlled by the primary operator and is not affected by any other unlicensed (secondary) user. On the other hand, secondary users (SUs) have no spectrum license, and they attempt to exploit the spectral gaps left free by primary users. This work studies the spectrum access problem in cognitive radio networks from a game theoretical perspective. The problem is modeled as a non-cooperative spectrum access game where secondary users access simultaneously multiple spectrum bands left available by primary users, optimizing their objective function which takes into account the congestion level observed on the available spectrum bands. As a key innovative feature with respect to existing works, we model accurately the interference between SUs, capturing the effect of spatial reuse. Furthermore, we consider both non-elastic and elastic user traffic, to model real-time as well as data transfer applications. Finally, we consider an alternative formulation of the spectrum access problem, where players use replicator dynamics to adjust their strategies, and we derive convergence conditions to Nash equilibrium points. We demonstrate the existence of the Nash equilibrium, and derive equilibrium flow settings. Finally, we provide numerical results of the proposed spectrum access game in several cognitive radio scenarios, and study the impact of the interference between SUs on the game efficiency. Our results indicate that the congestion cost functions we propose in this paper lead to small gaps between Nash equilibria and optimal solutions in all the considered network scenarios, thus representing a starting point for designing pricing mechanisms so as to obtain a socially optimal use of the network. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:3832 / 3846
页数:15
相关论文
共 27 条
[1]   A survey on spectrum management in cognitive radio networks [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
IEEE COMMUNICATIONS MAGAZINE, 2008, 46 (04) :40-48
[2]   NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
COMPUTER NETWORKS, 2006, 50 (13) :2127-2159
[3]  
Altman E, 2007, LECT NOTES COMPUT SC, V4465, P1
[4]   Competitive routing in networks with polynomial costs [J].
Altman, E ;
Basar, T ;
Jiménez, T ;
Shimkin, N .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (01) :92-96
[5]  
[Anonymous], 2002, REPORT SPECTRUM EFFI, P02
[6]  
[Anonymous], 1987, FDN SOFTWARE TECHNOL, DOI DOI 10.1007/3-540-18625-5_61
[7]  
[Anonymous], AMPL MOD LANG MATH P
[8]  
ARNOLD L, Stochastic Differential Equations: Theory and Application
[9]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[10]  
Elias J., 2010, P 8 INT S MOD OPT MO