Robust cryptographic scheme for reliable data communication in VANET (RCSRC) using clustering approach

In contemporary times, as accident rates continue to rise, there is a growing interest in vehicular ad hoc networks (VANETs) as a means to reduce accidents and vehicle damage, as well as enhance public safety. VANETs facilitate the transmission of messages within predefined areas to ensure system safety and efficiency. However, ensuring message authenticity in such a dynamic environment presents a significant challenge, with previous research focusing less on security aspects. Some previous protocols send plain message, which leads to the compromise of the message confidentiality. Although few algorithms work on security, they involve the communication to the trusted authority, which lead to increased latency. Thus, in this paper we propose a robust cryptographic scheme for reliable data communication in VANET which minimizes the involvement of trusted authority and uses communication ID of vehicle for communication in place of real entities. Security analysis of the proposed scheme is showing the sturdiness of the proposed protocol again various types of safety spasms. The evaluation of its performance includes assessing communication cost and time, revealing the proposed algorithm's efficiency compared to others.

Authors

Institutions

Publication Details

Journal
EURASIP Journal on Wireless Communications and Networking
Published
2024-10-10
DOI
https://doi.org/10.1186/s13638-024-02408-x
Citations
4
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust cryptographic scheme for reliable data communication in VANET (RCSRC) using clustering approach

Kamal Kumar Gola, Wajid Ali, Gulista Khan, Shalini Ninoria
4 citations
EURASIP Journal on Wireless Communications and Networking
Vehicular Ad Hoc Networks (VANETs)
0.83
article

Robust cryptographic scheme for reliable data communication in VANET (RCSRC) using clustering approach

Kamal Kumar Gola, Wajid Ali, Gulista Khan, Shalini Ninoria
article en
4 citations

Abstract

In contemporary times, as accident rates continue to rise, there is a growing interest in vehicular ad hoc networks (VANETs) as a means to reduce accidents and vehicle damage, as well as enhance public safety. VANETs facilitate the transmission of messages within predefined areas to ensure system safety and efficiency. However, ensuring message authenticity in such a dynamic environment presents a significant challenge, with previous research focusing less on security aspects. Some previous protocols send plain message, which leads to the compromise of the message confidentiality. Although few algorithms work on security, they involve the communication to the trusted authority, which lead to increased latency. Thus, in this paper we propose a robust cryptographic scheme for reliable data communication in VANET which minimizes the involvement of trusted authority and uses communication ID of vehicle for communication in place of real entities. Security analysis of the proposed scheme is showing the sturdiness of the proposed protocol again various types of safety spasms. The evaluation of its performance includes assessing communication cost and time, revealing the proposed algorithm's efficiency compared to others.

EURASIP Journal on Wireless Communications and NetworkingVol. 2024(1)
Teerthanker Mahaveer University (IN), Indian Institute of Technology Roorkee (IN)
Openalex Percentile: Top 26%
Vehicular Ad Hoc Networks (VANETs)
0.83
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.