Reducing the Network Latency to Maintain Network Stability in UASN by Using Bio-Inspired Algorithms
Bibliographic record
Abstract
Underwater Acoustic Sensor Networks, also known as UASNs, are an important component of many different types of systems, including those used for environmental monitoring, maritime exploration, and underwater surveillance. However, UASNs confront a number of issues, one of which is a high network latency, which can have a substantial influence on both the stability and performance of the network. Utilizing the Dolphin Swarm Optimization (DSO) algorithm and contrasting it with the Cuckoo Search Algorithm (CSA) is what this study suggests as a revolutionary method to lessen the amount of time it takes for a network connection to be established as well as to keep the connection stable. This study performs simulations with a realistic model of an underwater environment to determine which method is more efficient at cutting down on the amount of time it takes for network requests to be processed. This study evaluates the performance of DSO and CSA regarding the decrease of latency, stability, and energy utilization. The findings of the simulation show that the DSO algorithm outperforms the CSA algorithm when it comes to lowering network latency while keeping network stability intact. The DSO method optimizes the network's topology, increasing communication effectiveness and decreasing the time it takes for packets to be transmitted. In addition, DSO displays superior resistance to network disturbances and node failures compared to CSA.
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 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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".