Opportunistic dynamic channel allocation based on chain store game

Authors:
Jinglong Li;Ping Zhu;Xufa Wang
Affiliations:
Anhui Province Key Laboratory of Software in Computing and Communication, School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China;Anhui Province Key Laboratory of Software in Computing and Communication, School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China;Anhui Province Key Laboratory of Software in Computing and Communication, School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 6
Cited 0

Cognitive radio techniques for wide area networks

Proceedings of the 42nd annual Design Automation Conference
Utilization and fairness in spectrum assignment for opportunistic spectrum access

Mobile Networks and Applications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis and design of cognitive radio networks and distributed radio resource management algorithms

Analysis and design of cognitive radio networks and distributed radio resource management algorithms
Cognitive radio: brain-empowered wireless communications

IEEE Journal on Selected Areas in Communications
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.