TY - JOUR
T1 - A Minorization-Maximization Algorithm for Maximizing the Secrecy Rate of the MIMOME Wiretap Channel
AU - Masood, Mudassir
AU - Ghrayeb, Ali
AU - Babu, Prabhu
AU - Khalil, Issa
AU - Hasna, Mazen
N1 - Funding Information:
This work was made possible by NPRP grant NPRP 8-052-2-029 from the Qatar National Research Fund (a member of Qatar Foundation).
Publisher Copyright:
© 1997-2012 IEEE.
PY - 2017/3
Y1 - 2017/3
N2 - We consider physical layer security in a multi-input multi-output multi-eavesdropper wiretap channel and present an exact solution to the problem of secrecy rate maximization. A system model with multiple multi-antenna eavesdroppers and multiple multi-antenna full-duplex receivers is considered, which is general enough such that models existing in the literature may be considered as special cases. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receivers. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem exactly and the results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach.
AB - We consider physical layer security in a multi-input multi-output multi-eavesdropper wiretap channel and present an exact solution to the problem of secrecy rate maximization. A system model with multiple multi-antenna eavesdroppers and multiple multi-antenna full-duplex receivers is considered, which is general enough such that models existing in the literature may be considered as special cases. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receivers. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem exactly and the results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach.
KW - MIMOME
KW - minorization-maximization
KW - physical layer security
KW - secrecy rate maximization
UR - http://www.scopus.com/inward/record.url?scp=85015968252&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015968252&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2016.2628892
DO - 10.1109/LCOMM.2016.2628892
M3 - Article
AN - SCOPUS:85015968252
SN - 1089-7798
VL - 21
SP - 520
EP - 523
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 3
M1 - 7776840
ER -