TY - GEN
T1 - Robust sum secrecy rate optimization for MIMO two-way full duplex systems
AU - Chu, Zheng
AU - Le, Tuan Anh
AU - Nguyen, Huan X.
AU - Nallanathan, Arumugam
AU - Karamanoglu, Mehmet
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm-bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.
AB - This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm-bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.
UR - http://www.scopus.com/inward/record.url?scp=85045267667&partnerID=8YFLogxK
U2 - 10.1109/VTCFall.2017.8288039
DO - 10.1109/VTCFall.2017.8288039
M3 - Conference contribution
AN - SCOPUS:85045267667
T3 - IEEE Vehicular Technology Conference
SP - 1
EP - 5
BT - 2017 IEEE 86th Vehicular Technology Conference, VTC Fall 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 86th IEEE Vehicular Technology Conference, VTC Fall 2017
Y2 - 24 September 2017 through 27 September 2017
ER -