Multi-path serial tasks offloading strategy and dynamic scheduling optimization in vehicular edge computing networks

Abstract

Vehicular edge computing networks (VECNs) can provide a promising solution to support efficient task execution of vehicles. Consider the channel and access time variations caused by the high mobility of vehicles in a vehicular environment when designing task offloading strategies in VECNs. In this paper, we perform multi-path offloading for a task vehicle with serial tasks based on both dynamic communication distances of vehicle-to-infrastructure (V2I) links, that of vehicle-to-vehicle (V2V) links, and slowly varying large-scale fading information of wireless channels. Considering the task vehicle's low delay requirements, our goal is to minimize the maximum task completion time of the task vehicle. A multi-path dynamic offloading scheme (MPDOS), composed of three parts, is proposed to achieve maximum delay minimization. The maximum processing capability of links between a task vehicle and roadside units (RSUs) is first taken as the objective to find the required communication links, which can decrease the total processing time by increasing transmission rate and execution capacity. Then, a task allocation scheme based on a multi-knapsack algorithm matches tasks and RSUs. Finally, a balancing scheme is leveraged to provide load-balancing computing performance across all computation devices. Numerical results show that our proposed scheme outperforms 30.7% of the RA algorithm, and the task completion rate can reach 99.55%.