Name
Abstract | ||
|---|---|---|
Target traversing is an important research topic in wireless sensor networks, with most studies examining coverage issues of the target's moving paths. The best coverage path is one that minimizes the target support to the sensors. Most existing algorithms either ensure that the target remains as close as possible to the sensors or deploy sensors to enhance coverage. In this paper, we consider a scenario where the target must traverse the sensor network within a certain time constraint. Furthermore, we propose some algorithms to ensure that the target stays close to the sensors within this time constraint. Simulations show that the proposed algorithms can solve traversal path problems in wireless sensor networks. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s10878-021-00745-x | JOURNAL OF COMBINATORIAL OPTIMIZATION |
Keywords | DocType | Volume |
Target traversing, Support path, Coverage path, Delaunay triangulation algorithm, Time constraint, Wireless sensor network | Journal | 42 |
Issue | ISSN | Citations |
1 | 1382-6905 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lili Zhang | 1 | 9 | 1.50 |
| Cheng-Kuan Lin | 2 | 0 | 1.01 |
| Xiaoqiang Chen | 3 | 0 | 1.01 |
| Jianxi Fan | 4 | 0 | 0.68 |
| Yuan-Hsiang Teng | 5 | 0 | 1.01 |