Hn-PERP: Hop by Hop-Power-Efficient Routing Protocol over Underwater Wireless Sensor Networks
Bibliographic record
Abstract
Underwater wireless sensor networks (UWSN) have recently been proposed as a way to monitor and explore the water depths’ environments. Efficiently delivering the data is still a challenging problem in these networks because of the weaknesses in the acoustic transmission. To tackle such a problem, we propose a novel algorithm provides controlling mechanisms for critical long-term data forwarding underwater sensor networks, called Hop by Hop Power-Efficient Routing Protocol (Hn-PERP). The proposed Hn-PERP is a centralized full-control model that enhances the network’s throughput and energy efficiency by a set of solutions depend on power monitoring in UWSN nodes. In particular, the model provides a guaranteed mechanism for scheduling and processing data transmission based on number of nodes, hops between the nodes, energy level and congestion within each node to minimize energy levels or power consumption by avoiding disconnected probability for any node, which in turn maximizing the network lifetime. Simulation results show that our proposed model is consistent with energy level and congestion, and is more accurate for enabling routing and data transmission. Therefore, the data packet delivery ratio and overall throughput also achieves robust scenarios of very sparse or/and weak networks, to keep on Performance stability in UWSN via adjusting hop-by-hop delay and energy consumption during packages delivery.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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".