Open AccessVoid hole avoidance routing algorithm for underwater sensor networks
Author(s) -
Kumar Gola Kamal,
Dhingra Manish,
Gupta Bhumika
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.1325
Subject(s) - underwater , computer science , void (composites) , routing algorithm , routing (electronic design automation) , algorithm , computer network , routing protocol , materials science , geology , oceanography , composite material
A communication void is one of the most serious issues in any routing techniques. This issue occurs when a node does not have any forwarder node to forward the data packets towards the sink node or surface station. The presence of a void node affects the overall performance of routing techniques in terms of end‐to‐end delay, data loss, energy consumption, and so on. The primary objective of this work is to avoid the void region in underwater sensor networks (UWSNs). For the same purpose, this work introduces the void‐hole avoidance routing algorithm for UWSNs. This work avoids horizontal transmission, which further reduces the end‐to‐end delay. The residual energy, depth, holding time, and distance from the sending node to the forwarding node and forwarding node to the surface station are used as a matrix to select the best forwarder node. The simulation has been done on MATLAB to analyse the performance of the proposed algorithm. The proposed routing algorithm attained better performance using the metrics, namely packet delivery delay, number of dead nodes, and energy tax with the values of 0.9147, 48, and 72.14 by varying the transmission range, and 0.9184, 38, and 71.12 by varying the network size, respectively.