Efficient Evader Detection in Mobile Sensor Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914905849856000 |
|---|---|
| author | Adams, Henry Ghosh, Deepjyoti Mask, Clark Ott, William Williams, Kyle |
| author_facet | Adams, Henry Ghosh, Deepjyoti Mask, Clark Ott, William Williams, Kyle |
| contents | Suppose one wants to monitor a domain with sensors, each sensing a small ball-shaped region, but the domain is hazardous enough that one cannot control the placement of the sensors. A prohibitively large number of randomly placed sensors could be required to obtain static coverage. Instead, one can use fewer sensors by providing mobile coverage, a generalization of the static setup wherein every possible evader is detected by the moving sensors in a bounded amount of time. Here, we use topology in order to implement algorithms certifying mobile coverage that use only local data to solve the global problem. Our algorithms do not require knowledge of the sensors' locations, only their connectivity information. We experimentally study the statistics of mobile coverage in two dynamical scenarios. We allow the sensors to move independently (billiard dynamics and Brownian motion), or to locally coordinate their dynamics (collective animal motion models). Our detailed simulations show, for example, that collective motion can enhance performance: The expected time until the mobile sensor network achieves mobile coverage is lower for the D'Orsogna collective motion model than for the billiard motion model. Further, we show that even when the probability of static coverage is low, all possible evaders can nevertheless be detected relatively quickly by the mobile sensor network. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_09813 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Efficient Evader Detection in Mobile Sensor Networks Adams, Henry Ghosh, Deepjyoti Mask, Clark Ott, William Williams, Kyle Dynamical Systems Algebraic Topology Suppose one wants to monitor a domain with sensors, each sensing a small ball-shaped region, but the domain is hazardous enough that one cannot control the placement of the sensors. A prohibitively large number of randomly placed sensors could be required to obtain static coverage. Instead, one can use fewer sensors by providing mobile coverage, a generalization of the static setup wherein every possible evader is detected by the moving sensors in a bounded amount of time. Here, we use topology in order to implement algorithms certifying mobile coverage that use only local data to solve the global problem. Our algorithms do not require knowledge of the sensors' locations, only their connectivity information. We experimentally study the statistics of mobile coverage in two dynamical scenarios. We allow the sensors to move independently (billiard dynamics and Brownian motion), or to locally coordinate their dynamics (collective animal motion models). Our detailed simulations show, for example, that collective motion can enhance performance: The expected time until the mobile sensor network achieves mobile coverage is lower for the D'Orsogna collective motion model than for the billiard motion model. Further, we show that even when the probability of static coverage is low, all possible evaders can nevertheless be detected relatively quickly by the mobile sensor network. |
| title | Efficient Evader Detection in Mobile Sensor Networks |
| topic | Dynamical Systems Algebraic Topology |
| url | https://arxiv.org/abs/2101.09813 |