Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Adaptive channel allocation spectrum etiquette for cognitive radio networks
Mobile Networks and Applications
Optimal channel probing and transmission scheduling for opportunistic spectrum access
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A negotiation game for multichannel access in cognitive radio networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
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
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we consider a noncooperative cognitive radio network with M selfish secondary users (SUs) opportunistically access N licensed channels. Every SU chooses one channel to sense and subsequently compete to access (based on the sensing outcome) to obtain the channel utility. Different channels may have different utilities. Each SU selfishly makes a sensing decision to maximize its obtained utility. The objective is to design an optimal sensing policy with maximum network throughput. This problem is formulated as a noncooperative game where a stable sensing policy reaches a Nash Equilibrium (NE). A novel greedy algorithm with great efficiency is proposed to calculate all pure-strategy NE for a large class of utility functions. By slight modification, the algorithm is able to reach an optimal pure-strategy NE with the maximum network throughput. The algorithm can be practically implemented as a MAC protocol in a distributed way with negligible communication overhead.