The DOI matches its Crossref record.
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Abstract
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique strengths and weaknesses. In this paper, we introduce Tributary-Delta, a novel approach that combines the advantages of the tree and multi-path approaches by running them simultaneously in different regions of the network. We present schemes for adjusting the regions in response to changes in network conditions, and show how many useful aggregates can be readily computed within this new framework. We then show how a difficult aggregate for this context---finding frequent items---can be efficiently computed within the framework. To this end, we devise the first algorithm for frequent items (and for quantiles) that provably minimizes the worst case total communication for non-regular trees. In addition, we give a multi-path algorithm for frequent items that is considerably more accurate than previous approaches. These algorithms form the basis for our efficient Tributary-Delta frequent items algorithm. Through extensive simulation with real-world and synthetic data, we show the significant advantages of our techniques. For example, in computing Count under realistic loss rates, our techniques reduce answer error by up to a factor of 3 compared to any previous technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
In-network aggregation techniques for wireless sensor networks: a survey
Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007) · IEEE Wireless Communications · doi:10.1109/mwc.2007.358967 · Cited by 734
Synopsis diffusion for robust aggregation in sensor networks
Nath, S., Gibbons, P. B., Seshan, S., & Anderson, Z. R. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031525 · Cited by 510
Self-citationResource Management in Fog/Edge Computing: A Survey on Architectures, Infrastructure, and Algorithms
Hong, C.-H., & Varghese, B. (2020) · ACM Computing Surveys · doi:10.1145/3326066 · Cited by 461
Secure hierarchical in-network aggregation in sensor networks
Chan, H., Perrig, A., & Song, D. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180440 · Cited by 334
Metadata
- Authors
- Manjhi, A., Nath, S., & Gibbons, P. B.
- Venue
- Proceedings of the 2005 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2005-06-14
- Pages
- 287-298
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2099351934
- Cited by
- 230
- References
- 0
- FWCI
- 15.59
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tributaries and deltas: efficient and robust aggregation in sensor network streams. https://app.cochat.ai/papers/10.1145/1066157.1066191
- The paper
- Manjhi, A., Nath, S., & Gibbons, P. B. (2005). Tributaries and deltas: efficient and robust aggregation in sensor network streams. Proceedings of the 2005 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1066157.1066191
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.