Milan Erdelj ; Nathalie Mitton ; Tahiry Razafindralambo - Robust Wireless Sensor Network Deployment

dmtcs:2163 - Discrete Mathematics & Theoretical Computer Science, April 21, 2016, Vol. 17 no. 3 -
Robust Wireless Sensor Network DeploymentArticle

Authors: Milan Erdelj ORCID1; Nathalie Mitton ORCID2; Tahiry Razafindralambo ORCID3,2

In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment. The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid. Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures. We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid. We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time.

Volume: Vol. 17 no. 3
Section: Distributed Computing and Networking
Published on: April 21, 2016
Submitted on: February 4, 2015
Keywords: wireless sensor network, deployment,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]

3 Documents citing this article

Consultation statistics

This page has been seen 786 times.
This article's PDF has been downloaded 323 times.