PCon: A Novel Opportunistic Routing Protocol for Duty-Cycled Internet of Underwater Things
Bibliographic record
Abstract
Internet of Underwater Things (IoUTs) has emerged as an evolution of traditional underwater wireless sensor networks, with programmable nodes interconnected to the Internet. Despite the advancements, IoUTs will still face critical challenges imposed by the use of the lossy and energy-hungry underwater acoustic channel. Two major critical challenges faced by IoUT applications are the low reliable data delivery due to the poor quality of underwater acoustic links, and the high energy cost for underwater wireless communication. In this paper, we tackle both challenges by proposing the PCon protocol. The PCon is a power-controlled opportunistic routing protocol for data routing in duty-cycled IoUTs. At each hop, the PCon protocol selects the most suitable transmission power, from a set of discrete transmission power levels, to maintain a reasonable data delivery ratio while reducing the energy consumption of duty-cycled IoUTs. To do so, the PCon takes into consideration the energy cost for delivering the data packet, calculated as a function if the probability of having the next-hop node awake during the transmission. Simulation results showed that the PCon protocol, even in a harsh scenario of duty-cycling of 50%, ensures a packet delivery rate of 40% while decreases the energy cost in 78%.
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.000 | 0.001 |
| 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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".