HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Efficient uncertainty‐aware deployment algorithms for wireless sensor networks

M. R. Senouci A. Mellouk 1 L. Oukhellou A. Aissani
LISSI - Laboratoire Images, Signaux et Systèmes Intelligents
Abstract : Deployment is a fundamental issue in wireless sensor networks. Usually the sensor locations are precomputed based on a "perfect" sensor coverage model, whereas sensors may not always provide reliable information, either due to operational tolerance levels or environmental factors. Therefore, it is imperative to have practical considerations at the design stage to anticipate this sensing behavior. In this paper, we address four different forms of static wireless sensor networks deployment while considering an evidence-based sensor coverage model. The four problems are formalized as combinatorial optimization problems, which are NP-complete. We propose, E2BDA (Efficient Evidence-Based sensor Deployment Algorithm), a polynomial-time uncertainty-aware deployment algorithm based on a dynamic programming approach. E2BDA is able to determine the minimum number of sensors and their locations to achieve both coverage and connectivity. We compare our proposal to the state-of-the-art deployment strategies, the obtained results show that E2BDA obtains the best performances. © 2012 IEEE.
Document type :
Conference papers
Complete list of metadata

Contributor : Yacine Amirat Connect in order to contact the contributor
Submitted on : Tuesday, January 9, 2018 - 11:51:53 AM
Last modification on : Tuesday, October 19, 2021 - 4:10:12 PM


  • HAL Id : hal-01678612, version 1



M. R. Senouci, A. Mellouk, L. Oukhellou, A. Aissani. Efficient uncertainty‐aware deployment algorithms for wireless sensor networks. Proc. Of the IEEE Wireless Communications and Networking Conference (WCNC), 2012, Paris, France. pp.2163-2167. ⟨hal-01678612⟩



Record views