Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Abstract

A pragmatic distributed algorithm (PDA) is proposed for supporting the efficient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The novelty of our PDA is that the PUs negotiate with the CUs concerning the specific amount of relaying and transmission time, the CU is granted, which the CU will either accept or decline. The CUs may serve as relay nodes for relaying the signal received from the PUs to their destinations, while both the PUs' and the CUs' minimum rate requirements are satisfied. This will reduce the required transmission power and/or increase the transmission rate of the PU. Our results show that the proposed scheme performs better than the benchmarker, despite its significantly lower overhead and complexity. Moreover, we show that the cooperative spectral access based on our PDA reaches an equilibrium, when it is repeated for a sufficiently long duration. These benefits are achieved, because the PUs are motivated to cooperate by the incentive of achieving a higher PU rate, whilst non-cooperation can be discouraged with the aid of a limited-duration punishment. Furthermore, we invoke an attractive practical adaptive Turbo Trellis Coded Modulation (ATTCM) scheme, which appropriately adjusts the code rate and the modulation mode according to the near-instantaneous channel conditions. It was found that the joint design of coding, modulation and user-cooperation may lead to significant mutual benefits for all the PUs and the CUs.