Spatial Spectrum Access Game

被引:11
作者
Chen, Xu [1 ]
Huang, Jianwei [2 ]
机构
[1] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85281 USA
[2] Chinese Univ Hong Kong, Dept Informat Engn, Network Commun & Econ Lab, Hong Kong, Hong Kong, Peoples R China
关键词
Distributed spectrum access; spatial reuse; game theory; Nash equilibrium; distributed learning; COGNITIVE RADIO NETWORKS; CONGESTION GAMES; WIRELESS NETWORKS; DYNAMICS;
D O I
10.1109/TMC.2014.2326673
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mechanisms. In this paper, we propose a framework of spatial spectrum access games on directed interference graphs, which can model quite general interference relationship with spatial reuse in wireless networks. We show that a pure Nash equilibrium exists for the two classes of games: (1) any spatial spectrum access games on directed acyclic graphs, and (2) any games satisfying the congestion property on directed trees and directed forests. Under mild technical conditions, the spatial spectrum access games with random backoff and Aloha channel contention mechanisms on undirected graphs also have a pure Nash equilibrium. We also quantify the price of anarchy of the spatial spectrum access game. We then propose a distributed learning algorithm, which only utilizes users' local observations to adaptively adjust the spectrum access strategies. We show that the distributed learning algorithm can converge to an approximate mixed-strategy Nash equilibrium for any spatial spectrum access games. Numerical results demonstrate that the distributed learning algorithm achieves up to 100 percent performance improvement over a random access algorithm.
引用
收藏
页码:646 / 659
页数:14
相关论文
共 35 条
  • [1] NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
    Akyildiz, Ian F.
    Lee, Won-Yeol
    Vuran, Mehmet C.
    Mohanty, Shantidev
    [J]. COMPUTER NETWORKS, 2006, 50 (13) : 2127 - 2159
  • [2] Opportunistic Spectrum Access with Multiple Users: Learning under Competition
    Anandkumar, Animashree
    Michael, Nithin
    Tang, Ao
    [J]. 2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [3] [Anonymous], SPATIAL SPECTRUM ACC
  • [4] [Anonymous], P TEL POL RES C FAIR
  • [5] [Anonymous], P ACM 20 ANN S PAR A
  • [6] Optimal constant-window backoff scheme for IEEE 802.11 DCF in single-hop wireless networks under finite load conditions
    Anouar, Hicham
    Bonnet, Christian
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2007, 43 (04) : 1583 - 1602
  • [7] Biggs N., 1986, Graph Theory
  • [8] Chen X., 2012, P 13 ACM INT S MOBIL, P205
  • [9] A payoff-based learning procedure and its application to traffic games
    Cominetti, Roberto
    Melo, Emerson
    Sorin, Sylvain
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2010, 70 (01) : 71 - 83
  • [10] A note on approximate Nash equilibria
    Daskalakis, Constantinos
    Mehta, Aranyak
    Papadimitriou, Christos
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (17) : 1581 - 1588