Mobile Sensor Deployment with Connectivity Guarantee
Résumé
In this paper, we consider the self-deployment of wireless sensor network. We present a deployment strategy for mobile wireless sensor network which maximizes the sensors covered area with the constraint that the resulting deployment provides a connected topology. Our deployment algorithm is distributed and is based on subset of neighbour for motion decision. Each node is considered as a particle and its movements are governed by the interaction with a part of its neighboring nodes. The interacting neighbors and the node's direction are chosen based on the local relative neighborhood graph. Analytical and simulations results show that the resulting graph is connected, the distance between two sensors is maximized and thus the area covered is maximized. We also show by extensive simulation that some simple modifications of our algorithm allow different coverage schemes such as Point of Interest coverage and barrier coverage.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...