Browse by author
Lookup NU author(s): Dr Kanapathippillai Cumanan,
Dr Zhiguo Ding,
Professor Bayan Sharif,
Professor Gui Yun TianORCiD
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This paper studies different secrecy rate optimization problems for a multiple input multiple output (MIMO) secrecy channel. In particular, we consider a scenario where a communication through a MIMO channel is overheard by a multiple-antenna eavesdropper. In this secrecy network, we first investigate two secrecy rate optimization problems: a) power minimization, b) secrecy rate maximization. These optimization problems are not convex due to the non-convex secrecy rate constraint. However, by approximating this secrecy rate constraint based on Taylor series expansion, we propose iterative algorithms to solve these secrecy rate optimization problems. In addition, we provide the convergence analysis for the proposed algorithms. These iterative optimization approaches are developed under the assumption that the transmitter has the perfect channel state information. However, there are practical difficulties to have the perfect channel state information at the transmitter. Hence, robust secrecy rate optimization techniques based on the worstcase secrecy rate are considered by incorporating the channel uncertainties. By exploiting the S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming at low signal to noise ratios (SNRs). Simulation results have been provided to validate the convergence of the proposed algorithms. In addition, numerical results show that the proposed robust optimization techniques outperform the nonrobust schemes in terms of the worst-case secrecy rates and the achieved secrecy rates.
Author(s): Cumanan K, Ding Z, Sharif B, Tian GY, Leung KK
Publication type: Article
Publication status: Published
Journal: IEEE Transactions on Vehicular Technology
Print publication date: 09/10/2013
ISSN (print): 0018-9545
ISSN (electronic): 1939-9359
Altmetrics provided by Altmetric