TY - JOUR
T1 - Secrecy-Optimized Resource Allocation for UAV-Assisted Relaying Networks
AU - Li, Bin
AU - Fei, Zesong
AU - Dai, Yueyue
AU - Zhang, Yan
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - Unmanned Aerial Vehicles (UAVs) communications have received increasing attention in both military and civilian applications due to low cost and ease of deployment. Security is an unavoidable yet challenging issue during the data transmission process of communication networks. In this paper, we concentrate on the resource allocation in secure relay network assisted by a UAV in the presence of multiple eavesdroppers. Our target is to maximize the secrecy rate by jointly designing the transmit beamformer and artificial noise subject to the transmit power constraint of UAV. The resulting optimization problem is highly intractable and the key observation is that the original optimization problem can be equivalently transformed into a two- level problem. In particular, the inner-level problem can be solved by exploiting Semi-Definite Relaxation (SDR) and Charnes-Cooper transformation techniques, and the outer-level problem is handled by performing one-dimensional algorithm. Also, the tightness of the rank-relaxation is analyzed. Finally, simulation results are provided to validate the performance of our proposed scheme.
AB - Unmanned Aerial Vehicles (UAVs) communications have received increasing attention in both military and civilian applications due to low cost and ease of deployment. Security is an unavoidable yet challenging issue during the data transmission process of communication networks. In this paper, we concentrate on the resource allocation in secure relay network assisted by a UAV in the presence of multiple eavesdroppers. Our target is to maximize the secrecy rate by jointly designing the transmit beamformer and artificial noise subject to the transmit power constraint of UAV. The resulting optimization problem is highly intractable and the key observation is that the original optimization problem can be equivalently transformed into a two- level problem. In particular, the inner-level problem can be solved by exploiting Semi-Definite Relaxation (SDR) and Charnes-Cooper transformation techniques, and the outer-level problem is handled by performing one-dimensional algorithm. Also, the tightness of the rank-relaxation is analyzed. Finally, simulation results are provided to validate the performance of our proposed scheme.
KW - UAV
KW - beamforming
KW - physical-layer security
KW - relay network
KW - secrecy rate
UR - http://www.scopus.com/inward/record.url?scp=85063503536&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2018.8647437
DO - 10.1109/GLOCOM.2018.8647437
M3 - Conference article
AN - SCOPUS:85063503536
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 8647437
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -