25 October 2023 in IEEE Internet of Things Journal
In this study, we address the emerging field of streaming federated learning (SFL) and propose local cache update rules to manage dynamic data distributions and limited cache capacity. Traditional federated learning (FL) relies on fixed data sets, whereas in SFL, data is streamed, and its distribution changes over time, leading to discrepancies between the local training data set and long-term distribution. To mitigate this problem, we propose three local cache update rules—first-in–first-out (FIFO), static ratio selective replacement (SRSR), and dynamic ratio selective replacement (DRSR)—that update the local cache of each client while considering the limited cache capacity. Furthermore, we derive a convergence bound for our proposed SFL algorithm as a function of the distribution discrepancy between the long-term data distribution and the client’s local training data set. We then evaluate our proposed algorithm on two data sets: 1) a network traffic classification data set and 2) an image classification data set. Our experimental results demonstrate that our proposed local cache update rules significantly reduce the distribution discrepancy and outperform the baseline methods. Our study advances the field of SFL and provides practical cache management solutions in FL.
17 December 2024 in IEEE Transactions on Cognitive Communications and Networking
The increasing demand for wireless communication underscores the need to optimize radio frequency spectrum utilization. An effective strategy for leveraging underutilized licensed frequency bands is cooperative spectrum sensing (CSS), which enable multiple secondary users (SUs) to collaboratively detect the spectrum usage of primary users (PUs) prior to accessing the licensed spectrum. The increasing popularity of machine learning has led to a shift from traditional CSS methods to those based on deep learning. However, deep learning-based CSS methods often rely on centralized learning, posing challenges like communication overhead and data privacy risks. Recent research suggests vertical federated learning (VFL) as a potential solution, with its core concept centered on partitioning the deep neural network into distinct segments, with each segment is trained separately. However, existing VFL-based CSS works do not fully address the practical challenges arising from streaming data and the objective shift. In this work, we introduce online vertical federated learning (OVFL), a robust framework designed to address the challenges of ongoing data stream and shifting learning goals. Our theoretical analysis reveals that OVFL achieves a sublinear regret bound, thereby evidencing its efficiency. Empirical results from our experiments show that OVFL outperforms benchmarks in CSS tasks.
10 September 2025 in IEEE Transactions on Mobile Computing
The Internet of Things (IoT) ecosystem generates vast amounts of multimodal data from heterogeneous sources such as sensors, cameras, and microphones. As edge intelligence continues to evolve, IoT devices have progressed from simple data collection units to nodes capable of executing complex computational tasks. This evolution necessitates the adoption of distributed learning strategies to effectively handle multimodal data in an IoT environment. Furthermore, the real-time nature of data collection and limited local storage on edge devices in IoT call for an online learning paradigm. To address these challenges, we introduce the concept of Multimodal Online Federated Learning (MMO-FL), a novel framework designed for dynamic and decentralized multimodal learning in IoT environments. Building on this framework, we further account for the inherent instability of edge devices, which frequently results in missing modalities during the learning process. We conduct a comprehensive theoretical analysis under both complete and missing modality scenarios, providing insights into the performance degradation caused by missing modalities. To mitigate the impact of modality missing, we propose the Prototypical Modality Mitigation (PMM) algorithm, which leverages prototype learning to effectively compensate for missing modalities. Experimental results on two multimodal datasets further demonstrate the superior performance of PMM compared to benchmarks.
10 September 2025 in IEEE Transactions on Mobile Computing
With the advancement of computational capabilities in edge devices such as intelligent sensors in the Industrial Internet of Things (IIoT), these sensors evolving beyond simple data collection to support complex computational tasks. This advancement provides new opportunities for adopting distributed learning approaches in IIoT. In this study, we focus on enhancing learning performance in an industrial assembly line scenario where multiple distributed sensors sequentially collect real-time data with distinct feature spaces. However, existing research lacks an online distributed learning framework tailored for such IIoT settings. To address this gap, we propose the Denoising and Adaptive Online Vertical Federated Learning (DAO-VFL) algorithm, a novel algorithm that leverages the computing potential of edge sensors while addressing key challenges such as communication overhead and data privacy. DAO-VFL effectively manages continuous data streams and adapts to shifting learning objectives. Furthermore, it can address critical challenges prevalent in industrial environment, such as communication noise and heterogeneity of sensor capabilities. To support the proposed algorithm, we provide a comprehensive theoretical analysis, highlighting the effects of noise reduction and adaptive local iteration decisions on the regret bound. Experimental results on two real-world datasets further demonstrate the superior performance of DAO-VFL compared to benchmarks.
9 February 2026 in IEEE Transactions on Networking
In the evolving landscape of Web 3.0, deploying and scheduling decentralized applications (DApps) presents significant challenges due to the complexity of heterogeneous nodes, edges, and their intricate interactions. Traditional approaches, particularly graph-based reinforcement learning (RL) methods, often rely on homogeneous graphs, which fail to capture the diverse relationships inherent in heterogeneous Web 3.0 environments. This limitation results in inefficient resource allocation, suboptimal task scheduling, and unclear security requirements. To address these issues, this paper introduces the Heterogeneous Graph Deployment Scheduler (HGDS), a novel framework that leverages Heterogeneous Graph Neural Networks (HGNNs) to model users, edge servers, and DApp tasks within Web 3.0 environments, and incorporates RL to optimize DApp scheduling policies. HGDS captures heterogeneity in Web 3.0 environments by jointly modeling node–edge interactions and heterogeneous edge relationships, enabling the generation of dynamic, task-aware embeddings that integrate both node and edge features. RL is further employed to adaptively optimize scheduling and resource allocation based on real-time network feedback. Experiments on a Web 3.0 testbed show that HGDS outperforms baseline methods by 12.2% in reward, while reducing service delay and gas consumption.
1 January 2026 in IEEE Transactions on Cognitive Communications and Networking