TY - JOUR
T1 - Artificial Noise Assisted Secure Transmission for Distributed Antenna Systems
AU - Wang, Hui Ming
AU - Wang, Chao
AU - Ng, Derrick Wing Kwan
AU - Lee, Moon Ho
AU - Xiao, Jia
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2016/8/1
Y1 - 2016/8/1
N2 - 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.
AB - 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.
KW - artificial noise
KW - distributed antenna systems
KW - non-convex optimization
KW - Physical layer security
KW - random matrix theory
UR - https://www.scopus.com/pages/publications/84978933095
U2 - 10.1109/TSP.2016.2558164
DO - 10.1109/TSP.2016.2558164
M3 - 文章
AN - SCOPUS:84978933095
SN - 1053-587X
VL - 64
SP - 4050
EP - 4064
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 15
M1 - 7458901
ER -