• DocumentCode
    1996001
  • Title

    A Spatial Game for Access Points Placement in Cognitive Radio Networks with Multi-Type Service

  • Author

    Li, Dapeng ; Xu, Youyun ; Liu, Jing ; Wang, Xinbing ; Guizani, Mohsen

  • Author_Institution
    Dept. of Electr. Eng., Shanghai Jiao Tong Univ., Shanghai, China
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    This paper studies the problem of determining locations of Secondary Access Points (SAPs) which belong to two competitive service providers in a certain region. SUs connect to the SAP according to their preferences. A key feature of our modeling approach is that it permits SAPs to set discriminatory powers for SUs, that is, SUs in different locations will be scheduled with different transmission powers. The profit maximizing SAPs compete with each other by setting locations and delivered power schedules to attract SUs, taking into account the impact of the revenue obtained and the power cost incurred. To study this competitive situation, an appropriate extensive form game is defined. The game can be viewed as two-staged. The selection of transmission powers by the SAPs can be investigated for each pair of locations. Then, the problem of location choice can be analyzed, anticipating what transmission powers will be chosen. We make an important observation: the Nash equilibrium of the game exists and the global revenue maximum strategy is a Nash equilibrium strategy. An example demonstrating how to place SAPs in a linear region is presented.
  • Keywords
    cognitive radio; game theory; Nash equilibrium; SAP; access points placement; cognitive radio networks; power schedules; secondary access points; spatial game; Base stations; Cognitive radio; Games; Mobile communication; Nash equilibrium; Schedules; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5683867
  • Filename
    5683867