Optimal routing in VANET using improved meta‐heuristic approach: a variant of Jaya

Gnanasekar, Tony Santhosh; Samiappan, Dhandapani

doi:10.1049/iet-com.2018.6214

Cited by 10 publications

(2 citation statements)

References 36 publications

(49 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Reference 37, Gnanasekar et al proposed a cost function to resolve vehicle routing issues on the basis of network quality parameters such that congestion, collision, and QoS awareness. It determines the optimal route with minimal routing cost by the novel algorithm called mean computing Jaya algorithm.…”

Section: Literature Surveymentioning

confidence: 99%

Improved Quality of Service by canine olfactory route finding algorithm for Vehicular Ad Hoc Network

Ghosh

Misra

Chakraborty

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

QoS aware vehicular ad‐hoc network (VANET) routing protocols address the increasing demand for delay‐sensitive vehicular applications to establish intelligent transportation. Primary challenge with ad‐hoc nature of VANET is that the communication between vehicle‐to‐vehicle and vehicle‐to‐infrastructure is prone to link failure. Bio‐inspired algorithms offer robust solutions to secure VANET links. Accordingly in this article, novel canine olfactory route‐finding algorithm (CORFA) is proposed for VANET to achieve the best possible route with the minimum transmission of packets, which ensures enhanced QoS. The underlying architecture utilizes the exceptional ability of canines to evaluate and memorize the environment and pass the message to neighbors. It makes canines a great choice to model their behavior for VANET routing. RSUs are fundamental components of VANET that supply contents to the proceeding vehicles from their cache. As RSUs carry out information dissemination tasks efficiently, the already traversed and discovered routing paths in the recent past can be cached in RSU's storage and through back‐haul can be circulated to neighboring RSUs. Vehicles request the pre‐cached route and use them for data transmission. Thereby avoiding the route discovery and maintenance procedure reduces the routing overhead. In absence of a pre‐cached route, the fittest vehicle from each hop is selected as next forwarder for packet transmission. The proposed routing algorithm forms multiple routes during route discovery to handle link failure scenario. Traffic simulator, SUMO is used to generate the mobility model and integrated with MATLAB for analysing the performance of CORFA with related geographical and topological routing protocols that confirm the performance superiority of CORFA under several metrics such as packet delivery ratio, network latency, throughput, and overhead.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Improved Quality of Service by canine olfactory route finding algorithm for Vehicular Ad Hoc Network

Ghosh

Misra

Chakraborty

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Hence, the routing protocol is considered one of the possible solutions for establishing the route in VANET [12]. The reliable message routing of packets to the destination from the source defines the effectiveness of VANET [13]. VANET utilizes wireless media for communication which makes the network susceptible.…”

Section: Introductionmentioning

confidence: 99%

Trust based multi objective honey badger algorithm to secure routing in vehicular ad-hoc networks

Mutalik¹,

Patil²

2023

IJECE

View full text Add to dashboard Cite

<span lang="EN-US">A vehicular ad-hoc network (VANET) is a set of intelligent vehicles that interact without any fixed infrastructure. Data transmission between each transmitter/receiver pair is accomplished using routing protocols. However, communication over the VANET is vulnerable to malicious attacks, because of the unavailability of fixed infrastructure and wireless communication. In this paper, the trust based multi objective honey badger algorithm (TMOHBA) is proposed to achieve secure routing over the VANET. The TMOHBA is optimized by incorporating different cost functions, namely, trust, end to end delay (EED), routing overhead, energy, and distance. The developed secure route discovery using the TMOHBA is used to improve the robustness against the malicious attacks, for increasing the data delivery. Moreover, the shortest path discovery is used to minimize the delay while improving the security of VANET. The TMOHBA method is evaluated using the packet delivery ratio (PDR), throughput and EED. Existing researches such as hybrid enhanced glowworm swarm optimization (HEGSO) and ad-hoc on-demand distance vector based secure protocol (AODV-SP) are used to evaluate the TMOHBA method. The PDR of the TMOHBA method for 10 malicious attacks is 90.6446% which is higher when compared to the HEGSO and AODV-SP.</span>

show abstract

Cluster Optimization Using Metaheuristic JAYA Algorithm for Secure VANETs

Kaur

Kakkar

Singh

2022

Autonomous Vehicles Volume 2

View full text Add to dashboard Cite

Optimal routing in VANET using improved meta‐heuristic approach: a variant of Jaya

Cited by 10 publications

References 36 publications

Improved Quality of Service by canine olfactory route finding algorithm for Vehicular Ad Hoc Network

Improved Quality of Service by canine olfactory route finding algorithm for Vehicular Ad Hoc Network

Trust based multi objective honey badger algorithm to secure routing in vehicular ad-hoc networks

Cluster Optimization Using Metaheuristic JAYA Algorithm for Secure VANETs

Contact Info

Product

Resources

About