TY - GEN
T1 - PNC-Aided Robust Secure Beamforming Design for Two-Way Relay Networks with Artificial Noise
AU - Hao, Yunqin
AU - Lv, Tiejun
AU - Zeng, Jie
AU - Huang, Pingmu
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.
AB - In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.
UR - http://www.scopus.com/inward/record.url?scp=85070203860&partnerID=8YFLogxK
U2 - 10.1109/ICC.2019.8761317
DO - 10.1109/ICC.2019.8761317
M3 - Conference contribution
AN - SCOPUS:85070203860
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -