Secure communication design for multi‐user peer‐to‐peer wireless relay networks. Issue 7 (1st May 2016)

• Record Type: Journal Article
• Authors: Gong, Xiangwu; Long, Hang; Dong, Feihong; Yin, Hao
• Is Part Of: IET communications. Volume 10:Issue 7(2016)
• Page Start: 770
• Page End: 777
• Publication Date: 2016-05-01
• Subjects: relay networks (telecommunication) -- radio networks -- peer‐to‐peer computing -- amplify and forward communication -- protocols -- minimisation -- minimax techniques -- nonlinear programming -- concave programming -- polynomials -- relaxation theory -- convex programming -- gradient methods -- computer network security; secure wireless communication design -- multiuser peer‐to‐peer wireless relay network -- physical layer security technique -- amplify‐and‐forward protocol -- secrecy rate maximisation -- max‐min achievable secrecy rate problem -- nonlinear optimisation problem -- nonconvex optimisation problem -- mathematical analysis -- polynomial time algorithm -- power minimisation problem -- total power optimisation problem -- relaxation technique -- convex problem -- gradient‐based algorithm -- numerical evaluation; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2015.0609
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : In this study, physical layer security techniques are studied for multi‐user peer‐to‐peer relay networks using amplify‐and‐forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisation. First, considering user fairness, the authors study the max–min achievable secrecy rate problem subject to a total transmit power constraint. Mathematically, the optimisation problem is non‐linear and non‐convex. They propose a polynomial time algorithm based on the bisection technique to solve it. Second, they study the total transmit power minimisation problem which aims at minimising the total transmit power at relays such that individual secrecy rate for each user is satisfied. The total power optimisation problem is also non‐convex, so they use the relaxation technique to transform it into a convex problem which can be efficiently solved by the gradient‐based algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results shows that the proposed designs can significantly improve the performance of secure wireless communications.