Energy Efficient Decentralized Authentication in Internet of Underwater Things Using Blockchain
Bibliographic record
Abstract
In recent years, there has been rapid growth in developing smart cities. Nearly 70% of the Earth’s surface is covered by water and a large proportion of underwater environments are still unknown and have not been explored. In this context, Internet of things (IoT) is one of the most important technologies used in smart cities. Due to the growth of IoT and its influence in all areas of human life, including the underwater environment, a new class of IoT, called Internet of underwater things (IoUT) has emerged. IoUT includes a network of underwater smart devices that are connected to each other and has applications in environmental monitoring, underwater exploration, disaster prevention and military. In autonomous interactions of underwater devices, objects must be authenticated and securely interconnected to avoid security risks by malicious nodes. Most authentication methods and security mechanisms are centralized and often require a trustful third party in communications, which may well increase the computation cost and energy consumption due to the subsequent overhead, especially for underwater communications. On the other hand, there are restrictions on devices in the underwater environment, the most important of which are energy constraints. In this paper, we propose a robust, transparent, and energy-efficient decentralized authentication mechanism for IoUT using blockchain technology. We show through results that the proposed method is suitable for underwater devices with limited memory, energy, and computational power. The proposed model’s decentralized authentication in a cluster network has a significant effect on reducing the energy consumption of the devices by 74.63% compared to classic authentication methods. Moreover, using the proposed method allows a savings of more than 41.9% in end-to-end delay and increases delivery rate by 21.6%.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".