A hybrid path finder-based vortex search algorithm for optimal energy-efficient node placing and routing in UWSN

In recent times, the research community has demonstrated significant interest in Underwater Wireless Sensor Networks (UWSNs), where extensive sensor deployments in oceans and rivers aim to monitor the underwater environment. Energy consumption poses a primary challenge due to the difficulty of repla...

Full description

Saved in:
Bibliographic Details
Published in:Results in control and optimization Vol. 14; p. 100379
Main Authors: Byeon, Haewon, Kumar, Santosh, Mahajan, Divya, Haribabu, K., Sivaprakash, M., Patil, Harshal, Sunil, J.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.03.2024
Elsevier
Subjects:
ISSN:2666-7207, 2666-7207
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent times, the research community has demonstrated significant interest in Underwater Wireless Sensor Networks (UWSNs), where extensive sensor deployments in oceans and rivers aim to monitor the underwater environment. Energy consumption poses a primary challenge due to the difficulty of replacing or recharging batteries in these environments. Existing studies have employed K-Means technology to minimize power consumption in underwater transmission nodes. However, these studies have often overlooked the consideration of residual energy and void region creation in their optimization approaches. To address these challenges, we introduce a novel Hybrid path finder-based vortex search (HPF-VS) algorithm, utilized for cluster head selection and optimization of node locations and remaining energy. To extend network coverage beyond limited transmission ranges, inaccessible nodes at the network periphery employ the improved Dwarf Mongoose Optimization (IDMO) algorithm. Our proposed techniques demonstrate superior performance compared to existing methods, showcasing minimized energy consumption, reduced delay, improved packet delivery ratio, and enhanced throughput. Specifically, the proposed approach achieves a delay of 2.01 s and a throughput of 32.21 Kbps, surpassing the performance of state-of-the-art methodologies we benchmarked against.
ISSN:2666-7207
2666-7207
DOI:10.1016/j.rico.2024.100379