Efficient and fault-tolerant feature extraction in wireless sensor networks

  • Authors:
  • Bhaskar Krishnamachari;S. Sitharama Iyengar

  • Affiliations:
  • Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Department of Computer Science, Louisiana State University, Baton Rouge, LA

  • Venue:
  • IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.