Skip to Main content Skip to Navigation

Déploiement optimal d’un réseau de capteurs sous des contraintes de couverture et de connectivité

Abstract : The objectif of this thesis on wireless sensor networks is to study the deployment of a minimal number of sensors to cover specific targets instead of continuous areas. After a presentation of the characteristics of wireless sensor networks, and after justifying the interest of an optimal sensor deployment, we propose a graph-theory based model for wireless sensor networks. We then present a state of the art describing various mathematical programming models and resolution techniques regarding a number of optimization problems in such networks. We formulate several Mixed Integer Linear programs to solve the optimal sensor deployment problem under contraints related to the coverage of all targets and connectivity between sensors. Finally, we conceive a new heuristic for sensor placement when targets are placed in a square grid graph, and we conjecture that this heuristic returns an optimal solution in all cases.
Complete list of metadata

Cited literature [65 references]  Display  Hide  Download
Contributor : Abes Star :  Contact Connect in order to contact the contributor
Submitted on : Friday, November 22, 2019 - 1:27:07 PM
Last modification on : Friday, February 14, 2020 - 3:30:24 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02376136, version 1



Sylvain Marie. Déploiement optimal d’un réseau de capteurs sous des contraintes de couverture et de connectivité. Mathématique discrète [cs.DM]. Conservatoire national des arts et metiers - CNAM, 2019. Français. ⟨NNT : 2019CNAM1248⟩. ⟨tel-02376136⟩



Record views


Files downloads