A full‐duplex relay selection strategy based on potential game in cognitive cooperative networks. (25th May 2018)

• Record Type: Journal Article
• Authors: Zhanjun, Liu; Zhaoyi, Li; Yuxia, Cheng; Xiaoge, Huang; Qianbin, Chen
• Other Names: Mei Lin guestEditor.; Yan Zhiguo guestEditor.; Shao Jie guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 9(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-05-25
• Subjects: cognitive cooperative network -- complexity -- full‐duplex -- potential game -- pure Nash equilibrium (NE) -- relay selection; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4635
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: In this paper, we study the full‐duplex relay selection strategy based on a potential game in a cognitive cooperative network under the interference power constraint from secondary users to the primary receivers, the total available transmission power constraint for the secondary system, and the self‐interference constraint at each secondary relay. The relay selection problem is modeled as a non‐cooperative game where the total rate of a cognitive cooperative network has common utility. Then, we prove that the game is a potential game that has at least a pure strategy Nash equilibrium (NE), and the optimal strategy set that able to maximize cognitive cooperative system rate is also a pure strategy NE of the proposed game model. On the premise of having no information of infeasible strategy sets, we solve the feasibility conditions of the pure NE in the proposed game. Furthermore, we propose a cognitive full‐duplex relay iterative algorithm that can achieve a 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 optimal rate performance with low complexity and offers significant performance gain compared with the traditional half‐duplex mode.