Back

Title
  • en Mayer-Vietoris sequences and coverage problems in sensor networks
Creator
    • en Hayashi, Kazunori
    • en Hiraoka, Yasuaki
Accessrights open access
Rights
  • en The original publication is available at www.springerlink.com
Subject
  • Other en Mayer-Vietoris sequences
  • Other en sensor networks
  • Other en coverage problems
  • NDC 501
Description
  • Abstract en A coverage problem of sensor networks is studied. Following recent works by Ghrist et al., in which computational topological methods are applied for the coverage problem, We present an algorithm for the distributed computation of the first homology group of planar Rips complexes. The key idea is to decompose a Rips complex into smaller pieces of subcomplexes, and to make use of Mayer-Vietoris sequences in order to sum up the homology groups of subcomplexes. Combined with a sufficient condition for the coverage which is given in terms of the first homology group, the proposed algorithm enables us to verify the coverage in a distributed manner.
Publisher en Springer Japan
Date
    Issued2011-08
Language
  • eng
Resource Type journal article
Version Type AM
Identifier HDL http://hdl.handle.net/2115/47244
Relation
  • isVersionOf DOI https://doi.org/10.1007/s13160-011-0039-8
Journal
    • PISSN 0916-7005
      • en Japan Journal of Industrial and Applied Mathematics
      • Volume Number28 Issue Number2 Page Start237 Page End250
File
Oaidate 2023-07-26