Hybrid Cooperative Beamforming and Jamming for Physical-Layer Security of Two-Way Relay Networks

被引:187
作者
Wang, Hui-Ming [1 ,2 ]
Luo, Miao [1 ,2 ]
Yin, Qinye [1 ,2 ]
Xia, Xiang-Gen [3 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Peoples R China
[2] Xi An Jiao Tong Univ, Minist Educ, Key Lab Intelligent Networks & Network Secur, Xian 710049, Peoples R China
[3] Univ Delaware, Dept Elect & Comp Engn, Newark, DE 19716 USA
基金
高等学校博士学科点专项科研基金; 美国国家科学基金会;
关键词
Physical layer security; secrecy rate; two-way relay networks; distributed beamforming; semi-definite programming; penalty function method; SECRECY CAPACITY; CHANNEL; TRANSMISSION;
D O I
10.1109/TIFS.2013.2287046
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we propose a hybrid cooperative beamforming and jamming scheme to enhance the physical-layer security of a single-antenna-equipped two-way relay network in the presence of an eavesdropper. The basic idea is that in both cooperative transmission phases, some intermediate nodes help to relay signals to the legitimate destination adopting distributed beamforming, while the remaining nodes jam the eavesdropper, simultaneously, which takes the data transmissions in both phases under protection. Two different schemes are proposed, with and without the instantaneous channel state information of the eavesdropper, respectively, and both are subjected to the more practical individual power constraint of each cooperative node. Under the general channel model, it is shown that both problems can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. A current state of the art technique for handling such a problem is the semi-definite relaxation (SDR) and randomization techniques. In this paper, however, we propose a penalty function method incorporating the rank-1 constraint into the objective function. Although the so-obtained problem is not convex, we develop an efficient iterative algorithm to solve it. Each iteration is a convex SDP problem, thus it can be efficiently solved using the interior point method. When the channels are reciprocal such as in TDD mode, we show that the problems become second-order convex cone programming ones. Numerical evaluation results are provided and analyzed to show the properties and efficiency of the proposed hybrid security scheme, and also demonstrate that our optimization algorithms outperform the SDR technique.
引用
收藏
页码:2007 / 2020
页数:14
相关论文
共 51 条
[1]  
[Anonymous], 2010, 2010 44 ANN C INF SC, DOI DOI 10.1109/CISS.2010.5464970
[2]  
[Anonymous], P IEEE ICC
[3]  
[Anonymous], P 4 INT C SIGN PROC
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[5]   Time-Slotted Round-Trip Carrier Synchronization for Distributed Beamforming [J].
Brown, D. Richard, III ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (11) :5630-5643
[6]  
Chen J., 2011, Proceedings of 2011 International Green Computing Conference and Workshops, P1
[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]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[9]   Improving Wireless Physical Layer Security via Cooperating Relays [J].
Dong, Lun ;
Han, Zhu ;
Petropulu, Athina P. ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (03) :1875-1888
[10]   Secrecy in Cooperative Relay Broadcast Channels [J].
Ekrem, Ersen ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (01) :137-155