{"title":"A hybrid priority-aware genetic algorithm and opposition-based learning for scheduling IoT tasks in green fog computing","authors":"Rezvan Salimi , Sadoon Azizi , Javad Dogani","doi":"10.1016/j.comnet.2025.111349","DOIUrl":null,"url":null,"abstract":"<div><div>With the rapid growth of Internet of Things (IoT) devices, efficient task scheduling in fog computing systems has become crucial to ensure optimal resource utilization. In addition, the increasing demand for eco-friendly solutions has led to the emergence of green fog computing, which aims to leverage renewable energy sources to power fog nodes. Difficulties such as the diverse requirements of IoT tasks, the distributed and heterogeneous nature of fog nodes, and the fluctuations of renewable energy sources have made the task scheduling problem increasingly complex and pose significant challenges. To address these issues, in this paper, we first present a mixed-integer nonlinear programming (MINLP) model with the objective of minimizing the total system cost, which consists of brown energy consumption, deadline violation time, and monetary cost. To provide an effective and efficient solution for the model, we then propose <em>PGA-OBL</em>, a hybrid algorithm that combines the priority-aware genetic algorithm with an opposition-based learning strategy. The proposed algorithm is implemented in Python and evaluated through various experiments, comparing its performance with a standard genetic algorithm, a priority-aware semi-greedy approach, and a green energy-aware algorithm. The results confirm that PGA-OBL achieves significantly better convergence than the standard genetic algorithm. Additionally, it reduces the total system cost by approximately 6.2% to 20.8% compared to competing approaches.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111349"},"PeriodicalIF":4.4000,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625003160","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
With the rapid growth of Internet of Things (IoT) devices, efficient task scheduling in fog computing systems has become crucial to ensure optimal resource utilization. In addition, the increasing demand for eco-friendly solutions has led to the emergence of green fog computing, which aims to leverage renewable energy sources to power fog nodes. Difficulties such as the diverse requirements of IoT tasks, the distributed and heterogeneous nature of fog nodes, and the fluctuations of renewable energy sources have made the task scheduling problem increasingly complex and pose significant challenges. To address these issues, in this paper, we first present a mixed-integer nonlinear programming (MINLP) model with the objective of minimizing the total system cost, which consists of brown energy consumption, deadline violation time, and monetary cost. To provide an effective and efficient solution for the model, we then propose PGA-OBL, a hybrid algorithm that combines the priority-aware genetic algorithm with an opposition-based learning strategy. The proposed algorithm is implemented in Python and evaluated through various experiments, comparing its performance with a standard genetic algorithm, a priority-aware semi-greedy approach, and a green energy-aware algorithm. The results confirm that PGA-OBL achieves significantly better convergence than the standard genetic algorithm. Additionally, it reduces the total system cost by approximately 6.2% to 20.8% compared to competing approaches.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.