Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue IET Wireless Sensor Systems Année : 2017

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01484311 , version 1 (07-03-2017)

Identifiants

Citer

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, 2017, ⟨10.1049/iet-wss.2016.0076⟩. ⟨hal-01484311⟩
148 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More