A full-duplex relay selection strategy based on potential game in cognitive cooperative networks

摘要

In this paper, we study the full-duplex relay selection strategy based on a potential game in a cognitivecooperative network under the interference power constraint from secondary users to theprimary receivers, thetotal available transmissionpowerconstraint for thesecondary system,andthe self-interference constraint at each secondary relay. The relay selection problem is modeledas a non-cooperative game where the total rate of a cognitive cooperative network has commonutility. Then, we prove that the game is a potential game that has at least a pure strategy Nashequilibrium (NE), and the optimal strategy set that able to maximize cognitive cooperative systemrate is also a pure strategy NE of the proposed game model. On the premise of having no informationof infeasible strategy sets, we solve the feasibility conditions of the pure NE in the proposedgame. Furthermore, we propose a cognitive full-duplex relay iterative algorithm that can achievea pure strategy NE, and the complexity and the convergence of the proposed algorithm are studied.Simulation results show that the proposed algorithm can achieve optimal or near optimalrate performance with low complexity and offers significant performance gain compared with thetraditional half-duplex mode.