Scalable data collection in sensor networks

  • Authors:
  • Asad Awan;Suresh Jagannathan;Ananth Grama

  • Affiliations:
  • Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN

  • Venue:
  • HiPC'08 Proceedings of the 15th international conference on High performance computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dense sensor deployments impose significant constraints on aggregatenetwork data rate and resource utilization. Effective protocols for suchdata transfers rely on spatio-temporal correlations in sensor data for in-network data compression. The message complexity of these schemes is generally lowerbounded by n, for a network with n sensors, since correlation is not collocatedwith sensing. Consequently, as the number of nodes and network density increase,these protocols become increasingly inefficient. We present here a novel protocol,called SNP, for fine-grained data collection, which requires approximatelyO(n-R) messages, where R, a measure of redundancy in sensed data generallyincreases with density. SNP uses spatio-temporal correlations to near-optimally compress data at the source, reducing network traffic and power consumption.We present a comprehensive information theoretic basis for SNP and establishits superior performance in comparison to existing approaches. We support ourresults with a comprehensive experimental evaluation of the performance of SNPin a real-world sensor network testbed.