Large-System Analysis of Artificial-Noise-Assisted Communication in the Multiuser Downlink: Ergodic Secrecy Sum Rate and Optimal Power Allocation

被引:44
作者
Li, Na [1 ]
Tao, Xiaofeng [1 ]
Wu, Huici [1 ]
Xu, Jin [1 ]
Cui, Qimei [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Natl Engn Lab Mobile Network Secur, Wireless Technol Innovat WTI Inst, Beijing 100876, Peoples R China
关键词
Artificial noise (AN); large system (LS) analysis; optimal power allocation (PA); physical layer (PHY) security; regularized channel inversion (RCI); MIMO BROADCAST CHANNELS; PHYSICAL LAYER SECURITY; LIMITED CSI FEEDBACK; WIRETAP CHANNEL; CONFIDENTIAL MESSAGES; CAPACITY REGION; ACHIEVABLE RATES; FADING CHANNELS; TRANSMISSION; NETWORKS;
D O I
10.1109/TVT.2015.2493178
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Security and privacy have become increasingly critical demands in wireless networks, which, however, are particularly susceptible to eavesdropping attacks due to the broadcast nature of radio signals. This paper considers the problem of secure communication in the multiuser downlink with a passive eavesdropper (Eve), whose channel state information (CSI) is unavailable. The transmitter simultaneously transmits concurrent information signals to the users and artificial noise (AN) to Eve. We first assume that all users' CSI is perfectly known by the transmitter and derive a closed-form expression for the ergodic secrecy sum rate (SSR) in the large-system limit. We then use it as an objective function to optimize the power allocation between information signals and the AN. It shows that more power needs to be used for AN when Eve has more antennas and when the system serves fewer users. We also extend the analysis to the imperfect-CSI scenario, where the SSR saturates at high transmit power, and it is better to create more AN than to increase the signal strength when the channel estimation error is large. We derive a scale law of feedback bits (for frequency-division duplexing (FDD) systems) to maintain a constant rate offset compared with the perfect-CSI case and the optimal length of training sequence (for time-division duplexing (TDD) systems) to maximize the effective SSR. It shows that more feedback bits and longer training sequences are required to deal with the eavesdropping problem. Closed-form expressions derived in this paper can reduce the complexity of system analysis and design.
引用
收藏
页码:7036 / 7050
页数:15
相关论文
共 40 条
[1]  
[Anonymous], 2004, RANDOM MATRIX THEORY
[2]  
[Anonymous], 2001, Matrix Analysis and Applied Linear Algebra
[3]   The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel [J].
Bagherikaram, Ghadamali ;
Motahari, Abolfazl Seyed ;
Khandani, Amir Keyvan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) :2673-2682
[4]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[5]   Multiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback [J].
Caire, Giuseppe ;
Jindal, Nihar ;
Kobayashi, Mari ;
Ravindran, Niranjay .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (06) :2845-2866
[6]   Enhanced Secrecy in Stochastic Wireless Networks: Artificial Noise With Secrecy Protected Zone [J].
Chae, Seong Ho ;
Choi, Wan ;
Lee, Jung Hoon ;
Quek, Tony Q. S. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2014, 9 (10) :1617-1628
[7]   Performance Analysis for Physical Layer Security in Multi-Antenna Downlink Networks with Limited CSI Feedback [J].
Chen, Xiaoming ;
Yin, Rui .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2013, 2 (05) :503-506
[8]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[9]   The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel [J].
Ekrem, Ersen ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) :2083-2114
[10]   Large system performance of linear multiuser receivers in multipath fading channels [J].
Evans, J ;
Tse, DNC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) :2059-2078