A Traffic-Aware Trust Model Based on Edge Computing for Underwater Wireless Sensor Networks
Bibliographic record
Abstract
The burgeoning deployment of Underwater Acoustic Sensor Networks (UASNs) for maritime applications highlights the critical need for reliable trust models to defend against internal security threats. Existing trust models are often inadequate due to high packet error rates inherent in underwater communication and a lack of accounting for nodes' traffic behavior. Additionally, conventional UASN architectures suffer from significant latency in gathering and processing trust evidence, which delays the identification of adversarial nodes. Addressing these limitations, this paper proposes the Traffic-Aware and Edge Computing-Enabled Trust Model (TECTM), a solution expressly conceived for UASNs. TECTM integrates environmental models to assess the acoustic environment's impact on communication and employs network traffic analysis as a trustworthy metric for identifying attack patterns. Autonomous Underwater Vehicles (AUVs) serve as edge computing nodes, leveraging a machine learning algorithm to enhance trust assessments within node clusters. Moreover, TECTM introduces a refined trust update mechanism, designed to be responsive to the dynamic underwater environment and complex attack behaviors. Through comparative simulations, TECTM demonstrates enhanced accuracy in the detection of malicious nodes, outperforming other methods.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 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".