| タイトル |
-
en
Mayer-Vietoris sequences and coverage problems in sensor networks
|
| 作成者 |
|
| アクセス権 |
open access |
| 権利情報 |
-
en
The original publication is available at www.springerlink.com
|
| 主題 |
-
Other
en
Mayer-Vietoris sequences
-
Other
en
sensor networks
-
Other
en
coverage problems
-
NDC
501
|
| 内容注記 |
-
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.
|
| 出版者 |
en
Springer Japan
|
| 日付 |
|
| 言語 |
|
| 資源タイプ |
journal article |
| 出版タイプ |
AM |
| 資源識別子 |
HDL
http://hdl.handle.net/2115/47244
|
| 関連 |
-
isVersionOf
DOI
https://doi.org/10.1007/s13160-011-0039-8
|
| 収録誌情報 |
-
-
en
Japan Journal of Industrial and Applied Mathematics
-
巻28
号2
開始ページ237
終了ページ250
|
| ファイル |
|
| コンテンツ更新日時 |
2023-07-26 |
