Distributed Game theory-based Routing protocol for Cognitive Radio ad hoc networks

Cognitive Radio technology is emerged as a platform to solve the problem of spectrum scarcity in wireless networks. Whenever designing a routing algorithm for cognitive radio ad hoc networks, the aggregate interference from secondary users to the primary user must be considered. In this paper, a Distributed Game theory-based Routing algorithm (DGR) is proposed. The proposed routing algorithm not only considers the interference between Secondary Users (SUs) but also the aggregate interference from SUs to the Primary User (PU). The proposed relay selection scheme prefers to select an upstream neighbor who has participated less in the network´s transmissions and is far away from the PU. DGR algorithm is distributed, that avoids the high cost of centralized coordination, high information-gathering delay, and single point of failure problems. Simulation results show that the proposed algorithm can find shorter routes with lower interference to the PU, compared to the previous one.