移動センサネットワークにおける回避経路の存在条件
Evasion Paths in Mobile Sensor Networks
移動する球状センサ群の接続情報から侵入者が検知を逃れる経路の有無を判定する条件を、ジグザグ持続ホモロジーを用いてストリーミング計算可能な形で与え、さらに平面センサでは弱い回転・距離情報を加えることで必要十分条件を導いた。
著者: Henry Adams, Gunnar Carlsson
分類: math.AT, cs.RO
原文アブストラクト
Suppose that ball-shaped sensors wander in a bounded domain. A sensor doesn't know its location but does know when it overlaps a nearby sensor. We say that an evasion path exists in this sensor network if a moving intruder can avoid detection. In "Coordinate-free coverage in sensor networks with controlled boundaries via homology", Vin deSilva and Robert Ghrist give a necessary condition, depending only on the time-varying connectivity data of the sensors, for an evasion path to exist. Using zigzag persistent homology, we provide an equivalent condition that moreover can be computed in a streaming fashion. However, no method with time-varying connectivity data as input can give necessary and sufficient conditions for the existence of an evasion path. Indeed, we show that the existence of an evasion path depends not only on the fibrewise homotopy type of the region covered by sensors but also on its embedding in spacetime. For planar sensors that also measure weak rotation and distance information, we provide necessary and sufficient conditions for the existence of an evasion path.
