Repeated open spectrum sharing game with cheat-proof strategies

  • Authors:

  • Yongle Wu;Beibei Wang;K. J. Ray Liu;T. Charles Clancy

  • Affiliations:

  • Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, MD;Laboratory for Telecommunications Sciences, US Department of Defense, College Park, MD

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Dynamic spectrum access has become a promising approach to improve spectrum efficiency by adaptively coordinating different users' access according to spectrum dynamics. However, users who are competing with each other for spectrum may have no incentive to cooperate, and they may even exchange false private information about their channel conditions in order to get more access to the spectrum. In this paper, we propose a repeated spectrum sharing game with cheat-proof strategies. By using the punishment-based repeated game, users get the incentive to share the spectrum in a cooperative way; and through mechanism-design-based and statistics-based approaches, user honesty is further enforced. Specific cooperation rules have been proposed based on the maximum total throughput and proportional fairness criteria. Simulation results show that the proposed scheme can greatly improve the spectrum efficiency by alleviating mutual interference.