A Distributed Strategy to Maximize Coverage in a Heterogeneous Sensor Network in the Presence of Obstacles

TL;DR

This paper presents a distributed deployment strategy for heterogeneous sensors in obstacle-rich environments, optimizing coverage through MW-Voronoi diagrams and gradient-based movements, validated by simulations.

Contribution

It introduces a novel distributed approach combining MW-Voronoi partitioning and gradient-based movement for heterogeneous sensors with obstacles.

Findings

Effective coverage maximization demonstrated in simulations.

Strategy adapts to obstacles and sensor heterogeneity.

Improved coverage compared to baseline methods.

Abstract

In this paper, an efficient deployment strategy is proposed for a network of mobile and static sensors with nonidentical sensing and communication radii. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to partition the field and assign the underlying coverage task to each mobile sensor. A gradient-based method is applied to find the best candidate point based on the detected coverage holes and the coverage priority considering the relative distance of the mobile sensor from the static ones and the obstacles in the field. The sensors move to a new position if such a relocation increases their local coverage. The efficiency of the proposed strategy in different scenarios is demonstrated by simulations.