In this paper, we investigate the problem of deploying the minimum number of Unmanned Aerial Vehicles (UAVs) and finding their flying tours to collect data of all Internet of Things (IoT) sensors. Since UAVs are powered by a battery that has a limited amount of energy, we assume that the total energy consumed in the flying tour of each UAV is bounded by a given budget B. We study this problem in a scenario with neighbourhoods where a UAV can collect the data of an IoT sensor if the Euclidean distance between the UAV and the IoT sensor is less than the wireless communication range of the IoT sensor. For the problem, we propose two approximation algorithms, where the second algorithm is a bicriteria approximation algorithm, i.e., it returns an approximate solution while the cost of obtained tours are violated by a factor of 1 + ϵ, for any ϵ> 0.
Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks
Ghobadi Sajjad
;Pinotti Cristina M.
2023
Abstract
In this paper, we investigate the problem of deploying the minimum number of Unmanned Aerial Vehicles (UAVs) and finding their flying tours to collect data of all Internet of Things (IoT) sensors. Since UAVs are powered by a battery that has a limited amount of energy, we assume that the total energy consumed in the flying tour of each UAV is bounded by a given budget B. We study this problem in a scenario with neighbourhoods where a UAV can collect the data of an IoT sensor if the Euclidean distance between the UAV and the IoT sensor is less than the wireless communication range of the IoT sensor. For the problem, we propose two approximation algorithms, where the second algorithm is a bicriteria approximation algorithm, i.e., it returns an approximate solution while the cost of obtained tours are violated by a factor of 1 + ϵ, for any ϵ> 0.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
