Selective Hopping and Stable Path Integration to Boost AODV's Message Delivery Assurance

In addition to carrying communications, Vehicular Ad-hoc Networks can be utilized to transfer vital information across nodes in the network, potentially averting disastrous losses. By following the established standards, this vital information is transmitted by moving cars on the road in conjunction with parked cars. In this case, the communication is forwarded via a mediator known as a "roadside unit." The Ad-hoc On-Demand Distance Vector (AODV) routing protocol is one of the finest for such a wireless environment because it can tolerate variations in vehicle density and speed. Though it performs better than other comparable protocols, the AODV routing protocol does not show much promise when it comes to unreachable nodes, unstable forwarding paths, broadcasting storms, and short connection lifetimes. In order to improve efficiency, this research paper suggests adding multiple Road Side Units, modifying the conventional AODV routing protocol by adding selective hopping and the Delay Minimization Problem. To confirm the usefulness of the suggested model in terms of propagation delay, transmission loss, network lifetime, etc., it is also simulated. The findings gained support the superiority of the suggested strategy, laying the groundwork for its wider implementation.

Authors

Institutions

Publication Details

Journal
International Research Journal of Multidisciplinary Technovation
Published
2025-04-12
DOI
https://doi.org/10.54392/irjmt2533
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Selective Hopping and Stable Path Integration to Boost AODV's Message Delivery Assurance

Lakshmi Kurup, Neel Kothari, Pratik Kanani, Darshana Sankhe et al.
International Research Journal of Multidisciplinary Technovation
Vehicular Ad Hoc Networks (VANETs)
article

Selective Hopping and Stable Path Integration to Boost AODV's Message Delivery Assurance

Lakshmi Kurup, Neel Kothari, Pratik Kanani, Darshana Sankhe, Deepali Patil, Gayatri Pandya
article en

Abstract

In addition to carrying communications, Vehicular Ad-hoc Networks can be utilized to transfer vital information across nodes in the network, potentially averting disastrous losses. By following the established standards, this vital information is transmitted by moving cars on the road in conjunction with parked cars. In this case, the communication is forwarded via a mediator known as a "roadside unit." The Ad-hoc On-Demand Distance Vector (AODV) routing protocol is one of the finest for such a wireless environment because it can tolerate variations in vehicle density and speed. Though it performs better than other comparable protocols, the AODV routing protocol does not show much promise when it comes to unreachable nodes, unstable forwarding paths, broadcasting storms, and short connection lifetimes. In order to improve efficiency, this research paper suggests adding multiple Road Side Units, modifying the conventional AODV routing protocol by adding selective hopping and the Delay Minimization Problem. To confirm the usefulness of the suggested model in terms of propagation delay, transmission loss, network lifetime, etc., it is also simulated. The findings gained support the superiority of the suggested strategy, laying the groundwork for its wider implementation.

International Research Journal of Multidisciplinary Technovation
Dwarkadas J. Sanghvi College of Engineering (IN)
Openalex Percentile: Top 94%
Vehicular Ad Hoc Networks (VANETs)
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.