Enhancing VANET Safety Communications With AHP‐Based Resource Allocation

ABSTRACT Timely delivery of critical messages is paramount for road safety in Vehicular Ad‐hoc NETworks (VANETs), making effective resource block allocation crucial. Proper allocation of radio resources ensures these critical messages are successfully delivered. VANETs can incorporates widespread cellular networks for high reliability and low latency communication. The challenge lies in prioritizing messages of varying importance generated randomly in the dynamic VANET environment. This paper introduces a methodology for Vehicle‐to‐Vehicle (V2V) communication, utilizing base stations to allocate resource blocks. The proposed research work considers ProSe Per‐Packet Priority (PPPP), distance between transmitter and receiver, and message size for prioritizing VUE pairs through the Analytic Hierarchy Process (AHP). A novel algorithm is introduced to maximize the information value of the overall network while optimizing resource allocation, thus, prioritizing the assignment of resource blocks to vehicle users with a higher Signal‐to‐Noise Ratio (SNR). Simulation results show that the information value of ranked VUE pairs is superior compared to reverse‐ranked VUE pairs and existing state‐of‐the‐art algorithms. Furthermore, compared to the existing method, the proposed approach significantly reduces the delay experienced by safety‐critical messages.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-05-01
DOI
https://doi.org/10.1002/cpe.70109
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

Enhancing VANET Safety Communications With AHP‐Based Resource Allocation

Biraja Prasad Nayak, Lopamudra Hota, Arun Kumar, Ashok Kumar Turuk
Concurrency and Computation Practice and Experience
Vehicular Ad Hoc Networks (VANETs)
article

Enhancing VANET Safety Communications With AHP‐Based Resource Allocation

Biraja Prasad Nayak, Lopamudra Hota, Arun Kumar, Ashok Kumar Turuk
article en

Abstract

ABSTRACT Timely delivery of critical messages is paramount for road safety in Vehicular Ad‐hoc NETworks (VANETs), making effective resource block allocation crucial. Proper allocation of radio resources ensures these critical messages are successfully delivered. VANETs can incorporates widespread cellular networks for high reliability and low latency communication. The challenge lies in prioritizing messages of varying importance generated randomly in the dynamic VANET environment. This paper introduces a methodology for Vehicle‐to‐Vehicle (V2V) communication, utilizing base stations to allocate resource blocks. The proposed research work considers ProSe Per‐Packet Priority (PPPP), distance between transmitter and receiver, and message size for prioritizing VUE pairs through the Analytic Hierarchy Process (AHP). A novel algorithm is introduced to maximize the information value of the overall network while optimizing resource allocation, thus, prioritizing the assignment of resource blocks to vehicle users with a higher Signal‐to‐Noise Ratio (SNR). Simulation results show that the information value of ranked VUE pairs is superior compared to reverse‐ranked VUE pairs and existing state‐of‐the‐art algorithms. Furthermore, compared to the existing method, the proposed approach significantly reduces the delay experienced by safety‐critical messages.

Concurrency and Computation Practice and ExperienceVol. 37(12-14)
National Institute of Technology Rourkela (IN)
Openalex Percentile: Top 92%
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.