Collaborative Deadline-sensitive Multi-task Offloading in Vehicular-Cloud Networks

Abstract

With the growing technological advancements in the Internet and advanced functionalities in vehicular networks, it becomes crucial to execute tasks quickly and efficiently. However, the limited onboard computational capacity and vehicle mobility make it challenging to accomplish latency-sensitive tasks efficiently. Task offloading provides a promising solution to overcome these challenges. Cloud data centers provide efficient solutions, but returning the results to the vehicles takes longer due to the large physical distance. Leveraging edge servers to execute latency-sensitive tasks provides a fast, interactive response and less transmission cost. However, in a dynamic network, vehicles will be in constant motion with varying speeds, resulting in frequent handoffs from one base station to another. Our proposed work aims to select the optimal nodes to perform binary offloading with minimum cost using the collaborative vehicular network. We use a greedy-based offloading approach to address these challenges and achieve better quality-of-service and quality-of-experience in a dynamic environment to minimize costs, delay reduction ratio, and satisfaction ratio. The proposed work outperforms the baseline by 60.44%, 53.43% in reducing total system cost, delay reduction ratio, and 36% improvement in the satisfaction ratio compared to baseline algorithms. © 2025 IEEE.