IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i2p281-d1319491.html
   My bibliography  Save this article

An Evolutionary Algorithm for Task Clustering and Scheduling in IoT Edge Computing

Author

Listed:
  • Adil Yousif

    (Department of Computer Science, College of Science and Arts-Sharourah, Najran University, Sharourah 68378, Saudi Arabia)

  • Mohammed Bakri Bashir

    (Department of Mathematics, Turubah University College, Taif University, Taif 26571, Saudi Arabia
    Department of Computer Science, Faculty of Computer Science and Information Technology, Shendi University, Shendi 41601, Sudan)

  • Awad Ali

    (Department of Computer Science, College of Science and Arts-Sharourah, Najran University, Sharourah 68378, Saudi Arabia)

Abstract

The Internet of Things (IoT) edge is an emerging technology of sensors and devices that communicate real-time data to a network. IoT edge computing was introduced to handle the latency concerns related to cloud computing data management, as the data are processed closer to their point of origin. Clustering and scheduling tasks on IoT edge computing are considered a challenging problem due to the diverse nature of task and resource characteristics. Metaheuristics and optimization methods are widely used in IoT edge task clustering and scheduling. This paper introduced a new task clustering and scheduling mechanism using differential evolution optimization on IoT edge computing. The proposed mechanism aims to optimize task clustering and scheduling to find optimal execution times for submitted tasks. The proposed mechanism for task clustering is based on the degree of similarity of task characteristics. The proposed mechanisms use an evolutionary mechanism to distribute system tasks across suitable IoT edge resources. The clustering tasks process categorizes tasks with similar requirements and then maps them to appropriate resources. To evaluate the proposed differential evolution mechanism for IoT edge task clustering and scheduling, this study conducted several simulation experiments against two established mechanisms: the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO). The simulation configuration was carefully created to mimic real-world IoT edge computing settings to ensure the proposed mechanism’s applicability and the simulation results’ relevance. In the heavyweight workload scenario, the proposed DE mechanism started with an execution time of 916.61 milliseconds, compared to FA’s 1092 milliseconds and PSO’s 1026.09 milliseconds. By the 50th iteration, the proposed DE mechanism had reduced its execution time significantly to around 821.27 milliseconds, whereas FA and PSO showed lesser improvements, with FA at approximately 1053.06 milliseconds and PSO stabilizing at 956.12 milliseconds. The simulation results revealed that the proposed differential evolution mechanism for edge task clustering and scheduling outperforms FA and PSO regarding system efficiency and stability, significantly reducing execution time and having minimal variation across simulation iterations.

Suggested Citation

  • Adil Yousif & Mohammed Bakri Bashir & Awad Ali, 2024. "An Evolutionary Algorithm for Task Clustering and Scheduling in IoT Edge Computing," Mathematics, MDPI, vol. 12(2), pages 1-18, January.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:281-:d:1319491
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/2/281/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/2/281/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Elaziz, Mohamed Abd & Ewees, Ahmed A. & Ibrahim, Rehab Ali & Lu, Songfeng, 2020. "Opposition-based moth-flame optimization improved by differential evolution for feature selection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 168(C), pages 48-75.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kavitha, S. & Satheeshkumar, J. & Amudha, T., 2024. "Multi-label feature selection using q-rung orthopair hesitant fuzzy MCDM approach extended to CODAS," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 148-173.
    2. Ahmed A. Ewees & Mohammed A. A. Al-qaness & Laith Abualigah & Diego Oliva & Zakariya Yahya Algamal & Ahmed M. Anter & Rehab Ali Ibrahim & Rania M. Ghoniem & Mohamed Abd Elaziz, 2021. "Boosting Arithmetic Optimization Algorithm with Genetic Algorithm Operators for Feature Selection: Case Study on Cox Proportional Hazards Model," Mathematics, MDPI, vol. 9(18), pages 1-22, September.
    3. Mohanrasu, S.S. & Janani, K. & Rakkiyappan, R., 2024. "A COPRAS-based Approach to Multi-Label Feature Selection for Text Classification," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 3-23.
    4. Mohamed Abd Elaziz & Laith Abualigah & Dalia Yousri & Diego Oliva & Mohammed A. A. Al-Qaness & Mohammad H. Nadimi-Shahraki & Ahmed A. Ewees & Songfeng Lu & Rehab Ali Ibrahim, 2021. "Boosting Atomic Orbit Search Using Dynamic-Based Learning for Feature Selection," Mathematics, MDPI, vol. 9(21), pages 1-17, November.
    5. Laith Abualigah & Mohamed Abd Elaziz & Dalia Yousri & Mohammed A. A. Al-qaness & Ahmed A. Ewees & Raed Abu Zitar, 2023. "Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering," Journal of Intelligent Manufacturing, Springer, vol. 34(8), pages 3523-3561, December.
    6. Fan Wang & Xiang Liao & Na Fang & Zhiqiang Jiang, 2022. "Optimal Scheduling of Regional Combined Heat and Power System Based on Improved MFO Algorithm," Energies, MDPI, vol. 15(9), pages 1-30, May.
    7. Yu, Xiaobing & Wang, Haoyu & Lu, Yangchen, 2024. "An adaptive ranking moth flame optimizer for feature selection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 219(C), pages 164-184.
    8. Janani, K. & Mohanrasu, S.S. & Kashkynbayev, Ardak & Rakkiyappan, R., 2024. "Minkowski distance measure in fuzzy PROMETHEE for ensemble feature selection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 264-295.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:281-:d:1319491. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.