Journal article · 2025 · Open access

Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing

Mohamed Elkawkagy, Ibrahim A. Elgendy, Samia Allaoua Chelloug, Heba Elbeh

IEEE Access, 13, 118237–118248 · Published 1 January 2025 · DOI 10.1109/access.2025.3584971

Open full textCite this paper

In brief

“Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing” is a 2025 journal article by Mohamed Elkawkagy and 3 co-authors, published in IEEE Access. OpenAlex counts 26 citations as of 19 November 2026, which puts it in the top 2% of works published in 2025 by citations. It is open access under a CC BY licence: the full text is free to read at IEEE Access.

Citations
26
Most cited in
2026 (18)
Field-weighted impact
6.27
References
51
Authors
4

Abstract

Mobile Edge Computing (MEC) alleviates latency and bandwidth strain on centralized cloud infrastructures by enabling the offloading of tasks to proximal edge servers, yet resource optimization in dense dynamic networks remains an open problem. This paper proposes a genetic algorithm (GA)-based approach to jointly optimize three important parameters: (1) the proportion of tasks offloaded to mobile edge servers (MES), (2) channel bandwidth allocation, and (3) computational resource allocation, in order to minimize the total task completion time with fairness among user devices (UDs). Resolving constraints such as limited wireless transmission capacity that is bounded and MES processing resources, the GA effectively explores solution spaces through selection, crossover, and mutation operations without falling into local optima. Simulation outcomes demonstrate 50% reduction in completion time compared to non-offloading strategies, with fairness indicated by standard deviation metrics showing equal performance across UDs. The algorithm scales, with task durations leveling off after 50 generations for 15 UDs and robustness being maintained up to 300 iterations. Results identify important thresholds (e.g., bandwidth > 5 MHz yields diminishing returns) and achieve near-optimal efficiency at high levels of resources. This work advances MEC efficiency by tackling multi-resource optimization issues through metaheuristic exploration, with a scalable approach to latency-sensitive IoT and 5G network use cases.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Elkawkagy, M., Elgendy, I. A., Chelloug, S. A., & Elbeh, H. (2025). Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing. IEEE Access, 13, 118237–118248. https://doi.org/10.1109/access.2025.3584971

MLA 9

Elkawkagy, Mohamed, et al. “Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing.” IEEE Access, vol. 13, 2025, pp. 118237–118248. https://doi.org/10.1109/access.2025.3584971.

Chicago

Elkawkagy, Mohamed, Ibrahim A. Elgendy, Samia Allaoua Chelloug, and Heba Elbeh. 2025. “Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing.” IEEE Access 13: 118237–118248. https://doi.org/10.1109/access.2025.3584971.

Harvard

Elkawkagy, M. et al. (2025) ‘Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing’, IEEE Access, 13, pp. 118237–118248. doi:10.1109/access.2025.3584971.

IEEE

M. Elkawkagy, I. A. Elgendy, S. A. Chelloug, and H. Elbeh, “Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing,” IEEE Access, vol. 13, pp. 118237–118248, 2025, doi: 10.1109/access.2025.3584971.

BibTeX

@article{elkawkagy2025genetic,
  title     = {{Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing}},
  author    = {Elkawkagy, Mohamed and Elgendy, Ibrahim A. and Chelloug, Samia Allaoua and Elbeh, Heba},
  journal   = {IEEE Access},
  year      = {2025},
  volume    = {13},
  pages     = {118237--118248},
  doi       = {10.1109/access.2025.3584971},
  url       = {https://doi.org/10.1109/access.2025.3584971}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • mobile edge computing
  • task offloading
  • resource allocation
  • genetic algorithm
  • latency reduction
  • channel bandwidth allocation
  • computing resource allocation
  • task completion time

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Elkawkagy, M., Elgendy, I. A., Chelloug, S. A., & Elbeh, H. (2025). Genetic Algorithm-Driven Joint Optimization of Task Offloading and Resource Allocation for Fairness-Aware Latency Minimization in Mobile Edge Computing. IEEE Access, 13, 118237–118248. https://doi.org/10.1109/access.2025.3584971

How many times has this paper been cited?

26 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at IEEE Access: sign in and open the full text from this page.

Who wrote this paper?

Mohamed Elkawkagy, Ibrahim A. Elgendy, Samia Allaoua Chelloug, Heba Elbeh.

What is the DOI of this paper?

10.1109/access.2025.3584971, permanently at https://doi.org/10.1109/access.2025.3584971. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.