DV-Hop Localization Algorithm Optimized by NSGA-II for UWSNs
Bibliographic record
Abstract
To address the pressing demands of marine resource exploration, this paper investigates the problem of node localization in underwater acoustic wireless networks and proposes a two-stage progressive collaborative optimization framework to overcome the performance limitations of the traditional DV-Hop algorithm. Error sources of DV-Hop in underwater scenarios are systematically analyzed, and a quantitative localization model, NSGA-II-DV-Hop, is established to incorporate both hop count estimation errors and position calculation errors. Based on this analysis, a two-stage optimization strategy is developed. In the first stage, an adaptive particle swarm optimization model, PSO-DV-Hop, is designed, where a dynamic inertia weight adjustment mechanism enhances global search efficiency, thereby reducing localization error and energy consumption. In the second stage, a Pareto-Based evolutionary optimization model, NSGA-II-DV-Hop, is introduced to realize simultaneous optimization of localization accuracy and energy efficiency through Pareto frontier analysis. Experimental results demonstrate that PSO-DV-Hop improves localization performance by reducing the average error by 18.2% and lowering the number of convergence iterations by 61%. Building on this, NSGA-II-DV-Hop further extends the network lifetime by 26.9%, reduces average node energy consumption by 10.07%, and achieves an additional 8.67% energy optimization.
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.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 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".