Completion Time Minimization for Multi-UAV-Enabled Data Collection
Completion Time Minimization for Multi-UAV-Enabled Data Collection
复制标题
最大限度缩短多无人机数据收集的完成时间
DOI：
10.1109/twc.2019.2930190
复制
发表时间：
2019-10-01
影响因子：
10.4
通讯作者：
Zeng, Yong
中科院分区：
文献类型：
--
作者：
Zhan, Cheng;Zeng, Yong
Energy consumption is one of the important design aspect for data collection in wireless sensor networks (WSNs). This paper studies data collection from a set of sensor nodes (SNs) in WSNs enabled by multiple unmanned aerial vehicles (UAVs). We aim to minimize the maximum mission completion time among all UAVs by jointly optimizing the UAV trajectory, as well as the wake-up scheduling and association for SNs, while ensuring that each SN can successfully upload the targeting amount of data with a given energy budget. The formulated problem is a non-convex problem which is difficult to be solved directly. To tackle this problem, we first propose a simple scheme that each UAV only collects data while hovering, termed as hovering mode (Hmode). For this mode, in order to find the optimized hovering locations for each SN and the serving order among all locations, we propose an efficient algorithm by leveraging the min–max multiple Traveling Salesman Problem (min–max m-TSP) and convex optimization techniques. Furthermore, we propose the more general scheme that enables continuous data collection even while flying, termed as flying mode (Fmode). By leveraging bisection method and time discretization technique, the original problem is transformed into a discretized equivalent with a finite number of optimization variables, based on which a Karush–Kuhn–Tucker (KKT) solution is obtained by applying the successive convex approximation (SCA) technique. The simulation results show that the proposed multi-UAV enabled data collection with joint trajectory and communication design achieves significant performance gains over the benchmark schemes.
