Previous approaches for computing duplicate-sensitive aggregates in sensor networks (<i>e.g.</i>, in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor networks. In this paper, we present <i>synopsis diffusion</i>, a general framework for achieving signi.cantly more accurate and reliable answers by combining energy-efficient multi-path routing schemes with techniques that avoid double-counting. Synopsis diffusion avoids double-counting through the use of <i>order- and duplicate-insensitive (ODI) synopses</i> that compactly summarize intermediate results during in-network aggregation. We provide a surprisingly simple test that makes it easy to check the correctness of an ODI synopsis. We show that the properties of ODI synopses and synopsis di.usion create <i>implicit</i> acknowledgments of packet delivery. We show that this property can, in turn, enable the system to adapt message routing to dynamic message loss conditions, even in the presence of asymmetric links. Finally, we illustrate, using extensive simulations, the significant robustness, accuracy, and energy-efficiency improvements of synopsis diffusion over previous approaches.
Synopsis diffusion for robust aggregation in sensor networks
Suman Nath,Phillip B. Gibbons,S. Seshan,Zachary R. Anderson
Published 2004 in ACM International Conference on Embedded Networked Sensor Systems
ABSTRACT
PUBLICATION RECORD
- Publication year
2004
- Venue
ACM International Conference on Embedded Networked Sensor Systems
- Publication date
2004-11-03
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-51 of 51 references · Page 1 of 1