On rate-constrained estimation in unreliable sensor networks

  • Authors:

  • Prakash Ishwar;Rohit Puri;S. Sandeep Pradhan;Kannan Ramchandran

  • Affiliations:

  • Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA

  • 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 study a network of non-collaborating sensors that make noisy measurements of some physical process X and communicate their readings to a central processing unit. Limited power resources of the sensors severely restrict communication rates. Sensors and their communication links are both subject to failure; however, the central unit is guaranteed to receive data from a minimum fraction of the sensors, say k out of n sensors. The goal of the central unit is to optimally estimate X from the received transmissions under a specified distortion metric. In this work, we derive an information-theoretically achievable rate-distortion region for this network under symmetric sensor measurement statistics. When all processes are jointly Gaussian and independent, and we have a squared-error distortion metric, the proposed distributed encoding and estimation framework has the following interesting optimality property: when any k out of n rate-R bits/sec sensor transmissions are received, the central unit's estimation quality matches the best estimation quality that can be achieved from a completely reliable network of k sensors, each transmitting at rate R. Furthermore, when more than k out of the n sensor transmissions are received, the estimation quality strictly improves. When the network has clusters of collaborating sensors should clusters compress their raw measurements or should they first try to estimate the source from their measurements and compress the estimates instead. For some interesting cases, we show that there is no loss of performance in the distributed compression of local estimates over the distributed compression of raw data in a rate-distortion sense, i.e., encoding the local sufficient statistics is good enough.