Artificial Noise Assisted Secure Transmission for Distributed Antenna Systems

被引:54
作者
Wang, Hui-Ming [1 ,2 ]
Wang, Chao [1 ,2 ]
Ng, Derrick Wing Kwan [3 ]
Lee, Moon Ho [4 ]
Xiao, Jia [5 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[2] Xi An Jiao Tong Univ, MOE Key Lab Intelligent Networks & Network Secur, Xian 710049, Shaanxi, Peoples R China
[3] Univ New South Wales, Sch Elect Engn & Telecommu, Sydney, NSW 2052, Australia
[4] Chonbuk Natl Univ, Div Elect Engn, Jeonju 561756, South Korea
[5] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
关键词
Physical layer security; distributed antenna systems; artificial noise; random matrix theory; non-convex optimization; MISO WIRETAP CHANNELS; SECRECY; MIMO; DOWNLINK; ALLOCATION; CAPACITY; FEEDBACK; DESIGN;
D O I
10.1109/TSP.2016.2558164
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies the artificial noise (AN) assisted secure transmission for a distributed antenna systems (DAS). To avoid a significant overhead caused by full legitimate channel state information (CSI) acquisition, tracking and collection in the central processor, we propose a distributed AN scheme utilizing the large-scale CSI of the legitimate receiver and eavesdropper. Our objective is to maximize the ergodic secrecy rate (ESR) via optimizing the power allocation between the confidential signal and AN for each remote antenna (RA) under the per-antenna power constraint. Specifically, exploiting random matrix theory, we first establish an analytical expression of the achievable ESR, which leads to a non-convex optimization problem with multiple non-convex constraints in the form of high-order fixed-point equations. To handle the intractable constraints, we recast it into a max-min optimization problem, and propose an iterative block coordinate descent (BCD) algorithm to provide a stationary solution. The BCD algorithm is composed of three subproblems, where the first two subproblems are convex with closed-form solutions, and the last one is a convex-concave game whose saddle-point is located by a tailored barrier algorithm. Simulation results validate the effectiveness of the proposed iterative algorithm and show that our scheme not only reduces the system overhead greatly but also maintains a good secrecy performance.
引用
收藏
页码:4050 / 4064
页数:15
相关论文
共 45 条
[1]  
Bertsekas DP., 1999, NONLINEAR PROGRAMMIN
[2]  
Boyd S., 2004, Convex optimization, DOI [10.1017/cbo97805118044 41, 10.1017/CBO9780511804441]
[3]  
Couillet R., 2011, Random matrix methods for wireless communications
[4]   Virtual MIMO in Multi-Cell Distributed Antenna Systems: Coordinated Transmissions with Large-Scale CSIT [J].
Feng, Wei ;
Wang, Yanmin ;
Ge, Ning ;
Lu, Jianhua ;
Zhang, Junshan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (10) :2067-2081
[5]  
Ghosh A., 2014, MINIMAX CONVEX CONCA
[6]   Guaranteeing secrecy using artificial noise [J].
Goel, Satashu ;
Negi, Rohit .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (06) :2180-2189
[7]   On the secrecy capacity of fading channels [J].
Gopala, Praveen Kumar ;
Lai, Lifeng ;
El Gamal, Hesham .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) :4687-4698
[8]   On the convergence of the block nonlinear Gauss-Seidel method under convex constraints [J].
Grippo, L ;
Sciandrone, M .
OPERATIONS RESEARCH LETTERS, 2000, 26 (03) :127-136
[9]  
Hanlen L., 2003, P IEEE INT S INF THE, P6773
[10]   A Current Perspective on Distributed Antenna Systems for the Downlink of Cellular Systems [J].
Heath, Robert ;
Peters, Steven ;
Wang, Yi ;
Zhang, Jiayin .
IEEE COMMUNICATIONS MAGAZINE, 2013, 51 (04) :161-167