Energy Minimization for Wireless Communication With Rotary-Wing UAV

被引:1187
作者
Zeng, Yong [1 ]
Xu, Jie [2 ,3 ]
Zhang, Rui [4 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
[2] Guangdong Univ Technol, Sch Informat Engn, Guangzhou 510006, Guangdong, Peoples R China
[3] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 211189, Jiangsu, Peoples R China
[4] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117583, Singapore
基金
中国国家自然科学基金; 澳大利亚研究理事会;
关键词
UAV communication; rotary-wing UAV; energy model; energy-efficient communication; trajectory optimization; path discretization; TRAJECTORY DESIGN; ALTITUDE;
D O I
10.1109/TWC.2019.2902559
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies unmanned aerial vehicle (UAV)enabled wireless communication, where a rotary-wing UAV is dispatched to communicate with multiple ground nodes (GNs). We aim to minimize the total UAV energy consumption, including both propulsion energy and communication related energy, while satisfying the communication throughput requirement of each GN. To this end, we first derive a closed-form propulsion power consumption model for rotary-wing UAVs, and then formulate the energy minimization problem by jointly optimizing the UAV trajectory and communication time allocation among GNs, as well as the total mission completion time. The problem is difficult to be optimally solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first consider the simple fly-hover-communicate design, where the UAV successively visits a set of hovering locations and communicates with one corresponding GN while hovering at each location. For this design, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations, by leveraging the travelling salesman problem with neighborhood and convex optimization techniques. Next, we consider the general case, where the UAV also communicates while flying. We propose a new path discretization method to transform the original problem into a discretized equivalent with a finite number of optimization variables, for which we obtain a high-quality suboptimal solution by applying the successive convex approximation technique. The numerical results show that the proposed designs significantly outperform the benchmark schemes.
引用
收藏
页码:2329 / 2345
页数:17
相关论文
共 43 条
[1]   Coverage and Rate Analysis of Aerial Base Stations [J].
Al-Hourani, Akram ;
Chandrasekharan, Sathyanarayanan ;
Kaandorp, Geoff ;
Glenn, William ;
Jamalipour, Abbas ;
Kandeepan, Sithamparanathan .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2016, 52 (06) :3077-3081
[2]  
Al-Hourani A, 2014, IEEE GLOB COMM CONF, P2898, DOI 10.1109/GLOCOM.2014.7037248
[3]   Optimal LAP Altitude for Maximum Coverage [J].
Al-Hourani, Akram ;
Kandeepan, Sithamparanathan ;
Lardner, Simon .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (06) :569-572
[4]   3-D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage [J].
Alzenad, Mohamed ;
El-Keyi, Amr ;
Lagum, Faraj ;
Yanikomeroglu, Halim .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (04) :434-437
[5]  
[Anonymous], SURVEY AIR TO GROUND
[6]  
[Anonymous], IEEE COMMUN SURVEYS
[7]  
[Anonymous], CVX: MATLAB software for disciplined convex programming
[8]  
[Anonymous], 2018, COMP SKY UAV PLACEME
[9]  
[Anonymous], 2019, TRAVELLING SALESMAN
[10]  
[Anonymous], SUMM SMALL UNM AIRCR