Over-the-air FL with EH MDs under heterogeneous data distributions under heterogeneous data distributions is studied, and the proposed unified framework improves fairness or personalization, depending on the operating mode, while reducing communication overhead.
Abstract
Federated learning (FL) enables distributed optimization and learning across decentralized edge devices while preserving data privacy, but its performance is fundamentally constrained by heterogeneous data distributions, limited communication resources, and energy availability. In practical wireless networks, mobile devices (MDs) often exhibit diverse data and learning objectives, naturally forming clusters of users with jointly trainable models. When devices rely on energy harvesting (EH), stochastic energy arrivals further complicate participation and scheduling under communication constraints. In this work, we study over-the-air (OTA) FL with EH MDs under heterogeneous data distributions, and investigate two closely related learning objectives within a unified framework: one aiming for a more representative global model by reducing data bias, and the other learning more personalized cluster-specific models by exploiting this bias. In the global training mode, cluster information guides energy- and diversity-aware scheduling, ensuring that the scheduled active users provide a more representative aggregate update. In the personalization mode, the same cluster structure defines cluster-level learning objectives and OTA recovery targets, enabling the parameter server to train multiple cluster-specific models through simultaneous transmissions over the wireless multiple-access channel. Numerical results demonstrate that the proposed unified framework improves fairness or personalization, depending on the operating mode, while reducing communication overhead.
The Federated Green Anaconda Optimizer (FedGAO), an innovative FL framework inspired by the behavioral patterns of the Green Anaconda Optimizer (GAO), is proposed, demonstrating superior performance in terms of accuracy, convergence speed, and resource efficiency.
Elahe Eslami, S. A. Shahzadeh Fazeli, J. Abouei et al.· Cluster Computing· 0 citations
Results support the central conclusion that lightweight joint scheduling can materially improve wall-clock FL efficiency in heterogeneous 5G/6G edge networks.
Federated Learning (FL) has emerged as a promising paradigm for privacy-preserving distributed machine learning across mobile and edge devices. Nevertheless, the presence of non-independent and identically distributed (non-IID) data in wireless networks often leads to severe gradient divergence, slow convergence, and degraded model performance. To mitigate these challenges, this paper proposes FedCoalition, a coalition game-based clustered federated learning framework that organizes clients into collaborative coalitions according to the similarity of their model updates. The proposed method integrates a coalition formation mechanism with similarity-aware clustering to reduce gradient divergence among participating clients. In addition, each coalition designates a Coalition Head (CH) responsible for intra-cluster aggregation and model validation using auxiliary data, thereby improving model reliability and communication efficiency. The experimental results on MNIST and CIFAR-10 under non-IID data distributions demonstrate that FedCoalition significantly improves learning performance, achieving higher accuracy and faster convergence compared with existing clustered federated learning approaches.
Over-the-air (OTA) aggregation exploits the superposition property of wireless multiple-access channels to aggregate model updates from multiple devices within a single transmission slot, significantly reducing communication latency. While OTA computation has been extensively studied for centralized federated learning (FL), its integration with decentralized federated learning (DFL) remains largely unexplored, and principled communication topology selection is absent from existing work. We present AIRPLAN, a query-optimized topology selection framework for Over-the-Air Decentralized Federated Learning (OTA-DFL). AIRPLAN establishes a formal equivalence between OTA-DFL and distributed query processing, enabling topology selection to be formulated as a cost-based query optimization problem. Using privacy-preserving Count-Min Sketch statistics, AIRPLAN estimates workload characteristics, evaluates a graph-aware cost model across candidate topologies, and selects the communication graph that minimizes training cost while satisfying a target accuracy SLA. Experiments across five graph families, three vision benchmarks, four client scales, and multiple SNR settings show that AIRPLAN matches the oracle-optimal topology in 91.4% of workloads while introducing less than 1.8% overhead. We further derive theoretical error bounds for topology-aware sparsification, demonstrating that well-connected topologies better tolerate aggressive compression. AIRPLAN introduces a systems-oriented perspective that bridges wireless federated learning and distributed query optimization.
Kaushal Attaluri, R. P. Díaz-Redondo, Manuel Fernandez Veiga· 0 citations