Joint 3-D Trajectory and Resource Optimization in Multi-UAV-Enabled IoT Networks With Wireless Power Transfer

被引:61
作者
Luo, Weiran [1 ,2 ]
Shen, Yanyan [1 ]
Yang, Bo [3 ,4 ]
Wang, Shuqiang [1 ]
Guan, Xinping [3 ,4 ]
机构
[1] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518000, Peoples R China
[2] Univ Chinese Acad Sci, Shenzhen Coll Adv Technol, Shenzhen 518000, Peoples R China
[3] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[4] Shanghai Jiao Tong Univ, Key Lab Syst Control & Informat Proc, Minist Educ, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Trajectory; Data collection; Two dimensional displays; Unmanned aerial vehicles; Three-dimensional displays; Energy consumption; Optimization; 3-D trajectory; energy harvesting; minimum data collection rate maximization; probabilistic line-of-sight (LoS) model; unmanned aerial vehicle (UAV) communication; VEHICLE BASE STATION; COMMUNICATION; DESIGN; MAXIMIZATION; PLACEMENT; SYSTEM;
D O I
10.1109/JIOT.2020.3041303
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article studies the data collection problem in an Internet-of-Things (IoT) network with multiple unmanned aerial vehicles (UAVs) where UAVs first power multiple IoT devices by wireless power transfer, and then IoT devices utilize the harvested energy to transmit data to UAVs. Different from most of the existing works that often assume the channel between the UAV and the IoT device is a simplified Line-of-Sight (LoS) channel, a more practical and accurate probabilistic LoS channel model is adopted, in which both the elevation angle and the distance between the UAV and the IoT device determine the channel gain. Our objective is to maximize the UAV's minimum data collection rate among all IoT devices by jointly optimizing time allocation and 3-D trajectory of UAVs within a limited time duration. This results in a nonconvex optimization problem, which is challenge to solve. To tackle this difficulty, we transform the nonconvex problem to a difference of convex (D.C.) optimization problem by subtly using several methods. To solve the D.C. optimization problem, an efficient iterative algorithm is designed via a successive convex approximation method. Numerical simulation results are provided to verify the performance of the proposed algorithm compared to two benchmark algorithms, the algorithm with simplified LoS model and that with 2-D trajectory optimization, under various conditions.
引用
收藏
页码:7833 / 7848
页数:16
相关论文
共 37 条
[11]  
Ebrahimi D, 2018, IEEE GLOB COMM CONF
[12]   Semidefinite Approximations of the Matrix Logarithm [J].
Fawzi, Hamza ;
Saunderson, James ;
Parrilo, Pablo A. .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2019, 19 (02) :259-296
[13]  
Hai-Ying Zhou, 2011, Wireless Sensor Network, V3, P18, DOI 10.4236/wsn.2011.31003
[14]  
Halgamuge M. N., 2009, Progress In Electromagnetics Research B, V12, P259, DOI 10.2528/PIERB08122303
[15]   AoI-Minimal Trajectory Planning and Data Collection in UAV-Assisted Wireless Powered IoT Networks [J].
Hu, Huimin ;
Xiong, Ke ;
Qu, Gang ;
Ni, Qiang ;
Fan, Pingyi ;
Ben Letaief, Khaled .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (02) :1211-1223
[16]  
Liu S., 2018, IEEE 87 VEH TECHN C, P1, DOI DOI 10.1109/VTCSPRING.2018.8417673
[17]   A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and Open Problems [J].
Mozaffari, Mohammad ;
Saad, Walid ;
Bennis, Mehdi ;
Nam, Young-Han ;
Debbah, Merouane .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2019, 21 (03) :2334-2360
[18]  
Pang YW, 2014, IEEE GLOB COMM CONF, P234, DOI 10.1109/GLOCOM.2014.7036813
[19]   Sum Rate Maximization for Multi-Carrier SWIPT Relay System With Non-Ideal Power Amplifier and Circuit Power Consumption [J].
Shen, Yanyan ;
Yang, Bo ;
Wang, Shuqiang ;
Gong, Shimin ;
Xue, Liang ;
Guan, Xinping .
IEEE ACCESS, 2019, 7 :89805-89820
[20]   Subcarrier-Pairing-Based Resource Optimization for OFDM Wireless Powered Relay Transmissions With Time Switching Scheme [J].
Shen, Yanyan ;
Huang, Xiaoxia ;
Kwak, Kyung Sup ;
Yang, Bo ;
Wang, Shuqiang .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (05) :1130-1145