FedCCS: Efficient Federated Learning with Clustering-Based Client Selection and Bandwidth Allocation

Federated learning (FL) has emerged as the most promising distributed machine learning training framework due to its advantages in efficiency, privacy preservation, and scalability. In the practical deployment, FL usually faces the system heterogeneity, data heterogeneity, and limited communication resources. Many works attempt to address the above challenges by client selection, but seldom consider the issues of missing classes in training samples and communication resource allocation, which leads to poor training performance. In this paper, we propose an efficient FL framework with clustering-based client selection and bandwidth allocation, called FedCCS. Specifically, FedCCS first clusters clients based on the local label distribution. By ensuring clients from each cluster participate in training, a wider range of sample classes are covered to mitigate data heterogeneity effects. Furthermore, considering system heterogeneity and limited communication resources, we develop an iterative-based joint optimization algorithm for client selection and bandwidth allocation to minimize latency. Experimental results on both simulations and real-world prototypes show that, compared to other methods, FedCCS can significantly reduce latency and improve the stability of model performance during the training process.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978231
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FedCCS: Efficient Federated Learning with Clustering-Based Client Selection and Bandwidth Allocation

Yanfeng Lu, Nina Shu, Zhexian Shen, Yan Kang et al.
1 citations
Privacy-Preserving Technologies in Data
2.48
article

FedCCS: Efficient Federated Learning with Clustering-Based Client Selection and Bandwidth Allocation

Yanfeng Lu, Nina Shu, Zhexian Shen, Yan Kang, Tao Wu, Xiaochen Fan, Simao Xu
article en
1 citations

Abstract

Federated learning (FL) has emerged as the most promising distributed machine learning training framework due to its advantages in efficiency, privacy preservation, and scalability. In the practical deployment, FL usually faces the system heterogeneity, data heterogeneity, and limited communication resources. Many works attempt to address the above challenges by client selection, but seldom consider the issues of missing classes in training samples and communication resource allocation, which leads to poor training performance. In this paper, we propose an efficient FL framework with clustering-based client selection and bandwidth allocation, called FedCCS. Specifically, FedCCS first clusters clients based on the local label distribution. By ensuring clients from each cluster participate in training, a wider range of sample classes are covered to mitigate data heterogeneity effects. Furthermore, considering system heterogeneity and limited communication resources, we develop an iterative-based joint optimization algorithm for client selection and bandwidth allocation to minimize latency. Experimental results on both simulations and real-world prototypes show that, compared to other methods, FedCCS can significantly reduce latency and improve the stability of model performance during the training process.

National University of Defense Technology (CN), Tsinghua University (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation
Openalex Percentile: Top 11%
Privacy-Preserving Technologies in Data
2.48
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.