Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks

Abstract : Large applications of sensor networks, such as environmental risk monitoring, require the deployment of hundreds or even thousands of nodes. This study proposes and implements a novel stochastic physics-based optimisation algorithm that is both efficient (guarantees full target coverage with a reduced number of sensors) and scalable (meaning that it can be executed for very large-scale problems in a reasonable computation time). The algorithm employs ‘virtual sensors’ which move, merge, recombine, and ‘explode’ during the course of the algorithm, where the process of merging and recombining virtual sensors reduces the number of actual sensors while maintaining full coverage. The parameters which control sensor merging and explosion are varied during the algorithm to perform the same function as an annealing schedule in simulated annealing. Simulation results illustrate the rapidity and the effectiveness of the proposed method.
Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01484311
Contributeur : Le2i - Université de Bourgogne <>
Soumis le : mardi 7 mars 2017 - 10:32:42
Dernière modification le : jeudi 23 juillet 2020 - 16:34:02

Identifiants

Citation

Arouna Ndam Njoya, Christopher Thron, Jordan Barry, Wahabou Abdou, Emmanuel Tonye, et al.. Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks. IET Wireless Sensor Systems, IET, 2017, ⟨10.1049/iet-wss.2016.0076⟩. ⟨hal-01484311⟩

Partager

Métriques

Consultations de la notice

489