Energy-efficient trajectory planning and resource allocation in UAV communication networks under imperfect channel prediction

被引:6
作者
Sheng, Min [1 ]
Zhao, Chenxi [1 ]
Liu, Junyu [1 ]
Teng, Wei [1 ]
Dai, Yanpeng [1 ]
Li, Jiandong [1 ]
机构
[1] Xidian Univ, State Key Lab ISN, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
UAV communication networks; trajectory planning; resource allocation; channel prediction; OPTIMIZATION; RELAY; DESIGN;
D O I
10.1007/s11432-021-3332-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In unmanned aerial vehicle (UAV) communication networks, trajectory planning and resource allocation (TPRA) under channel prediction obtains great attention due to its significant energy-saving of UAVs and user quality of service (QoS) gains. These potentials are primarily demonstrated under the assumption of perfect channel prediction. However, due to the rapid-varying features of air-to-ground channels, it is difficult to avoid the random channel prediction error (CPE), which may deteriorate the performance of TPRA. In this paper, we investigate the problem of energy-efficient TPRA considering random CPE. The problem is formulated as a mixed-integer non-convex optimization with chance constraints, which ensures that QoS is robust to random CPE. To solve it, we first transform the chance constraints into deterministic forms, which are further proved to be convex constraints by using the characteristic of quasiconvex functions. Then, we design a modified successive convex approximation algorithm to iteratively achieve the optimal solution. To cater to the high-speed movement of UAVs, a low-complexity heuristic online algorithm is tailored. Specifically, we first relax the QoS constraints to find a feasible initial point and iteratively tighten the lower bound of QoS constraints to obtain a suboptimal solution. Simulation results show that the proposed algorithm can improve energy efficiency compared with the algorithm without prediction.
引用
收藏
页数:15
相关论文
共 27 条
[1]   Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks [J].
Che, Enlong ;
Hoang Duong Tuan ;
Nguyen, Ha H. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (10) :5481-5495
[2]   Multiple Access for Mobile-UAV Enabled Networks: Joint Trajectory Design and Resource Allocation [J].
Cui, Fangyu ;
Cai, Yunlong ;
Qin, Zhijin ;
Zhao, Minjian ;
Li, Geoffrey Ye .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (07) :4980-4994
[3]  
Dong F., 2019, IEEE INT CONF COMM, P1
[4]   Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations [J].
Garnier, Josselin ;
Omrane, Abdennebi ;
Rouchdy, Youssef .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (03) :848-858
[5]   A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties [J].
Geletu, Abebe ;
Kloeppel, Michael ;
Hoffmann, Armin ;
Li, Pu .
ENGINEERING OPTIMIZATION, 2015, 47 (04) :495-520
[6]   Survey of Important Issues in UAV Communication Networks [J].
Gupta, Lav ;
Jain, Raj ;
Vaszkun, Gabor .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (02) :1123-1152
[7]   LEO-Satellite-Assisted UAV: Joint Trajectory and Data Collection for Internet of Remote Things in 6G Aerial Access Networks [J].
Jia, Ziye ;
Sheng, Min ;
Li, Jiandong ;
Niyato, Dusit ;
Han, Zhu .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (12) :9814-9826
[8]   Power Consumption Minimization of UAV Relay in NOMA Networks [J].
Jiang, Xu ;
Wu, Zhilu ;
Yin, Zhendong ;
Yang, Zhutian ;
Zhao, Nan .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2020, 9 (05) :666-670
[9]   Gaussian Process Based Channel Prediction for Communication-Relay UAV in Urban Environments [J].
Ladosz, Pawel ;
Oh, Hyondong ;
Zheng, Gan ;
Chen, Wen-Hua .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2020, 56 (01) :313-325
[10]   Overhearing-Based Co-Operation for Two-Cell Network With Asymmetric Uplink-Downlink Traffics [J].
Li, Chunguo ;
Wang, Jue ;
Zheng, Fu-Chun ;
Cioffi, John M. ;
Yang, Luxi .
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2016, 2 (03) :350-361