Minimal Node Deployment in Wireless Sensor Networks Under Coverage and Connectivity Constraints
Slimane Charafeddine Benghelima  1@  , Mohamed Ould-Khaoua  1@  , Ali Benzerbadj  2@  , Oumaya Baala  3@  
1 : LRDSI
2 : LRIIR
3 : Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)
Université de Franche-Comté, Ecole Nationale Supérieure de Mécanique et des Microtechniques, Centre National de la Recherche Scientifique : UMR6174, Université de Technologie de Belfort-Montbeliard : UMR6174

One of the most interesting IoT applications is Smart Car Parks (SCPs) based on Wireless Sensor Networks (WSNs). This type of networks which constitute a particular class of Ad hoc networks have become a very attractive field of research. In fact, they have received the attention of many researchers who have been interested in issues raised by these networks, such as energy consumption [1], cost deployment [5], coverage and connectivity [5]. In this paper, we address the problem of deterministic sensor nodes deployment in WSN dedicated to fire surveillance in SCPs. More precisely, We will use a multi-objective optimization approach to propose a solution based on a recent meta-heuristic called Whale Optimization Algorithm (WOA) [2] to solve the WSN deployment problem by minimizing network cost (number of deployed sensor nodes) while fulfilling the constraints of targets coverage (all car spot must be covered by at least one sensor node) and network connectivity. On the other side, since alerts generated by sensor nodes must be received by the sink node with minimal end-to-end delay, we have considered a second objective which consists of minimizing the hop-count from each sensor node to the sink.


Personnes connectées : 7 Vie privée
Chargement...