EGMPIP: Enhanced Geographic Multipath Routing using Gossip-Based Direct Neighbor Discovery Algorithm in Wireless Sensor Networks

Senthilkumar, N.; Revathy, N.; Guhan, T.

doi:10.1109/iccci56745.2023.10128546

Cited by 1 publication

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RrTPGF is based on the TPGF algorithm, but with a few changes. The TPGF algorithm, which was explained in a part of related work, uses two phases to maximise the number of node-disjoint pathways while avoiding the gaps in the traditional geographic network model [52]. In random dutycycled wireless sensor networks (WSNs), the end-to-end delay of any path changes when the state of the relay nodes along the path changes.…”

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%