DocumentCode :
742956
Title :
Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer
Author :
Zheng Chu ; Cumanan, Kanapathippillai ; Zhiguo Ding ; Johnston, Martin ; Le Goff, Stephane Y.
Author_Institution :
Sch. of Electr. & Electron. Eng., Newcastle Univ., Newcastle upon Tyne, UK
Volume :
64
Issue :
5
fYear :
2015
fDate :
5/1/2015 12:00:00 AM
Firstpage :
1833
Lastpage :
1847
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.
Keywords :
MIMO communication; antenna arrays; cooperative communication; covariance matrices; game theory; jamming; mathematical programming; radio transmitters; telecommunication security; MIMO secrecy channel; S-procedure; Stackelberg equilibrium; Stackelberg game; Taylor series expansion; covariance matrix; game theory; jamming service; legitimate transmitter; multiantenna cooperative jammer; multiantenna eavesdropper; multiple-input-multiple-output secrecy channel; power minimization; secrecy rate maximization problems; secret communication; semidefinite programming; Covariance matrices; Jamming; Minimization; Optimization; Receivers; Robustness; Transmitters; Convex optimization; Stackelberg game; multiple-input multiple-output (MIMO) system; physical-layer secrecy; robust optimization; secrecy capacity;
fLanguage :
English
Journal_Title :
Vehicular Technology, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9545
Type :
jour
DOI :
10.1109/TVT.2014.2336092
Filename :
6848758
Link To Document :
بازگشت