Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.09363 v1 pith:5NYOAYW7 submitted 2023-09-17 eess.SY cs.SY

classification eess.SYcs.SY
keywords coveragemobilesensorstrategyfieldnetworkobstaclesproposed
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools