{"id":"https://openalex.org/W4417336921","doi":"https://doi.org/10.1109/access.2025.3644152","title":"A Time-Triggered Edge\u2013Fog\u2013Cloud Architecture With Hierarchical Genetic Optimization for Safety-Critical Applications","display_name":"A Time-Triggered Edge\u2013Fog\u2013Cloud Architecture With Hierarchical Genetic Optimization for Safety-Critical Applications","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417336921","doi":"https://doi.org/10.1109/access.2025.3644152"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3644152","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3644152","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3644152","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029028068","display_name":"Josepaul Paulachan","orcid":"https://orcid.org/0009-0003-8869-603X"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Josepaul Paulachan","raw_affiliation_strings":["Chair for Embedded Systems, University of Siegen, Siegen, Germany","Chair for Embedded Systems, University of Siegen, Germany"],"raw_orcid":"https://orcid.org/0009-0003-8869-603X","affiliations":[{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073458022","display_name":"Omar Hekal","orcid":"https://orcid.org/0009-0001-2181-7402"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Omar Hekal","raw_affiliation_strings":["Chair for Embedded Systems, University of Siegen, Siegen, Germany","Chair for Embedded Systems, University of Siegen, Germany"],"raw_orcid":"https://orcid.org/0009-0001-2181-7402","affiliations":[{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112539672","display_name":"Daniel Onwuchekwa","orcid":"https://orcid.org/0009-0003-7220-8265"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Onwuchekwa","raw_affiliation_strings":["Chair for Embedded Systems, University of Siegen, Siegen, Germany","Chair for Embedded Systems, University of Siegen, Germany"],"raw_orcid":"https://orcid.org/0009-0003-7220-8265","affiliations":[{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007015294","display_name":"Roman Obermaisser","orcid":"https://orcid.org/0009-0002-4483-1503"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Obermaisser","raw_affiliation_strings":["Chair for Embedded Systems, University of Siegen, Siegen, Germany","Chair for Embedded Systems, University of Siegen, Germany"],"raw_orcid":"https://orcid.org/0009-0002-4483-1503","affiliations":[{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"Chair for Embedded Systems, University of Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I206895457"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40261582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"217406","last_page":"217422"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.00559999980032444,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6500999927520752},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5723999738693237},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4487999975681305},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4397999942302704},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.39100000262260437},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.37770000100135803},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.367900013923645},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3677000105381012},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.3589000105857849}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.79339998960495},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6510000228881836},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6500999927520752},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5723999738693237},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.39100000262260437},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.37770000100135803},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3677000105381012},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3589000105857849},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.32249999046325684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3091000020503998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3075000047683716},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.2919999957084656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.288100004196167},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.2815999984741211},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.273499995470047},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.25699999928474426},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3644152","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3644152","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a7af2619e2cc4b4f9f7e4000770ab479","is_oa":true,"landing_page_url":"https://doaj.org/article/a7af2619e2cc4b4f9f7e4000770ab479","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 217406-217422 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3644152","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3644152","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6981768040","display_name":null,"funder_award_id":"16MEE0316","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"},{"id":"https://openalex.org/G8510188737","display_name":"Intelligent, Safe and secure connected Electrical Mobility solutions: Towards European Green Deal and Seamless Mobility","funder_award_id":"101112306","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,110,170,214,233],"growth":[1],"of":[2,5,113,258],"safety-critical":[3,34,200],"Internet":[4],"Things":[6],"(IoT)":[7],"applications,":[8],"such":[9,187],"as":[10],"autonomous":[11],"driving":[12],"and":[13,48,68,83,93,147,162,192,226,244,264],"industrial":[14],"automation,":[15],"demands":[16],"predictable,":[17],"real-time":[18,275],"performance":[19],"from":[20],"distributed":[21],"Edge-Fog-Cloud":[22,73,279],"systems.":[23],"Existing":[24],"scheduling":[25,67,104,166,212],"algorithms":[26,37,116,157],"for":[27,33,198,272],"this":[28,107,206,259],"continuum":[29],"are":[30,190],"fundamentally":[31],"unsuitable":[32],"domains.":[35],"These":[36],"primarily":[38],"use":[39,118],"best-effort":[40],"communication":[41,91],"networks.":[42],"This":[43,55],"results":[44,234],"in":[45],"non-deterministic":[46],"latencies":[47],"an":[49],"inability":[50],"to":[51,139,176,183,250],"provide":[52],"temporal":[53],"guarantees.":[54],"paper":[56],"introduces":[57],"a":[58,71,94,119,262,269],"new":[59],"solution":[60,271],"that":[61,76,100,117,188,205,236,267],"bridges":[62],"the":[63,103,123,129,141,151,173,177,181,185,195,199,220,237,242,251,255,278],"gap":[64],"between":[65],"task":[66,142],"network":[69],"determinism:":[70],"Time-Triggered":[72],"(TTEFC)":[74],"architecture":[75],"is":[77,127,261],"based":[78],"on":[79],"Time-Sensitive":[80],"Networking":[81,85],"(TSN)":[82],"Deterministic":[84],"(DetNet)":[86],"standards,":[87],"ensuring":[88],"bounded":[89],"end-to-end":[90],"delays;":[92],"Hierarchical":[95],"Nested":[96],"Genetic":[97],"Algorithm":[98],"(HNGA)":[99],"effectively":[101],"maps":[102],"problem":[105],"onto":[106],"three-tier":[108],"architecture.":[109],"HNGA":[111],"consists":[112],"two":[114],"genetic":[115,131,156],"feedback":[120],"mechanism.":[121],"At":[122],"top":[124],"level,":[125],"it":[126],"called":[128],"global":[130,196],"algorithm":[132],"(GGA),":[133],"which":[134,179],"utilises":[135],"graph":[136,143],"partitioning":[137],"techniques":[138],"partition":[140],"into":[144],"latency-aware":[145],"subgraphs":[146,161,186],"assign":[148],"them":[149],"across":[150,277],"continuum.":[152,280],"Meanwhile,":[153],"nested":[154],"local":[155],"(LGA)":[158],"receive":[159],"these":[160],"perform":[163],"fine-grained,":[164],"time-triggered":[165],"within":[167],"each":[168],"tier.":[169],"LGA":[171],"provides":[172,268],"update":[174],"back":[175],"GGA,":[178],"uses":[180],"information":[182],"optimise":[184],"deadlines":[189,247],"met":[191],"also":[193],"generates":[194],"schedule":[197],"applications.":[201],"Experimental":[202],"validation":[203],"shows":[204],"integrated":[207],"approach":[208],"significantly":[209,240],"outperforms":[210],"state-of-the-art":[211],"methods.":[213],"proposed":[215,238],"method":[216,239],"was":[217],"compared":[218,249],"with":[219],"Min-Min,":[221],"Particle":[222],"Swarm":[223],"Optimisation":[224],"(PSO),":[225],"Heterogeneous":[227],"Earliest":[228],"Finish":[229],"Time":[230],"(HEFT)":[231],"algorithms.":[232,253],"show":[235],"reduces":[241],"makespan":[243],"consistently":[245],"meets":[246],"when":[248],"above":[252],"Thus,":[254],"main":[256],"contribution":[257],"work":[260],"robust":[263],"verifiable":[265],"framework":[266],"comprehensive":[270],"deploying":[273],"safety-critical,":[274],"applications":[276]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-15T00:00:00"}