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

被引:167
作者
Chu, Zheng [1 ]
Cumanan, Kanapathippillai [1 ]
Ding, Zhiguo [1 ,2 ]
Johnston, Martin [1 ]
Le Goff, Stephane Y. [1 ]
机构
[1] Newcastle Univ, Sch Elect & Elect Engn, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
[2] Jiangnan Univ, Sch Elect Engn, Wuxi 214122, Peoples R China
基金
英国工程与自然科学研究理事会;
关键词
Convex optimization; multiple-input multiple-output (MIMO) system; physical-layer secrecy; robust optimization; secrecy capacity; Stackelberg game; CASE PERFORMANCE OPTIMIZATION; GAUSSIAN WIRETAP CHANNEL; ARTIFICIAL-NOISE; RELAY SELECTION; COMMUNICATION; TRANSMISSION; SECURITY;
D O I
10.1109/TVT.2014.2336092
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1833 / 1847
页数:15
相关论文
共 32 条
[1]  
[Anonymous], TRANSMITTER OPTIMIZA
[2]  
[Anonymous], P INT S INF THEOR AP
[3]  
[Anonymous], 2011, Game Theory in Wireless and Communication Networks: Theory, Models and Applications
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION
[5]  
Boyd S., 1994, STUDIES APPL NUMERIC
[6]  
Boyd S., 2003, Lecture Notes of EE392o
[7]   Joint Relay and Jammer Selection for Secure Two-Way Relay Networks [J].
Chen, Jingchao ;
Zhang, Rongqing ;
Song, Lingyang ;
Han, Zhu ;
Jiao, Bingli .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (01) :310-320
[8]   Robust Interference Control Techniques for Multiuser Cognitive Radios Using Worst-Case Performance Optimization [J].
Cumanan, K. ;
Krishna, R. ;
Sharma, V. ;
Lambotharan, S. .
2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, :378-382
[9]   A Robust Beamforming Based Interference Control Technique and its Performance for Cognitive Radios. [J].
Cumanan, K. ;
Krishna, R. ;
Sharma, V. ;
Lambotharan, S. .
2008 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES, 2008, :9-13
[10]   Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Multiple-Antenna Eavesdropper [J].
Cumanan, Kanapathippillai ;
Ding, Zhiguo ;
Sharif, Bayan ;
Tian, Gui Yun ;
Leung, Kin K. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (04) :1678-1690