Adaptive Error-Correction Coding Scheme for Underwater Acoustic Communication Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Underwater acoustic communication networks (UWANs) have recently attracted much attention in the research community. Two properties that set UWANs apart from most radio-frequency wireless communication networks are the long propagation delay and the possible sparsity of the network topology. This in turn offers opportunities to optimize throughput through time and spatial reuse. In this paper, we propose a new adaptive coding method to realize the former. We consider time-slotted scheduling protocols, which are a popular solution for contention-free and interference-free access in small-scale UWANs, and exploit the surplus guard time that occurs for individual links for improving transmission reliability. In particular, using link distances as side information, transmitters utilize the available portion of the time slot to adapt their code rate and increase reliability. Since increased reliability trades off with energy consumption per transmission, we optimize the code rate for best tradeoff, considering both single and multiple packet transmission using the incremental redundancy hybrid automatic repeat request (IR-HARQ) protocol. For practical implementation of this adaptive coding scheme, we consider punctured and rateless codes. Simulation results demonstrate the gains achieved by our coding scheme over fixed-rate error-correction codes in terms of both throughput and consumption of transmitted energy per successfully delivered packet. We also report results from a sea trial conducted at the Haifa harbor, which corroborate the simulations.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it