Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks

摘要

The rapid growth of Internet of Things (IoT) applications has spurred the need for efficient data collection mechanisms. Traditional approaches relying on fixed infrastructure have limitations in coverage, scalability, and deployment costs. Unmanned Aerial Vehicles (UAVs) have emerged as a promising alternative due to their mobility and flexibility. In this paper, we aim to minimize the number of UAVs deployed to collect data in IoT networks while considering a delay budget for energy limitation and data freshness. To this end, we propose a novel 3-approximation dynamic-programming-based algorithm called GPUDA to address the challenges of efficient data collection from IoT devices via UAVs for real-world scenarios where the number of UAVs owned by an individual or organization is unlikely to be excessive, improving the best-known approximation ratio of 4. GPUDA is a geometric partition-based method that incorporates data rounding techniques. The experimental results demonstrate that the proposed algorithm requires 35.01% to 58.55% fewer deployed UAVs than the existing algorithms on average.