Opportunistic Spectrum Access Using Partially Overlapping Channels: Graphical Game and Uncoupled Learning

Abstract

This article investigates the problem of distributed channel selection in opportunistic spectrum access (OSA) networks with partially overlapping channels (POC) using a game-theoretic learning algorithm. Compared with traditional non-overlapping channels (NOC), POC can increase the full-range spectrum utilization, mitigate interference and improve the network throughput. However, most existing POC approaches are centralized, which are not suitable for distributed OSA networks. We formulate the POC selection problem as an interference mitigation game. We prove that the game has at least one pure strategy NE point and the best pure strategy NE point minimizes the aggregate interference in the network. We characterize the achievable performance of the game by presenting an upper bound for aggregate interference of all NE points. In addition, we propose a simultaneous uncoupled learning algorithm with heterogeneous exploration rates to achieve the pure strategy NE points of the game. Simulation results show that the heterogeneous exploration rates lead to faster convergence speed and the throughput improvement gain of the proposed POC approach over traditional NOC approach is significant. Also, the proposed uncoupled learning algorithm achieves satisfactory performance when compared with existing coupled and uncoupled algorithms.