Distributed Energy Optimization Protocol using Crow Search Algorithm in Underwater Acoustic Sensor Network for Energy Enhancement Comparing with Depth Based Routing Algorithm

Reddy, K. Maheswar; Ayyadurai, M.

doi:10.1109/macs56771.2022.10022602

Cited by 1 publication

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, since the delay of the same path might change after the second phase of optimisation, we cancel the TPGF optimisation process. At the same time, because the routing metric of distance to the sink is no longer enough to meet the QoS criteria of end-to-end delay, the sleeping delay of neighbour nodes must be lowered in random duty-cycled WSNs [53] in order to find paths. In short, standard TPGF with a random duty cycle sends packets to the neighbour who is closest to the sink, while RrTPGF sends packets to the neighbour whose routing weight is the lowest.…”

Section: The Basic Design Of Rrtpgfmentioning

confidence: 99%

Efficient Geographic Routing for High-Speed Data in Wireless Multimedia Sensor Networks

Pandith,

Ramaswamy,

Srikantaswamy

et al. 2023

JESA

View full text Add to dashboard Cite

In recent eras, a large amount of data has been transferred through wireless networks in fifth-generation communication using a two-phase geography greedy forwarding (TPGF) routing algorithm with reconfigurable routing metrics represented by RrTPGF in random duty-cycled wireless multilevel multimedia sensor networks (WMSNs). The proposed method reduces the sleep delay in geographic routing networks. the systematically forwarded node in the geographic routing network to identify the significant neighboring nodes. The proposed algorithm is efficient in identifying the geographical distance of the neighboring node and identifying the sleeping delay of the nodes during the communication process. The proposed algorithm efficiently differentiates the worked node from the unworked node on the basis that it identifies the optimal single routing path with a low sleeping delay time at geographic routing. As per the simulation result, the performance of the proposed method shows better results as compared to the conventional methods when considering the scenario size of 750mm × 450mm and 250 nodes with respect to the average delay of the proposed method, which is reduced to 0.6%, and the average hop counts, which are reduced to 0.56% as compared to the conventional method.

show abstract

Section: The Basic Design Of Rrtpgfmentioning

confidence: 99%