Learning with the Bandit: A Cooperative Spectrum Selection Scheme for Cognitive Radio Networks

Distributed spectrum allocation in Cognitive Radio (CR) systems requires each Secondary User (SU) to learn the optimal spectrum policy which maximizes the network performance while minimizing the impact to the Primary Users (PUs). To this aim, each SU must rely on local sensing information which however can be biased by interference and fading effects on the received signal. Thus, if each SU works in isolation, the convergence to the system-wide optimal policy can not be guaranteed. In this paper, we formulate the spectrum allocation problem as a cooperative learning task in which each SU can learn the spectrum availability of each channel and share such knowledge with the other SUs. We propose a correlation model through which different SUs can leverage the experience of other nodes, and we integrate it into a distributed channel allocation scheme. At the same time, we investigate mechanisms to bound the cooperation overhead based on the performance of the distributed learning process. Simulation results confirm the ability of the cooperative learning scheme in providing higher sensing accuracy and convergence time when compared with noncooperative spectrum allocation schemes for CR networks.