| Autor: |
Yu Du, Jianjun Hao, Zijing Chen, Yijun Guo |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Sensors, Vol 24, Iss 19, p 6496 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
1424-8220 |
| DOI: |
10.3390/s24196496 |
| Popis: |
The widespread adoption of Internet of Things (IoT) applications has driven the demand for obtaining sensor data. Using unmanned aerial vehicles (UAVs) to collect sensor data is an effective means in scenarios with no ground communication facilities. In this paper, we innovatively consider an indeterministic data collection task in a UAV-assisted wide and sparse wireless sensor network, where the wireless sensor nodes (SNs) obtain effective data randomly, and the UAV has no pre-knowledge about which sensor has effective data. The UAV trajectories, SN serve scheduling and UAV-SN association are jointly optimized to maximize the amount of collected effective sensing data. We model the optimization problem and address the indeterministic effective indicator by introducing an effectiveness probability prediction model. The reformulated problem remains challenging to solve due to the number of constraints varying with the variable, i.e., the serve scheduling strategy. To tackle this issue, we propose a two-layer modified knapsack algorithm, within which a feasibility problem is resolved iteratively to find the optimal packing strategy. Numerical results demonstrate that the proposed scheme has remarkable advantages in the sum of effective data blocks, reducing the completion time for collecting the same ratio of effective data by nearly 30%. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
