Answers are grounded in this paper and cite their sources.
Autonomous aerial vehicles (AAVs) with cache are considered as an efficient technique to enhance serving capabilities of traditional wireless networks in terms of network coverage and capacity. However, with the introduction of AAVs, new challenges such as trajectory design and AAV-user association occur. In this paper, we consider a caching AAV-assisted wireless network and formulate a user fairness problem by jointly optimizing AAV-user association, trajectory design, and bandwidth allocation of the AAVs, which is mixed-integer and non-convex. In order to find solutions, we decompose the original problem into three subproblems and propose an iterative algorithm based on block alternating descent and successive convex approximation methods. In addition, computational complexity is analyzed. Finally, simulation results validate the efficiency of the proposed algorithm, compared to benchmark algorithms.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: