Name
Abstract | ||
|---|---|---|
A set of wireless sensors is called a barrier cover if they can monitor the boundary of an area so that an intruder cannot enter the area without being found by any sensor. The quality of a barrier cover is the shortest length of path along which an intruder can enter the area from outside. We study four problems, in this paper, related to the quality of the barrier cover and give their computational complexity and algorithmic solutions. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1504/IJSNET.2019.098558 | INTERNATIONAL JOURNAL OF SENSOR NETWORKS |
Keywords | Field | DocType |
wireless sensor network, barrier cover, computational complexity, algorithm | Wireless,Computer science,Computer network,Wireless sensor network,Computational complexity theory | Journal |
Volume | Issue | ISSN |
29 | 4 | 1748-1279 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weili Wu | 1 | 2093 | 170.29 |
| Zhao Zhang | 2 | 706 | 102.46 |
| Chuangen Gao | 3 | 0 | 0.34 |
| Hai Du | 4 | 9 | 2.36 |
| Hua Wang | 5 | 76 | 14.82 |
| Ding-Zhu Du | 6 | 3497 | 283.06 |