Akademik Veri Yönetim Sistemi
Karaelmas International Science and Engineering Symposium (KISES 2024), Zonguldak, Türkiye, 10 - 11 Mayıs 2024, ss.55-56
Sweep coverage (SC) is an important problem in wireless sensor networks (WSNs) that enables sensor nodes to track targets that need to be monitored for a certain period of time in the area of interest (AoI). Continuous tracking of targets quickly consumes the energy of the sensor nodes, which reduces the network lifetime and does not cover the targets efficiently. One of the proposed solutions to extend the network lifetime is to perform efficient path planning by realizing SC with sensor nodes. In field applications where unmanned aerial vehicles (UAVs) are used as sensor nodes, observations and investigations in disaster situations are carried out with UAV SC, supporting relief and communication. The fact that the UAV cannot perform SC on all targets in the AoI due to its limited battery power highlights the coverage problem. To achieve effective coverage in the AoI, the development of SC designs with the cooperation of UAVs has been studied in the literature as an important UAV SC problem. In this study, a new UAV SC problem is proposed in which time-sensitive targets are considered to track these targets within a certain time. The objective of the problem is to optimize the coverage rate of AoI with SC performed on the maximum number of targets by multiple UAVs flying simultaneously, based on the constraints of time-sensitive targets and the number of UAVs, and thus plan the optimal path for each UAV. A new approach using Crow Search Algorithm and Greedy Algorithm is developed to solve the problem. Finally, the experimental results with Monte Carlo simulations prove that the proposed approach outperforms the compared algorithms.