TY - GEN
T1 - Joint relay selection and artificial jamming power allocation for secure DF relay networks
AU - Wang, Chao
AU - Wang, Hui Ming
PY - 2014
Y1 - 2014
N2 - This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a 'best' cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.
AB - This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a 'best' cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.
UR - https://www.scopus.com/pages/publications/84906724067
U2 - 10.1109/ICCW.2014.6881301
DO - 10.1109/ICCW.2014.6881301
M3 - 会议稿件
AN - SCOPUS:84906724067
SN - 9781479946402
T3 - 2014 IEEE International Conference on Communications Workshops, ICC 2014
SP - 819
EP - 824
BT - 2014 IEEE International Conference on Communications Workshops, ICC 2014
PB - IEEE Computer Society
T2 - 2014 IEEE International Conference on Communications Workshops, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -