Drones (Apr 2024)

Iterative Trajectory Planning and Resource Allocation for UAV-Assisted Emergency Communication with User Dynamics

  • Zhilan Zhang,
  • Yufeng Wang,
  • Yizhe Luo,
  • Hang Zhang,
  • Xiaorong Zhang,
  • Wenrui Ding

DOI
https://doi.org/10.3390/drones8040149
Journal volume & issue
Vol. 8, no. 4
p. 149

Abstract

Read online

The demand for air-to-ground communication has surged in recent years, underscoring the significance of unmanned aerial vehicles (UAVs) in enhancing mobile communication, particularly in emergency scenarios due to their deployment efficiency and flexibility. In situations such as emergency cases, UAVs can function as efficient temporary aerial base stations and enhance communication quality in instances where terrestrial base stations are incapacitated. Trajectory planning and resource allocation of UAVs continue to be vital techniques, while a relatively limited number of algorithms account for the dynamics of ground users. This paper focuses on emergency communication scenarios such as earthquakes, proposing an innovative path planning and resource allocation algorithm. The algorithm leverages a multi-stage subtask iteration approach, inspired by the block coordinate descent technique, to address the challenges presented in such critical environments. In this study, we establish an air-to-ground communication model, subsequently devising a strategy for user dynamics. This is followed by the introduction of a joint scheduling process for path and resource allocation, named ISATR (iterative scheduling algorithm of trajectory and resource). This process encompasses highly interdependent decision variables, such as location, bandwidth, and power resources. For mobile ground users, we employ the cellular automata (CA) method to forecast the evacuation trajectory. This algorithm successfully maintains data communication in the emergency-stricken area and enhances the communication quality through bandwidth division and power control which varies with time. The effectiveness of our algorithm is validated by evaluating the average throughput with different parameters in various simulation conditions and by using several heuristic methods as a contrast.

Keywords