9th International Conference on Communications and Networking in China

Research Article

Spectrum Access Mechanism Based on Graphical Evolutionary Game for Radio Network

  • @INPROCEEDINGS{10.4108/icst.chinacom.2014.256252,
        author={Fangwei Li and Yinghui Yuan and Jiang Zhu and Haibo Zhang},
        title={Spectrum Access Mechanism Based on Graphical Evolutionary Game for Radio Network},
        proceedings={9th International Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2015},
        month={1},
        keywords={spectrum access mechanism graphical evolutionary game dynamic equation nash equilibrium},
        doi={10.4108/icst.chinacom.2014.256252}
    }
    
  • Fangwei Li
    Yinghui Yuan
    Jiang Zhu
    Haibo Zhang
    Year: 2015
    Spectrum Access Mechanism Based on Graphical Evolutionary Game for Radio Network
    CHINACOM
    IEEE
    DOI: 10.4108/icst.chinacom.2014.256252
Fangwei Li1, Yinghui Yuan1,*, Jiang Zhu1, Haibo Zhang1
  • 1: Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing, China
*Contact email: yuanyinghuigo@163.com

Abstract

In order to realize efficient data transmission for multiple bounded rationality users sharing multiple channels in radio network, a spectrum access mechanism based on graphical evolutionary game is proposed. The mechanism can reflect the real game relationship among users, thus simplifying the complexity of the game. Meanwhile, a dynamic spectrum access algorithm with smaller complexity and corresponding dynamic equation are designed for the mechanism, converging to Nash equilibrium with faster speed and obtaining higher system throughput. At Nash equilibrium, the reward of individual user is identical on each channel and user having less neighboring users has higher reward. Theoretical analysis shows that the dynamic equation is globally asymptotically stable, which illustrates that when user deviates because of bounded rationality and it is still able to guarantee better performance and user’s deviation only affects its neighboring users, not spreading to the whole network. Simulation comparison verifies the superiority above.