Secure and Efficient Routing in Fog-Enabled VANETs: A Clustering-Based Approach

Abstract : Vehicular Ad Hoc Networks (VANETs) play a crucial role in intelligent transportation systems (ITS) by enabling seamless vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, VANETs face significant challenges related to security, routing efficiency, and dynamic load balancing. This paper proposes a novel approach integrating clustering-based routing, fog computing, and authentication mechanisms to enhance network performance. The article proposes a new method for node authentication and redistribution of loads in vehicular ad-hoc networks (VANETs). The proposed method is designed to do better for VANETs in all aspects related to secure node authentication and the efficient load assignment among fog nodes. The approach uses a polynomial-based node authentication protocol and balances the network load dynamically by evaluating two parameters: Network Availability Bandwidth (NAB) and request count. Simulation-based performance evaluation was carried out for comparisons with existing algorithms. Metrics of comparison included throughput, packet delivery ratio (PDR), and latency. The proposed method clearly shows all improvements over existing algorithms. Throughput increased by 8591.86 packets per second; PDR improved to 0.833; latency was cut down to 6.4951 seconds, which makes it a potential candidate for performance enhancement in VANETs.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-17
DOI
https://doi.org/10.5281/zenodo.15038061
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

Secure and Efficient Routing in Fog-Enabled VANETs: A Clustering-Based Approach

Zenodo (CERN European Organization for Nuclear Research)
Vehicular Ad Hoc Networks (VANETs)
article

Secure and Efficient Routing in Fog-Enabled VANETs: A Clustering-Based Approach

article en

Abstract

Abstract : Vehicular Ad Hoc Networks (VANETs) play a crucial role in intelligent transportation systems (ITS) by enabling seamless vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, VANETs face significant challenges related to security, routing efficiency, and dynamic load balancing. This paper proposes a novel approach integrating clustering-based routing, fog computing, and authentication mechanisms to enhance network performance. The article proposes a new method for node authentication and redistribution of loads in vehicular ad-hoc networks (VANETs). The proposed method is designed to do better for VANETs in all aspects related to secure node authentication and the efficient load assignment among fog nodes. The approach uses a polynomial-based node authentication protocol and balances the network load dynamically by evaluating two parameters: Network Availability Bandwidth (NAB) and request count. Simulation-based performance evaluation was carried out for comparisons with existing algorithms. Metrics of comparison included throughput, packet delivery ratio (PDR), and latency. The proposed method clearly shows all improvements over existing algorithms. Throughput increased by 8591.86 packets per second; PDR improved to 0.833; latency was cut down to 6.4951 seconds, which makes it a potential candidate for performance enhancement in VANETs.

Zenodo (CERN European Organization for Nuclear Research)
Kurukshetra University (IN), Delhi Technological University (IN)
Industry, innovation and infrastructure
Openalex Percentile: Top 56%
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.