Distributed computation of coverage in sensor networks by homological methods (Q714652): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00200-012-0167-7 / rank
Normal rank
 
Property / author
 
Property / author: Paweł Dłotko / rank
 
Normal rank
Property / author
 
Property / author: Robert W. Ghrist / rank
 
Normal rank
Property / author
 
Property / author: Mateusz Juda / rank
 
Normal rank
Property / author
 
Property / author: Marian Mrozek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CHomP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RedHom / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00200-012-0167-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116085985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mayer-Vietoris sequences and coverage problems in sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distributed algorithm to find breadth first search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zigzag persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zigzag persistent homology and real-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vietoris-Rips complexes of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local approximation schemes for topology control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic functions and boundary value problems on a chain complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic boundary recognition and topology extraction for large sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coreduction homology algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coreduction homology algorithm for inclusions and persistent homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Logic Circuits and Sheaf Obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Coverage Verification in Sensor Networks Without Location Information / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00200-012-0167-7 / rank
 
Normal rank

Latest revision as of 01:36, 10 December 2024

scientific article
Language Label Description Also known as
English
Distributed computation of coverage in sensor networks by homological methods
scientific article

    Statements

    Distributed computation of coverage in sensor networks by homological methods (English)
    0 references
    11 October 2012
    0 references
    The article is devoted to presenting a distributed homology computation algorithm working over a sensor network with the purpose of coverage verification. The authors' results may be summarized in the following statements from the introduction: 1. We provide a provably correct algorithm for distributed computation of homological coverage criteria. 2. The algorithm can recover specific generators, for use in building minimal or power-reducing covers. 3. Most crucially, the algorithm computes homology in an arbitrary coefficient system. This allows for computations over finite fields, which avoids the roundoff errors present in \(\mathbb R\)-coefficients. 4. Simulations seem to indicate that for a unit-disc graph network of points in the plane, all complexes are completely reducible, indicating that homology computation is of linear algorithmic complexity.
    0 references
    homology
    0 references
    sensor network
    0 references
    coverage
    0 references
    distributed computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers