Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 185

The DOI matches its Crossref record.

Geographic gossip: efficient aggregation for sensor networks

Dimakis, Alexandros G., Sarwate, Anand D., Wainwright, Martin J. · 2006 · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06

Abstract

Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is caused by slow mixing times of random walks on those graphs. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing a simple resampling method, we can demonstrate substantial gains over previously proposed gossip protocols. In particular, for random geometric graphs, our algorithm computes the true average to accuracy 1/nausing O(n1.5√log n) radio transmissions, which reduces the energy consumption by a √nover log n factor over standard gossip algorithms.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1127777.1127791

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 185

Metadata

Authors
Dimakis, A. G., Sarwate, A. D., & Wainwright, M. J.
Venue
Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06
Publisher
ACM Press
Published
2006
Pages
69
OpenAlex
W2135241601
Cited by
185
References
0
Type
conference abstract
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: Geographic gossip: efficient aggregation for sensor networks. https://app.cochat.ai/papers/10.1145/1127777.1127791
The paper
Dimakis, A. G., Sarwate, A. D., & Wainwright, M. J. (2006). Geographic gossip: efficient aggregation for sensor networks. Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06. https://doi.org/10.1145/1127777.1127791

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.