Mayer-Vietoris sequences and coverage problems in sensor networks

Zin Arai, Kazunori Hayashi, Yasuaki Hiraoka

研究成果: Article査読

7 被引用数 (Scopus)

抄録

Acoverage problem of sensor networks is studied. Following recentworks 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.

本文言語English
ページ(範囲)237-250
ページ数14
ジャーナルJapan Journal of Industrial and Applied Mathematics
28
2
DOI
出版ステータスPublished - 2011 8

ASJC Scopus subject areas

  • 工学(全般)
  • 応用数学

フィンガープリント

「Mayer-Vietoris sequences and coverage problems in sensor networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル