Covering Points of Interest with Mobile Sensors

Abstract : The coverage of Points of Interest (PoI) is a classical requirement in mobile wireless sensor applications. Optimizing the sensors self-deployment over a PoI while maintaining the connectivity between the sensors and the base station is thus a fundamental issue. This article addresses the problem of autonomous deployment of mobile sensors that need to cover a predefined PoI with a connectivity constraint. In our algorithm, each sensor moves toward a PoI but has also to maintain the connectivity with a subset of its neighboring sensors that are part of the Relative Neighborhood Graph (RNG). The Relative Neighborhood Graph reduction is chosen so that global connectivity can be provided locally. Our deployment scheme minimizes the number of sensors used for connectivity thus increasing the number of monitoring sensors. Analytical results, simulation results and practical implementation are provided to show the efficiency of our algorithm.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00678266
Contributor : Tahiry Razafindralambo <>
Submitted on : Wednesday, December 11, 2013 - 3:54:30 PM
Last modification on : Monday, January 15, 2018 - 11:00:04 AM
Long-term archiving on : Friday, March 14, 2014 - 9:20:43 AM

File

Erdelj_2013b.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Milan Erdelj, Tahiry Razafindralambo, David Simplot-Ryl. Covering Points of Interest with Mobile Sensors. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2013, 24 (1), pp.32-43. ⟨10.1109/TPDS.2012.46⟩. ⟨hal-00678266⟩

Share

Metrics

Record views

554

Files downloads

453