A Memetic Algorithm for Cooperative Complex Task Offloading in Heterogeneous Vehicular Networks
Hualing Ren, Kai Liu, Guozhi Yan, Yantao Li, Choujun Zhan, Songtao Guo
Abstract
With the booming of intelligent connected vehicles as well as the emergence of edge computing paradigm, complex task offloading becomes a critical yet promising issue in vehicular networks to enable various real-time and scalable future intelligent systems. This article makes the first effort on proposing an end-edge-cloud cooperation architecture together with a tailored memetic algorithm for complex task offloading in heterogeneous vehicular networks. Specifically, we consider the scenario where a complex task consists of multiple subtasks, which require different amount of resources for being processed, and a task is completed only when all of its subtasks have been processed. Then, we formulate a Cooperative Complex Task Offloading (CCTO) problem by considering heterogeneous computation, communication and memory capacities of nodes in vehicular networks, as well as task dependency and mobility of vehicles, targeting at minimizing average service delay of the system. We prove that CCTO is NP-hard by constructing a polynomial time reduction from the parallel machines scheduling problem (PMSP). Further, we propose a memetic computing based algorithm named MDMA (Meme Dependency-aware Memetic Algorithm), which consists of a meme dependency based encoding solution, a mix-strategy for initialization, a dedicated offspring generation scheme, a meme recombined strategy for local search, and a task feature driven method for repairing infeasible solutions. Finally, we build a simulation model and give a comprehensive performance evaluation. The results demonstrate the superiority of MDMA on minimizing the service delay by best exploiting heterogeneous resources in vehicular networks.