Connectivity Preservation and Coverage Schemes for Wireless Sensor Networks

Autor: Tahiry Razafindralambo, David Simplot-Ryl
Přispěvatelé: System and Networking for Portable Objects Proved to be Safe (POPS), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), ARC MISSION, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA
Rok vydání: 2011
Předmět:
Zdroj: IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control, 2011, 56 (10), pp.2418-2428. ⟨10.1109/TAC.2011.2163885⟩
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2011, 56 (10), pp.2418-2428. ⟨10.1109/TAC.2011.2163885⟩
ISSN: 1558-2523
0018-9286
DOI: 10.1109/tac.2011.2163885
Popis: International audience; In this paper, we consider the self-deployment of wireless sensor networks. We present a mechanism which allows to preserve network connectivity during the deployment of mobile wireless sensors. Our algorithm is localized and is based on a subset of neighbors for motion decision. Our algorithm maintains a connected topology regardless of the direction chosen by each sensor. To preserve connectivity, the distance covered by the mobile nodes is constrained by the connectivity of the node to its neighbors in a connected subgraph like the relative neighborhood graph (RNG). We show the connectivity preservation property of our algorithm through analysis and present some simulation results on different deployment schemes such as full coverage, point of interest coverage or barrier coverage.
Databáze: OpenAIRE