Opportunistic Dynamic Channel Allocation Based on Chain Store Game

In adaptive secondary user channel allocation of cognitive radio, some users finish communication and release their channel as the time goes by, while some newcomers request channel resources to communicate. Thus, it is necessary to consider spectrum allocation process from the temporal perspective. In this paper, secondary users are modeled to a dynamic game similar to the chain store game, by which each user is able to achieve the equilibrium state adaptively without a central coordinator. We investigate the game through analyzing of correlated equilibria, which is computed easily and exhibits better results than Nash equilibria. We import some signal mechanisms based on time and sequence number that help users to achieve the correlated equilibria. The game algorithms based on correlated equilibrium are presented. The experimental results shows that our method have obvious superiorities to other allocation algorithms.