南京邮电大学学报（自然科学版）2026，Vol.46Issue(2)：66-74,9.DOI:10.14132/j.cnki.1673-5439.2026.02.008
基于动态分组和贡献感知的联邦客户端选择算法
A federated client selection algorithm based on dynamic grouping and contribution awareness
摘要
Abstract
Data heterogeneity(Non-IID)adversely affects the accuracy and convergence speed of the global model in federated learning.In order to solve this problem,this paper proposed a federated client selection algorithm based on dynamic grouping and contribution awareness,named FedGCCS.This algo-rithm employs a label-distribution-driven dynamic grouping mechanism to cluster the clients with similar data distribution.A multi-dimensional contribution awareness framework is designed to quantify client contributions dynamically by combining heterogeneous sensitive indicators,such as model similarity,test accuracy and training loss.Based on this frame work,an adaptive client selection strategy using Thompson sampling is implemented to balance the continuous utilization of high-contribution clients and the exploration opportunities of potential clients.Experimental results show that FedGCCS performs well on MNIST and Fashion-MNIST datasets.In highly heterogeneous scenarios,it improves the accuracy by 19.7%,17.3%and 7.1%over FedAvg,FedProx and FedCor,respectively,and achieves a faster conver-gence speed.These findings validate its effectiveness in solving the Non-IID problem and improving the overall performance.关键词
联邦学习/数据异构性/动态分组/客户端选择/贡献感知Key words
federated learning(FL)/data heterogeneity/dynamic grouping/client selection/contribu-tion awareness分类
信息技术与安全科学引用本文复制引用
张琳,王文,罗启瑞..基于动态分组和贡献感知的联邦客户端选择算法[J].南京邮电大学学报（自然科学版）,2026,46(2):66-74,9.基金项目
国家自然科学基金(62372247、61872194)和南京邮电大学校级自然科学基金(NY222142)资助项目 （62372247、61872194）
