A Novel Approach for Computation Offloading Based on a Parallel Collaborative Genetic Algorithm in MEC

Edge computing relocates computational resources closer to user terminals, which can effectively reduce the latency of computation offloading. The Genetic Algorithm (GA) performs well in multi-objective optimization problems. However, GA exhibits a slow convergence rate when identifying the optimal...

Full description

Saved in:
Bibliographic Details
Published inWireless personal communications Vol. 140; no. 3-4; pp. 1119 - 1146
Main Authors Li, Wenzao, Tang, Ran, Wang, Xiaoke, Zhang, Xiaoming, Ren, Dehao, Jiang, Hong, Wen, Zhan
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Nature B.V 01.02.2025
Subjects
Online AccessGet full text
ISSN0929-6212
1572-834X
DOI10.1007/s11277-025-11760-0

Cover

More Information
Summary:Edge computing relocates computational resources closer to user terminals, which can effectively reduce the latency of computation offloading. The Genetic Algorithm (GA) performs well in multi-objective optimization problems. However, GA exhibits a slow convergence rate when identifying the optimal solution within extensive solution spaces. Therefore, this paper proposes a Parallel Cooperative Genetic Algorithm (PCGA) to find an optimal solution more quickly. This algorithm improves implementation efficiency by utilizing parallel computation. In our formulated computing offloading model, two processes collaboratively work to find the optimal solution, retaining the top five individuals with the highest fitness values in each iteration to update the population of GA. Furthermore, we designed a more comprehensive cost function to optimize objectives such as latency, energy consumption, and the quantity of offloaded tasks. Moreover, we considered a task priority offloading model that prioritizes the offloading of higher-priority tasks based on demand in multi-user and multi-task scenarios. The simulation results demonstrate that the proposed PCGA achieves higher fitness and faster convergence with the same fitness evaluation function. Specifically, with the same fitness evaluation function, the convergence speed of the PCGA algorithm is improved by 50% relative to that of the GA algorithm and 40% relative to that of the TOGA algorithm. In addition to this, PCGA significantly reduces the latency of the task offloading model by 19.7% and 4.4% compared to GA and TOGA, respectively.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-025-11760-0