Distributed sparse random projections for refinable approximation

  • Authors:

  • Wei Wang;Minos Garofalakis;Kannan Ramchandran

  • Affiliations:

  • University of California, Berkeley, CA;University of California, Berkeley, CA;University of California, Berkeley, CA

  • Venue:
  • Proceedings of the 6th international conference on Information processing in sensor networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.08

Visualization

Abstract

Consider a large-scale wireless sensor network measuring compressible data, where n distributed data values can be well-approximated using only k « n coefficients of some known transform. We address the problem of recovering an approximation of the n data values by querying any L sensors, so that the reconstruction error is comparable to the optimal k-term approximation. To solve this problem, we present a novel distributed algorithm based on sparse random projections, which requires no global coordination or knowledge. The key idea is that the sparsity of the random projections greatly reduces the communication cost of pre-processing the data. Our algorithm allows the collector to choose the number of sensors to query according to the desired approximation error. The reconstruction quality depends only on the number of sensors queried, enabling robust refinable approximation.