TY - GEN
T1 - Secrecy rate maximization for SIMO wiretap channel with uncoordinated cooperative jamming under secrecy outage probability constraint
AU - Hu, Xiaoyan
AU - Mu, Pengcheng
AU - Wang, Bo
AU - Li, Zongmian
AU - Wang, Hui Ming
AU - Ju, Ying
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/12
Y1 - 2016/9/12
N2 - A practical uncoordinated cooperative jamming (UCJ) scheme with multiple single-Antenna helpers is proposed in this paper to enhance the physical layer security of single-input-multiple-output (SIMO) wiretap channel. In the scheme, both the intended receiver and the eavesdropper are equipped with multiple antennas and apply the minimum mean-square error (MMSE) combiner. The multiple uncoordinated single-Antenna helpers transmit jamming signals independently to confound the eavesdropper, and we focus on power allocation for the helpers to solve the secrecy rate maximization (SRM) problem. Assuming that the statistical channel state information (CSI) concerning the eavesdropper is available, a convex conservative secrecy outage probability (SOP) constraint is derived and then used to solve the SRM problem with DC (difference of convex function) programming method. Furthermore, a bisection-like refinement method is provided to find a quality solution of the SRM problem with the original SOP constraint. Numerical results show that the proposed scheme has good secrecy performance especially when the number of helpers is large.
AB - A practical uncoordinated cooperative jamming (UCJ) scheme with multiple single-Antenna helpers is proposed in this paper to enhance the physical layer security of single-input-multiple-output (SIMO) wiretap channel. In the scheme, both the intended receiver and the eavesdropper are equipped with multiple antennas and apply the minimum mean-square error (MMSE) combiner. The multiple uncoordinated single-Antenna helpers transmit jamming signals independently to confound the eavesdropper, and we focus on power allocation for the helpers to solve the secrecy rate maximization (SRM) problem. Assuming that the statistical channel state information (CSI) concerning the eavesdropper is available, a convex conservative secrecy outage probability (SOP) constraint is derived and then used to solve the SRM problem with DC (difference of convex function) programming method. Furthermore, a bisection-like refinement method is provided to find a quality solution of the SRM problem with the original SOP constraint. Numerical results show that the proposed scheme has good secrecy performance especially when the number of helpers is large.
UR - https://www.scopus.com/pages/publications/84989892442
U2 - 10.1109/WCNC.2016.7564991
DO - 10.1109/WCNC.2016.7564991
M3 - 会议稿件
AN - SCOPUS:84989892442
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016
Y2 - 3 April 2016 through 7 April 2016
ER -