Adjusted Rand Index-Guided DPSO for Clustering and Data Routing in Wireless Sensor Networks
Sidi Mohamed Mohi Dine, Zhiyi Zhu, Patrick Finnerty, Chikara Ohta · 2026
Read Adjusted Rand Index-Guided DPSO for Clustering and Data Routing in Wireless Sensor Networks by Sidi Mohamed Mohi Dine, Zhiyi Zhu, Patrick Finnerty, Chikara Ohta (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13306518.txt.
Description
Sidi Mohamed Mohi Dine designed an energy-saving routing scheme for wireless sensor networks in a 2026 study. Clustering and path choice decide how long a network lives before its first node runs out of power.
Shortest-path routing sets efficient routes, while a discrete swarm search hunts the cluster layout that stretches lifetime furthest. A similarity index watches how close swarm members sit to the best layout, triggering a shake-up when the group stalls too early. Simulations showed richer search movement and longer stable operation in reported results, delaying first node death.
Catalog record
| CREATOR | Sidi Mohamed Mohi Dine, Zhiyi Zhu, Patrick Finnerty, Chikara Ohta |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 96595 |
| LICENSE | https://creativecommons.org/licenses/by/4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |