Efficient Algorithms for Point and Area Sweep–Coverage in Wireless Sensor Networks

In wireless sensor networks, coverage is a significant challenge, reflecting how well the sensor nodes (SNs) cover a target area. If we use static SNs for continuous coverage but it is energy-consuming. Instead of constant monitoring, periodic monitoring is also sufficient for content in some cases, and it is also less energy-consuming. The
$t$
-sweep coverage is the coverage after a given time
$t$
of the points or sub-area in a target by the SNs. Determining the best set of mobile SNs to ensure sweep-coverage with a consistent speed is NP-hard. In this article, we propose a new 1.5-approximation approach for resolving the sweep-coverage issue for a chosen point of interest. The best approximation for point sweep-coverage challenge in the literature has 2-approximation. We also propose a new
$1.5\sqrt{2}$
-approximation area sweep-coverage algorithm for sweep-coverage problem for a chosen area of interest. The best-known approximation approach for area sweep-coverage issue has
$2\sqrt{2}$
-approximation. Finally, we simulate the proposed and existing and the proposed approaches are resulting better performance over the existing ones.