TY - GEN
T1 - Alternating optimization for MIMO secrecy channel with a cooperative jammer
AU - Chu, Zheng
AU - Johnston, Martin
AU - Le Goff, Stephane
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/7/1
Y1 - 2015/7/1
N2 - This paper proposes an alternating optimization algorithm for addressing the secrecy rate optimization problem for a multi-input-multi- output (MIMO) secrecy channel in the presence of a multiantenna eavesdropper, where a multiantenna cooperative jammer will be employed to confuse the eavesdropper by introducing jamming signal. We investigate the secrecy rate maximization problem, which is a non-convex problem in terms of transmit covariance matrices of the legitimate transmitter and the cooperative jammer. In order to circumvent this issue, we develop an optimization algorithm by alternating optimizing the transmit covariance matrices of the legitimate transmitter and the cooperative jammer where each transmit covariance matrix is optimized while other is fixed. Based on this algorithm, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploiting S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming (SDP). Simulation results have been provided to validate the convergence and the performance of the alternating algorithm.
AB - This paper proposes an alternating optimization algorithm for addressing the secrecy rate optimization problem for a multi-input-multi- output (MIMO) secrecy channel in the presence of a multiantenna eavesdropper, where a multiantenna cooperative jammer will be employed to confuse the eavesdropper by introducing jamming signal. We investigate the secrecy rate maximization problem, which is a non-convex problem in terms of transmit covariance matrices of the legitimate transmitter and the cooperative jammer. In order to circumvent this issue, we develop an optimization algorithm by alternating optimizing the transmit covariance matrices of the legitimate transmitter and the cooperative jammer where each transmit covariance matrix is optimized while other is fixed. Based on this algorithm, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploiting S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming (SDP). Simulation results have been provided to validate the convergence and the performance of the alternating algorithm.
KW - Alternating algorithm
KW - Convex optimization
KW - MIMO wiretap channel
KW - Physical-layer secrecy
UR - http://www.scopus.com/inward/record.url?scp=84940421773&partnerID=8YFLogxK
U2 - 10.1109/VTCSpring.2015.7145675
DO - 10.1109/VTCSpring.2015.7145675
M3 - Conference contribution
AN - SCOPUS:84940421773
T3 - IEEE Vehicular Technology Conference
BT - 2015 IEEE 81st Vehicular Technology Conference, VTC Spring 2015 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 81st IEEE Vehicular Technology Conference, VTC Spring 2015
Y2 - 11 May 2015 through 14 May 2015
ER -