A Time-Triggered Edge–Fog–Cloud Architecture With Hierarchical Genetic Optimization for Safety-Critical Applications

The growth of safety-critical Internet of Things (IoT) applications, such as autonomous driving and industrial automation, demands predictable, real-time performance from distributed Edge-Fog-Cloud systems. Existing scheduling algorithms for this continuum are fundamentally unsuitable for safety-critical domains. These algorithms primarily use best-effort communication networks. This results in non-deterministic latencies and an inability to provide temporal guarantees. This paper introduces a new solution that bridges the gap between task scheduling and network determinism: a Time-Triggered Edge-Fog-Cloud (TTEFC) architecture that is based on Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet) standards, ensuring bounded end-to-end communication delays; and a Hierarchical Nested Genetic Algorithm (HNGA) that effectively maps the scheduling problem onto this three-tier architecture. The HNGA consists of two genetic algorithms that use a feedback mechanism. At the top level, it is called the global genetic algorithm (GGA), which utilises graph partitioning techniques to partition the task graph into latency-aware subgraphs and assign them across the continuum. Meanwhile, nested local genetic algorithms (LGA) receive these subgraphs and perform fine-grained, time-triggered scheduling within each tier. The LGA provides the update back to the GGA, which uses the information to optimise the subgraphs such that deadlines are met and also generates the global schedule for the safety-critical applications. Experimental validation shows that this integrated approach significantly outperforms state-of-the-art scheduling methods. The proposed method was compared with the Min-Min, Particle Swarm Optimisation (PSO), and Heterogeneous Earliest Finish Time (HEFT) algorithms. The results show that the proposed method significantly reduces the makespan and consistently meets deadlines when compared to the above algorithms. Thus, the main contribution of this work is a robust and verifiable framework that provides a comprehensive solution for deploying safety-critical, real-time applications across the Edge-Fog-Cloud continuum.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3644152
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Time-Triggered Edge–Fog–Cloud Architecture With Hierarchical Genetic Optimization for Safety-Critical Applications

Roman Obermaisser, Josepaul Paulachan, Omar Hekal, Daniel Onwuchekwa
IEEE Access
Network Time Synchronization Technologies
article

A Time-Triggered Edge–Fog–Cloud Architecture With Hierarchical Genetic Optimization for Safety-Critical Applications

Roman Obermaisser, Josepaul Paulachan, Omar Hekal, Daniel Onwuchekwa
article en

Abstract

The growth of safety-critical Internet of Things (IoT) applications, such as autonomous driving and industrial automation, demands predictable, real-time performance from distributed Edge-Fog-Cloud systems. Existing scheduling algorithms for this continuum are fundamentally unsuitable for safety-critical domains. These algorithms primarily use best-effort communication networks. This results in non-deterministic latencies and an inability to provide temporal guarantees. This paper introduces a new solution that bridges the gap between task scheduling and network determinism: a Time-Triggered Edge-Fog-Cloud (TTEFC) architecture that is based on Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet) standards, ensuring bounded end-to-end communication delays; and a Hierarchical Nested Genetic Algorithm (HNGA) that effectively maps the scheduling problem onto this three-tier architecture. The HNGA consists of two genetic algorithms that use a feedback mechanism. At the top level, it is called the global genetic algorithm (GGA), which utilises graph partitioning techniques to partition the task graph into latency-aware subgraphs and assign them across the continuum. Meanwhile, nested local genetic algorithms (LGA) receive these subgraphs and perform fine-grained, time-triggered scheduling within each tier. The LGA provides the update back to the GGA, which uses the information to optimise the subgraphs such that deadlines are met and also generates the global schedule for the safety-critical applications. Experimental validation shows that this integrated approach significantly outperforms state-of-the-art scheduling methods. The proposed method was compared with the Min-Min, Particle Swarm Optimisation (PSO), and Heterogeneous Earliest Finish Time (HEFT) algorithms. The results show that the proposed method significantly reduces the makespan and consistently meets deadlines when compared to the above algorithms. Thus, the main contribution of this work is a robust and verifiable framework that provides a comprehensive solution for deploying safety-critical, real-time applications across the Edge-Fog-Cloud continuum.

IEEE AccessVol. 13
University of Siegen (DE)
Openalex Percentile: Top 55%
Network Time Synchronization Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.