Singleton Spectrum Mobility Games With Incomplete Information

In Cognitive Radio Networks (CRNs), Secondary Users (SUs) are provided opportunities to access Primary Users' (PUs') idle spectrums but the availability of spectrums is dynamic due to PUs' uncertain activities of channel reclamation. In this paper, the authors investigate such spectrum mobility by proposing Singleton Bayesian Spectrum Mobility Games based on the Singleton Congestion Games, where each SU distributively reselects one switch-to (and available) channel which can bring it the maximum SINR when the spectrum environment varies, accounting for other SUs' switching strategies at the same time. Unlike previous game-theoretic schemes for handling the spectrum mobility that assume SUs' complete knowledge of the CRN, they present their scheme in two information scenarios.

Provided by: Shanghai Institute of Applied Physics, Chinese Academy of Sciences Topic: Mobility Date Added: Nov 2012 Format: PDF

Find By Topic