King's College London

Research portal

Robust sum secrecy rate optimization for MIMO two-way full duplex systems

Research output: Chapter in Book/Report/Conference proceedingConference paper

Zheng Chu, Tuan Anh Le, Huan X. Nguyen, Arumugam Nallanathan, Mehmet Karamanoglu

Original languageEnglish
Title of host publication2017 IEEE 86th Vehicular Technology Conference, VTC Fall 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
Volume2017-September
ISBN (Electronic)9781509059355
DOIs
Publication statusPublished - 8 Feb 2018
Event86th IEEE Vehicular Technology Conference, VTC Fall 2017 - Toronto, Canada
Duration: 24 Sep 201727 Sep 2017

Conference

Conference86th IEEE Vehicular Technology Conference, VTC Fall 2017
CountryCanada
CityToronto
Period24/09/201727/09/2017

King's Authors

Abstract

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.

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454