Unmanned Aerial Vehicle (UAV) networks have emerged as a promising technique to rapidly provide wireless coverage to a geographical area out of the reach or capacity of existing core networks, where a flying UAV can be fast deployed to serve as a base station. Existing work on UAV overlook the emergency deployment problem and only the recent research on sensor networks study the deployment problems the assumed in one-dimensional (1D) ground. However, UAVs should be deployed to the air (beyond one-dimension) by considering their different flying speeds during deployment and deployment altitudes, this paper studies this novel emergency UAV deployment to minimize the UAV deployment delay till covering the whole target area. When a number n of diverse UAVs are dispatched from the same location (e.g., the closest UAV station) to the target area, we present an optimal deployment algorithm by balancing UAVs' diverse flying speeds and coverage radii, and this algorithm has low computation complexity O(n 2 ). When UAVs are generally dispatched from different locations, we first prove that the emergency UAV deployment problem is NP-complete. By preserving UAVs' location order, we then successfully design a fully polynomial time approximation scheme (FPTAS) of computation complexity O(n 2 log 1/ε) to arbitrarily approach the global optimum.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2017) studied this question.