Less Complex Algorithm to Max-Min the Resource Allocation for Unmanned Aerial Vehicles Networks

This work studies unmanned aerial vehicles (UAVs) as supporters of future wireless networks. We focus on channel assignment and study it as a joint optimization problem, where we pick from a pool of channels provided by a main core network. We find an optimal solution for the association problem between the wireless access points (WAPs) and UAVs, and this way we can maximize the total weighted sum rate by formulating a max-min optimization problem. This formulation is subject to quality of service (QoS), to a maximum number of links from the pool channel, and to available bandwidth constraints. The formulated problem is an NP-hard problem and requires exponential time to be solved as the number of WAPs increases. We propose a low-complexity centralized algorithm to solve the association problem. Our results demonstrate that the solution of the proposed algorithm approaches that of the exhaustive search technique with much less computational complexity.