TY - GEN
T1 - Energy harvesting fairness in AN-Aided Secure MU-MIMO SWIPT systems with cooperative jammer
AU - Zhu, Zhengyu
AU - Chu, Zheng
AU - Wang, Ning
AU - Wang, Zhongyong
AU - Lee, Inkyu
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - In this paper, we study a multi-user multiple-inputmultiple- output secrecy simultaneous wireless information and power transfer (SWIPT) channel which consists of one transmitter, one cooperative jammer (CJ), multiple energy receivers (potential eavesdroppers, ERs), and multiple co-located receivers (CRs). We exploit the dual of artificial noise (AN) generation for facilitating efficient wireless energy transfer and secure transmission. Our aim is to maximize the minimum harvested energy among ERs and CRs subject to secrecy rate constraints for each CR and total transmit power constraint. By incorporating norm-bounded channel uncertainty model, we propose a iterative algorithm based on sequential parametric convex approximation to find a near-optimal solution. Finally, simulation results are presented to validate the performance of the proposed algorithm outperforms that of the conventional AN-aided scheme and CJaided scheme.
AB - In this paper, we study a multi-user multiple-inputmultiple- output secrecy simultaneous wireless information and power transfer (SWIPT) channel which consists of one transmitter, one cooperative jammer (CJ), multiple energy receivers (potential eavesdroppers, ERs), and multiple co-located receivers (CRs). We exploit the dual of artificial noise (AN) generation for facilitating efficient wireless energy transfer and secure transmission. Our aim is to maximize the minimum harvested energy among ERs and CRs subject to secrecy rate constraints for each CR and total transmit power constraint. By incorporating norm-bounded channel uncertainty model, we propose a iterative algorithm based on sequential parametric convex approximation to find a near-optimal solution. Finally, simulation results are presented to validate the performance of the proposed algorithm outperforms that of the conventional AN-aided scheme and CJaided scheme.
UR - http://www.scopus.com/inward/record.url?scp=85051437301&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422297
DO - 10.1109/ICC.2018.8422297
M3 - Conference contribution
AN - SCOPUS:85051437301
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Communications, ICC 2018
Y2 - 20 May 2018 through 24 May 2018
ER -