Name
Abstract | ||
|---|---|---|
Recent years have witnessed the fast proliferation of camera sensors networks (CSNs) in numerous Internet of Things (IoT) applications. In order to a capture distinct image of targets from interesting directions, we leverage a special type of coverage called full-view coverage. Full-view coverage guarantees to obtain the images of a point from every direction, whereas it demands much more sensors than a conventional coverage. To this end, we investigate the problem of deploying the minimum number of rotatable camera sensors to achieve the full-view coverage of a set of target points, namely, optimal deployment for the full-view point coverage (OFP) problem. In this work, camera sensors are capable of rotating freely with infinite orientations, thus not only the deployment locations but also the orientations for each camera sensor are required to be optimized. To tackle this challenging problem, we first prove that the OFP problem is NP-hard. Then, we propose two approximation algorithms—iterative screening algorithm (ISA) and improved ISA (IISA) to solve the OFP. We further perform extensive simulations and conduct physical testings to demonstrate the superiority and effectiveness of our proposed solutions. Experimental results show that IISA can generally reduce the total number of required camera sensors by more than 20% compared with the state-of-the-art work. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/JIOT.2022.3182652 | IEEE Internet of Things Journal |
Keywords | DocType | Volume |
Camera sensor network,full-view coverage,optimal deployment | Journal | 9 |
Issue | ISSN | Citations |
21 | 2327-4662 | 0 |
PageRank | References | Authors |
0.34 | 18 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kun Shi | 1 | 0 | 0.34 |
| Shuxian Liu | 2 | 0 | 0.34 |
| Chao Li | 3 | 525 | 110.37 |
| Haoyu Liu | 4 | 8 | 6.25 |
| Shibo He | 5 | 1494 | 78.37 |
| Qi Zhang | 6 | 931 | 179.66 |
| Jiming Chen | 7 | 4389 | 238.91 |