On Connectivity of UAV-Assisted Data Acquisition for Underwater Internet of Things
Bibliographic record
Abstract
Underwater exploration activities have grown significantly due to the proliferation of underwater Internet of Things (UIoT). However, to transmit sensor data from UIoT to remote onshore data processing center requires a huge cost of deploying and maintaining communication infrastructures. In this article, we propose an unmanned aerial vehicles (UAVs)-assisted underwater data acquisition scheme by placing multiple sink nodes on the water surface to serve as intermediate relays between underwater sensors (IoT nodes) and UAVs. In our scheme, the sensor data are first transmitted via an acoustic-signal link to a buoyant sink node, which then forwards the data to a UAV via an electromagnetic link. In particular, we adopt two sink-node-deployment methods, i.e., grid placement and random placement of sink nodes. Since the path connectivity from an underwater sensor node to the UAV is crucial to guarantee reliable data acquisition tasks, we establish a theoretical framework to analyze the path connectivity via the intermediate sink node for both grid and random sink-node-deployment methods. Extensive simulation results validate the accuracy of the proposed analytical model. Moreover, our results also reveal the relationship between the path connectivity and other factors, such as sink node placements, antenna beamwidth of UAVs, and wind speed. We also further extend our UAV-assisted data acquisition to other scenarios with the consideration of trajectories of UAVs, movements of sink nodes, interference of both underwater acoustic and terrestrial radio links, and integration with edge computing.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".