Toggle Main Menu Toggle Search

Open Access padlockePrints

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

Lookup NU author(s): Zheng Chu, Dr Kanapathippillai Cumanan, Dr Zhiguo Ding, Dr Martin Johnston, Dr Stephane Le Goff

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

In this paper, we study different secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, 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. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into a Stackelberg game where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, the Stackelberg equilibrium solution has been validated through numerical results.


Publication metadata

Author(s): Chu Z, Cumanan K, Ding ZG, Johnston M, Le Goff SY

Publication type: Article

Publication status: Published

Journal: IEEE Transactions on Vehicular Technology

Year: 2015

Volume: 64

Issue: 5

Pages: 1833-1847

Print publication date: 01/05/2015

Online publication date: 08/07/2014

ISSN (print): 0018-9545

ISSN (electronic): 1939-9359

Publisher: IEEE

URL: http://dx.doi.org/10.1109/TVT.2014.2336092

DOI: 10.1109/TVT.2014.2336092


Altmetrics

Altmetrics provided by Altmetric


Actions

Find at Newcastle University icon    Link to this publication


Share