DC programming and DCA for enhancing physical layer security via relay beamforming strategies

Beside of cryptography-the primary traditional methods for ensuring information security and confidentiality, the appearance of the physical layer security approach plays an important role for not only enabling the data transmission confidentially without relying on higher-layer encryption, but also...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 15; no. 7; pp. 2377 - 2405
Main Authors Tran, Thi Thuy, Pham Thi, Hoai An, Pham Dinh, Tao, Nguyen, Nhu Tuan
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Springer Verlag
Subjects
Computational Intelligence
Computer Science
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Physical layer security
DC programming and DCA
Decode-and-forward
Amplify-and-forward
Relay beamforming
Online AccessGet full text

Cover

More Information
Summary:Beside of cryptography-the primary traditional methods for ensuring information security and confidentiality, the appearance of the physical layer security approach plays an important role for not only enabling the data transmission confidentially without relying on higher-layer encryption, but also enhancing confidentiality of the secret key distribution in cryptography. Many techniques are employed in physical layers to improve secure transmission including cooperative relaying and beamforming technique. In this paper, we consider the secrecy rate maximization problems using two techniques mentioned above with two different relaying protocols: Amplify-and-Forward and Decode-and-Forward. The optimization problems with the aim of maximizing secrecy rate subject to total and individual relay power constraints are formulated as nonconvex problems, which can be reformulated as DC (difference of two convex functions) programs and thus can be solved by DC Algorithms (DCA). The special structure of feasible set is exploited which results to an efficient DC decomposition in the sense that it leads to convex subproblems that can be explicitly solved. The numerical results show that the proposed DCA schemes are better than the existing methods in terms of both runtime and secrecy rate.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-020-01696-8