Completion Time Minimization for UAV-Based Communications with a Finite Buffer

This paper considers a buffer-aided unmanned aerial vehicle (UAV) serving as an aerial relay for communication between a base station (BS) and multiple ground users (GUs). Thanks to its flexible mobility, the UAV can achieve high-rate communications with the GUs/BS by buffering the communication data and exploiting the favorable channel conditions on its flight trajectory for transmission and reception. However, the size of the buffer is limited in practice, which may severely restrict the throughput gains enabled by buffering. Whether it is beneficial to consider buffering at UAVs with a small buffer is an open research problem, which is tackled in this paper. Assuming a finite buffer mounted at the UAV, we consider joint optimization of the resource allocation, data buffering, and trajectory planning for minimizing the UAV's completion time required for delivering a given data volume from each GU to the BS, where the resource allocation contains power and bandwidth allocation. The formulated optimization problem is a mixed-integer nonconvex program, which is generally intractable. To solve this problem, we propose a novel low-complexity two-layer iterative suboptimal algorithm based on bisection search and penalty successive convex approximation (PSCA). Note that minimizing the completion time in turn maximizes the average throughput, i.e., the amount of data delivered from the GUs to the BS per unit of time. Simulation results show that the buffer with sufficiently large size can increase the UAV's average throughput by up to 123.8% compared to without buffering. Moreover, with our proposed scheme, 63.2% of the throughput gains can already be achieved using only a small buffer.