Prolonging network lifetime under probabilistic target coverage in wireless mobile sensor networks

Abstract : One of the main operations in wireless sensor networks is the surveillance of a set of events (targets) that occur in the field. In practice, a node monitors an event accurately when it is located closer to it, while the opposite happens when the node is moving away from the target. This detection accuracy can be represented by a probabilistic distribution. Since the network nodes are usually randomly deployed, some of the events are monitored by a few nodes and others by many nodes. In applications where there is a need of a full coverage and of a minimum allowed detection accuracy, a single node may not be able to sufficiently cover an event by itself. In this case, two or more nodes are needed to collaborate and to cover a single target. Moreover, all the nodes must be connected with a base station that collects the monitoring data. In this paper we describe the problem of the minimum sampling quality, where an event must be sufficiently detected by the maximum possible amount of time. Since the probability of detecting a single target using randomly deployed static nodes is quite low, we present a localized algorithm based on mobile nodes. Our algorithm sacrifices a part of the energy of the nodes by moving them to a new location in order to satisfy the desired detection accuracy. It divides the monitoring process in rounds to extend the network lifetime, while it ensures connectivity with the base station. Furthermore, since the network lifetime is strongly related to the number of rounds, we propose two redeployment schemes that enhance the performance of our approach by balancing the number of sensors between densely covered areas and areas that are poorly covered. Finally, our evaluation results show an over 10 times improvement on the network lifetime compared to the case where the sensors are static. Our approaches, also, outperform a virtual forces algorithm when connectivity with the base station is required. The redeployment schemes present a good balance between network lifetime and convergence time.
Type de document :
Article dans une revue
Computer Communications, Elsevier, 2013, 36 (9), pp.1039-1053. 〈10.1016/j.comcom.2012.07.021〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00724960
Contributeur : Tahiry Razafindralambo <>
Soumis le : mercredi 11 décembre 2013 - 15:51:12
Dernière modification le : mercredi 29 novembre 2017 - 15:08:12
Document(s) archivé(s) le : vendredi 14 mars 2014 - 09:21:25

Fichier

Zorbas_2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Dimitrios Zorbas, Tahiry Razafindralambo. Prolonging network lifetime under probabilistic target coverage in wireless mobile sensor networks. Computer Communications, Elsevier, 2013, 36 (9), pp.1039-1053. 〈10.1016/j.comcom.2012.07.021〉. 〈hal-00724960〉

Partager

Métriques

Consultations de la notice

298

Téléchargements de fichiers

190