Distributed Information Gathering and Estimation in Wireless Sensor Networks

Abstract : Wireless sensor networks (WSNs) have attracted much interests in the last decade. The first part of this thesis considers sparse random linear network coding is for data gathering and compression in WSNs. An information-theoretic approach is applied to demonstrate the necessary and sufficient conditions to realize the asymptotically perfect reconstruction under MAP estimation. The second part of the thesis concerns the distributed self-rating (DSR) problem, for WSNs with nodes that have different ability of performing some task (sensing, detection...). The main assumption is that each node does not know and needs to estimate its ability. Depending on the number of ability levels and the communication conditions, three sub-problems have been addressed: i) distributed faulty node detection (DFD) to identify the nodes equipped with defective sensors in dense WSNs; ii) DFD in delay tolerant networks (DTNs) with sparse and intermittent connectivity; iii) DSR using pairwise comparison. Distributed algorithms have been proposed and analyzed. Theoretical results assess the effectiveness of the proposed solution and give guidelines in the design of the algorithm.
Complete list of metadatas

Cited literature [105 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Monday, January 9, 2017 - 4:16:07 PM
Last modification on : Monday, February 3, 2020 - 9:34:57 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01430244, version 1


Wenjie Li. Distributed Information Gathering and Estimation in Wireless Sensor Networks. Networking and Internet Architecture [cs.NI]. Université Paris-Saclay, 2016. English. ⟨NNT : 2016SACLS461⟩. ⟨tel-01430244⟩



Record views


Files downloads