Skip to content
Open access

Benchmarking Bio-Inspired Metaheuristics for Load-Aware Task Offloading in Hierarchical IoT-Fog-Cloud Ecosystems

2026 · International Journal of Advanced Computer Science and Applications · 0 citations · 25 references

TL;DR

A novel unified benchmarking framework that systematically evaluates five prominent metaheuristics — Particle Swarm Optimization (PSO), Genetic Algorithm, Genetic Algorithm (GA), Bacterial Foraging Optimization (BFO), Ant Colony Optimization (ACO), and Artificial Bee Colony — for load balancing within a three-tier architecture using the iFogSim simulator reveals no universally optimal algorithm.

Abstract

The multi-objective nature of task scheduling for novel latency-sensitive applications in IoT-Fog-Cloud hierarchies presents persistent challenges, where optimizing one QoS metric often degrades another. Although bio-inspired algorithms provide adaptive solutions, existing comparative studies are constrained by narrow algorithmic scopes, limited evaluation metrics, and a notable absence of statistical validation. To bridge this gap, we introduce a novel unified benchmarking framework that systematically evaluates five prominent metaheuristics — Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Bacterial Foraging Optimization (BFO), Ant Colony Optimization (ACO), and Artificial Bee Colony (ABC) — for load balancing within a three-tier architecture using the iFogSim simulator. We evaluate performance across three QoS dimensions (response time, makespan, and load imbalance degree) under three escalating workload intensities on heterogeneous infrastructure, with all experiments repeated over 10 independent runs. Statistical significance is assessed via the Wilcoxon signed-rank test against GA, selected as a widely established and computationally stable baseline. Our findings reveal no universally optimal algorithm. GA consistently maintains mean response times below 30.5 ms across all workloads, while PSO and BFO remain statistically indistinguishable from GA on makespan, highlighting their interchangeability under specific conditions. Conversely, ABC uniquely excels in distribution equity, reducing load imbalance from 2.64% to 1.32% as task density increases. ACO, however, incurs statistically significant penalties across all metrics, suffering from a pronounced cloud-bias that elevates load imbalance to 11.0% —up to eight times higher than its counterparts. Collectively, these results confirm the inherent trade-offs between latency, efficiency, and fairness. This reference benchmark delivers a reproducible, statistically validated performance baseline, offering system architects a clear empirical foundation for adaptive algorithm selection in heterogeneous Fog-Cloud environments.

Read PDF

Similar papers

Sep 2026

MOFARO: A multi-objective optimization framework for dynamic task allocation in edge-fog-cloud mobile crowdsensing systems

MOFARO is introduced, a multi-objective model within the Artificial Rabbit Optimization Algorithm for task allocation in edge-fog-cloud MCS environments that outperforms state-of-the-art methods by 1.8–3.9% in success rate, validating its superiority for scalable, robust MCS in dynamic settings.

Seyed Ali Hosseini, Omid SojodiShijani, Vahid Khajehvand · 0 citations
#federated learning Review Open access Sep 2026

COMPARATIVE ANALYSIS OF FOG SYSTEM ARCHITECTURE OPTIMIZATION METHODS: FROM METAHEURISTICS TO HYBRID SOLUTIONS

The rapid proliferation of Internet of Things devices has intensified demands on distributed computing infrastructures, making fog computing — a paradigm that positions computational resources at the network edge — a critical enabler of low-latency real-time applications. Optimally placing services across fog nodes is...

Oleksandr Sbitnev, Lyudmila Voloshchuk · 0 citations

OPTIMIZED TASK SCHEDULING IN FOG-CLOUD ENVIRONMENTS USING A COST-AWARE GENETIC ALGORITHM

This research proposes a cost-aware, genetic-based task scheduling algorithm tailored for fog-cloud environments, which seeks to improve cost efficiency for real-time applications with strict deadlines, and demonstrates that the proposed algorithm surpasses existing techniques like Round-Robin and Trade-off algorithms.

Youssef Oukissou, Hamza Elhaou, Driss Ait Omar et al. · 1 citation
Open access 2026

Hybrid Fuzzy Spark Lion Whale Algorithm for Energy-Efficient Resource Allocation and Task Migration in Cloud Data Centers

The results empirically quantify the necessary tradeoff between aggressive hardware consolidation and Service Level Agreement preservation, establishing Fuzzy-SLW as a scalable solution for power-constrained hyper-scale environments.

Nidhi Chauhan, Navneet Kaur, Jawad Khan et al. · 0 citations
#edge computing Open access Oct 2026

An Efficient Resource Allocation Algorithm with Load Balancing Mechanism to Enhance QoS Parameters in Fog Environment

This study applied an effective approach named Spider Monkey Optimization (SMO) to address the mentioned challenges and employs the proposed framework to ensure the Quality of Service (QoS) parameters performance.

M. Aknan, Maheshwari Prasad Singh, Rajeev Arya · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.