RSU-Empowered Deadline-aware Task Scheduling Strategy in Vehicular Edge Computing
Mirabela Melinda Medvei, Ştefania Ştefănescu · 2025
Vehicular Edge Computing (VEC) has emerged as an attractive and feasible paradigm within the Internet of Vehicles (IoV), where computational tasks are offloaded to Road Side Units (RSUs) to reduce both processing delays and resource consumption in vehicles. However, significant challenges arise from the dynamic nature of Vehicular Edge Computing Network (VECN), which is influenced by factors such as vehicle mobility, the limited coverage range of RSUs during task offloading, the real-time unpredictability of RSU workload, and traffic congestion causing network bottlenecks at RSUs. Another challenge is resource management on the RSU side. This paper focuses on minimizing the overall system service delay, providing more effective task scheduling and resource allocation strategies for vehicular tasks. It outlines a scenario where multiple vehicles offload tasks to a nearby RSU, establishing a task pool. In this setup, RSU serves as the coordinator responsible for task scheduling. Specifically, we introduce the Vehicular Earliest Deadline First (V-EDF) algorithm, an enhanced version of the EDF algorithm tailored for vehicular task scheduling. The main enhancements of this algorithm focus on improving resource allocation and prioritizing high-priority tasks while factoring in elements such as task priority, deadlines computational requirements and other relevant parameters. We conducted experimental validation of V-EDF using real-time vehicular aperiodic task sets and evaluated the effectiveness of our proposed algorithm through comparison and analysis.