Cited by 422Topological and Geometric Data AnalysisHomotopy and Cohomology in Algebraic TopologyComputational Geometry and Mesh Generation

Coverage in sensor networks via persistent homology

Open access
de Silva, Vin, Ghrist, Robert·2007·Algebraic & Geometric Topology

Abstract

We introduce a topological approach to a problem of covering a region in Euclidean space by balls of fixed radius at unknown locations (this problem being motivated by sensor networks with minimal sensing capabilities).In particular, we give a homological criterion to rigorously guarantee that a collection of balls covers a bounded domain based on the homology of a certain simplicial pair.This pair of (Vietoris-Rips) complexes is derived from graphs representing a coarse form of distance estimation between nodes and a proximity sensor for the boundary of the domain.The methods we introduce come from persistent homology theory and are applicable to nonlocalized sensor networks with ad hoc wireless communications.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.2140/agt.2007.7.339

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • For any positive parameter, there is a chain of inclusion maps from a Rips complex to a Čech complex at scaled parameter and back to a Rips complex at scaled parameter.

    “R ↩→ C √ 2 ↩→ R √ 2 .”

    From Barcodes: the persistent topology of data (2007) · cites this paper as [10]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [9]9. H Edelsbrunner, D Letscher, A Zomorodian, Topological persistence and simplifi- cation, from: "41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000)", IEEE Comput. Soc. Press, Los Alamitos, CA (2000) 454-463 MR1931842
  2. [15]15. H Koskinen, On the coverage of a random sensor network in a bounded domain, from: "Proceedings of 16th ITC Specialist Seminar" (2004) 11-18

Cited by

Sorted by citations

Authors
de Silva, V., & Ghrist, R.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
Algebraic & Geometric Topology
Published
2007-04-25
Volume
7
Issue
1
Pages
339-358
ISSN
  • 1472-2739 (ISSN-L)
  • 1472-2747
OpenAlex
W2153986241
Cited by
422
References
24
Citations by year
2026: 10 · 2025: 11 · 2024: 22 · 2023: 15 · 2022: 24 · 2021: 30 · 2020: 25 · 2019: 38 · 2018: 41 · 2017: 33 · 2016: 15 · 2015: 18 · 2014: 26 · 2013: 25 · 2012: 24
FWCI
18.64
Type
journal article
Language
en
Open access
Locations
  • Algebraic & Geometric Topology (publishedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
Funders
  • National Science Foundation
  • Defense Advanced Research Projects Agency
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
Keywords
covering problems, sensor networks, persistent homology, Vietoris-Rips complex, ball covering, proximity sensors, ad hoc networks, distance estimation

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