Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (2): 18-22.doi: 10.13190/j.jbupt.2014.02.005

Previous Articles     Next Articles

Dynamic Spectrum Access Algorithm Based on Graphical Game in Distributed Wireless Network

LI Fang-wei, TANG Yong-chuan, ZHU Jiang, ZHANG Hai-bo   

  1. Chongqing Key Laboratory of Mobile Communications Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2013-05-22 Online:2014-04-28 Published:2014-04-08

Abstract:

To solve the dimension disaster problem from the arbitrariness and complexity of user-relationship topology in distributed wireless network, a dynamic spectrum access algorithm is presented based on graphical game. Relying on information asymmetry environment, the users accessing channel is modeled as a graphical game so as to construct a new internal game in realistic environment. Pure-strategy Nash equilibrium without conflict is obtained by minimizing the regret value of person instead of that of system. Compared to the existing literatures, the algorithm can reduce the computing complexity effectively and meet the real-time communication requirements. Simulation results show that the pure-strategy Nash equilibrium achieves better system performance in terms of capacity and power utilization, specifically in the system with scare resources.

Key words: distributed wireless network, graphical game, Nash equilibrium, dynamic spectrum access

CLC Number: