TY - GEN
T1 - AN-Based beamforming design in secrecy heterogeneous WSN with MIMO-SWIPT
AU - Zhu, Zhengyu
AU - Ge, Weili
AU - Wang, Ning
AU - Wang, Yi
AU - Hao, Wanming
AU - Chu, Zheng
AU - Wang, Zhongyong
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - In this paper, we study the physical layer security in a two-tier heterogeneous wireless sensor networks (HWSN) based on simultaneous wireless information and power transfer (SWIPT) approach. Joint optimization problem of the transmit beamforming vector at the macrocell and femtocell, the artificial noise (AN) vector, and the power splitting ratio is modeled to maximize the minimal secrecy capacity of the wiretapped macrocell sensor nodes while considering the fairness among multiple M-SNs. In order to reduce the performance loss of the rank relaxation, we apply successive convex approximation (SCA) technique, first-order Taylor series expansion and sequential parametric convex approximation approach to transform the max-min program to a second order cone programming (SOCP) problem to iterate to a near-optimal solution. In addition, a novel SCA-based iterative algorithm is proposed while its convergence property is proved. The simulation shows that our SCA-based method outperforms the conventional methods.
AB - In this paper, we study the physical layer security in a two-tier heterogeneous wireless sensor networks (HWSN) based on simultaneous wireless information and power transfer (SWIPT) approach. Joint optimization problem of the transmit beamforming vector at the macrocell and femtocell, the artificial noise (AN) vector, and the power splitting ratio is modeled to maximize the minimal secrecy capacity of the wiretapped macrocell sensor nodes while considering the fairness among multiple M-SNs. In order to reduce the performance loss of the rank relaxation, we apply successive convex approximation (SCA) technique, first-order Taylor series expansion and sequential parametric convex approximation approach to transform the max-min program to a second order cone programming (SOCP) problem to iterate to a near-optimal solution. In addition, a novel SCA-based iterative algorithm is proposed while its convergence property is proved. The simulation shows that our SCA-based method outperforms the conventional methods.
UR - http://www.scopus.com/inward/record.url?scp=85070258025&partnerID=8YFLogxK
U2 - 10.1109/ICCW.2019.8756686
DO - 10.1109/ICCW.2019.8756686
M3 - Conference contribution
AN - SCOPUS:85070258025
T3 - 2019 IEEE International Conference on Communications Workshops, ICC Workshops 2019 - Proceedings
BT - 2019 IEEE International Conference on Communications Workshops, ICC Workshops 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications Workshops, ICC Workshops 2019
Y2 - 20 May 2019 through 24 May 2019
ER -