Optimal Covering with Mobile Sensors in an Unbounded Region

TL;DR

This paper presents a distributed, message-free algorithm for optimally covering an unbounded region with mobile sensors, ensuring maximum spread and energy efficiency in a minimal number of rounds.

Contribution

It introduces a novel id-based distributed algorithm that guarantees optimal sensor coverage and energy use without communication in unbounded regions.

Findings

Guarantees maximum spreading in O(√n) rounds

Ensures no coverage holes during deployment

Achieves optimal energy consumption

Abstract

Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \cite{Li09}. In this paper we have proposed an {\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed algorithm guarantees maximum spreading in $O(\sqrt{n})$ rounds without creating any coverage hole. The algorithm executes in synchronous rounds without exchanging any message. We have also explained how our proposed algorithm can achieve optimal energy consumption and handle random sensor node deployment for optimal spreading.