Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks

Abstract : In this study, we aim to cover a sensing area by deploying a minimum number of wireless sensors while maintaining the connectivity between the deployed sensors. The problem may be reduced to a two-dimensional critical coverage problem which is an NP-Complete problem. We develop an integer linear programming model to solve the problem optimally. We also propose a local search (LS) algorithm and a genetic algorithm (GA) as approximate methods. We verify by computational experiments that the integer linear model, using Cplex, is able to provide an optimal solution of all our small and medium size problems. We also show that the proposed methods outperform some regular sensor deployment patterns.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02274738
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Friday, August 30, 2019 - 10:45:19 AM
Last modification on : Monday, September 16, 2019 - 4:35:59 PM

Identifiers

Collections

Citation

Maher Rebai, Matthieu Le Berre, Hichem Snoussi, Faicel Hnaien, Lyes Khoukhi. Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks. Computers & Operations Research, 2015, 59, pp.11-21. ⟨10.1016/j.cor.2014.11.002⟩. ⟨hal-02274738⟩

Share

Metrics

Record views

7