一覧に戻る

タイトル
  • Mayer-Vietoris sequences and coverage problems in sensor networks
作成者

Arai, Zin

Hayashi, Kazunori

Hiraoka, Yasuaki

権利情報
    • The original publication is available at www.springerlink.com
主題
  • Other Mayer-Vietoris sequences
  • Other sensor networks
  • Other coverage problems
  • NDC 501
内容注記
Other
  • 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.
出版者Springer Japan
日付 Issued 2011-08
言語eng
資源タイプjournal article
出版タイプAM
資源識別子 URI http://hdl.handle.net/2115/47244
関連
  • isIdenticalTo DOI https://doi.org/10.1007/s13160-011-0039-8
収録誌情報
    • ISSN 0916-7005
    • Japan Journal of Industrial and Applied Mathematics
    28(2), 237-250
ファイル
コンテンツ更新日時2017-10-15T15:00:00Z