A Proposed Algorithmic Framework for Minimizing End-to-End Delay in VANET Environments

Aljawad, Ammar

doi:10.69513/jncs.v3.i1.a2

	A Proposed Algorithmic Framework for Minimizing End-to-End Delay in VANET Environments
Al-Noor Journal for Information Technology and Cybersecurity
Article 2, Volume 3, Issue 1, June 2026, Pages 10-17 PDF (557.9 K)
Document Type: Original Article
DOI: 10.69513/jncs.v3.i1.a2
Author
Ammar Aljawad^*
University of Kerbala
Abstract
This paper presents the “Delay Minimization with Random Mobility” (SMADM) framework as a theoretical controller and router algorithm for VANETs, aimed at minimizing end-to-end delay under random availability of links and rapid topology changes. The key contributions are the derivation of a mobility-aware “drift-plus-penalty” that converts long term delay minimization into decisions for each time slot, allowing for well defined routing options even when the network topology is changing rapidly over time. By integrating link continuity into the delay penalty while regulating queue growth, SMADM decouples the delay minimization objective from transient topological fluctuations, which typically destabilize greedy or pure geometric algorithms. The SMADM analysis aligns with well-established Lyapunov optimality bounds for access rates within the capacity region, and the resulting queue lengths are stable, with the achieved long-term delay penalty close to the upper bound. Furthermore, the framework has been validated through intensive simulations using SUMO (Simulation of Urban Mobility) in a representative urban environment. The results show SMADM significantly reducing end-to-end delay relative to GPSR and AODV, achieving randomized stability with a packet delivery ratio ranging from 45% to 75% under high traffic conditions.
Keywords
VANET; End-to-End Delay; Stochastic Optimization; Lyapunov Analysis; Random Geometric Graphs; Theoretical Routing Framework

Statistics Article View: 214 PDF Download: 146