An Interference-aware and Collision-free MAC Protocol for Underwater Wireless Sensor Networks
Bibliographic record
Abstract
In the realm of underwater wireless communication, vast oceanic expanses often demand large-scale deployment of Underwater Wireless Sensor Networks (UWSNs). UWSNs rely on acoustic communication channels, presenting distinct challenges like prolonged propagation delays, restricted bandwidth, and dynamic topologies. Furthermore, the far-reaching and multi-path nature of acoustic signals results in significant hidden terminal problems and ubiquitous interference between neighboring nodes. Therefore, an efficient medium access control (MAC) protocol is crucial for optimizing UWSN performance. This article proposes IC-MAC, a MAC protocol tailored for UWSNs to avoid collisions and improve network performance. IC-MAC employs distributed clustering to group sensor nodes and the cluster head degree is defined for each node, which is a coefficient that accentuates nodes characterized by a higher incidence of collision associations. To identify interfering nodes and construct an interference-free graph, an interference identification algorithm is proposed. In addition, a heuristic graph coloring technique, guided by particle swarm optimization, allocates time slots efficiently to achieve collision-free transmission scheduling and enhanced spatial reuse. Simulations demonstrate the effectiveness of the IC-MAC protocol in enhancing throughput, reducing delay, and improving packet delivery ratio and energy efficiency. This is achieved through efficient spatial resource utilization and robust management of collisions and interference, specifically tailored for underwater acoustic channels, outperforming existing MAC protocols.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 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".