Efficient and fault-tolerant feature extraction in wireless sensor networks

18Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a canonical task in wireless sensor networks - the extraction of information about environmental features - and propose a multi-step solution that is fault-tolerant, self-organizing and energy-efficient. We explicitly take into account the possibility of sensor measurement faults and study a distributed algorithm for detecting and correcting such faults, showing through theoretical analysis and simulation results that 85-95% of faults can be corrected using this algorithm even when as many as 10% of the nodes are faulty. We present a self-organizing algorithm which combines shortest-path routing mechanisms with leader-election to permit nodes within each feature region to self-organize into routing clusters. These clusters are used in data aggregation schemes that we propose for feature extraction. We show that the best such aggregation scheme can result in an order-of-magnitude improvement in energy savings. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Krishnamachari, B., & Iyengar, S. S. (2003). Efficient and fault-tolerant feature extraction in wireless sensor networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2634, 488–501. https://doi.org/10.1007/3-540-36978-3_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free