Skip navigation

Asynchronous federated learning of main-side chain collaboration for multi-level task scheduling in IoT

Asynchronous federated learning of main-side chain collaboration for multi-level task scheduling in IoT

Bai, Fenhua, Zhou, Chunlin, Zhao, Renshuo, Yang, Yinghong, Zhang, Xiaohui, Zhang, Chi and Waqas, Muhammad ORCID logoORCID: https://orcid.org/0000-0003-0814-7544 (2026) Asynchronous federated learning of main-side chain collaboration for multi-level task scheduling in IoT. Journal of King Saud University - Computer and Information Sciences, 38:115. ISSN 1319-1578 (Print), 2213-1248 (Online) (doi:10.1007/s44443-026-00533-9)

[thumbnail of Open Access Article]
Preview
PDF (Open Access Article)
53297 WAQAS_Asynchronous_Federated_Learning_Of_Main-Side_Chain_Collaboration_(OA)_2026.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (3MB) | Preview

Abstract

Currently, the Internet of Things (IoT) boasts a multitude of applications, and the count of devices is escalating rapidly. Therefore, IoT systems need smarter ways of collecting and processing data to provide decision-making services to the consumer more quickly. The combination of federated learning (FL) and blockchain offers a novel way to solve the value extraction of massive data in IoT. However, due to the limitation of device computational capacity, heterogeneity of computational resources, and the straggler effect caused by frequent state changes of nodes, those issues in present blockchain-based FL still exist, especially in the complex IoT environment where the problem is more obvious. Aiming at the resource-constrained IoT systems, we propose an asynchronous FL framework that leverages main-side chain collaboration within a dual-chain architecture and dynamically allocates clients into groups according to their processing capacity and network performance. Furthermore, this framework employs a multi-level task scheduling strategy based on the deadline-driven maximal completion time algorithm (DDMLTS) for FL, and a side-chain approach is integrated to enhance security assessment and node scheduling. Experiments show that the proposed framework reduces the average completion time by 10.9% and 8.8% compared with BAFL and PerFedS2, respectively, while achieving comparable model accuracy across the evaluated datasets.

Item Type: Article
Uncontrolled Keywords: asynchronous federated learning, blockchain, Internet of Things, task scheduling, distributed systems
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified: 30 Apr 2026 13:49
URI: https://gala.gre.ac.uk/id/eprint/53297

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics