Tackling Resource Allocation for Decentralized Federated Learning: A GNN-Based Approach

IF 9.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Chuiyang Meng;Ming Tang;Mehdi Setayesh;Vincent W.S. Wong
{"title":"Tackling Resource Allocation for Decentralized Federated Learning: A GNN-Based Approach","authors":"Chuiyang Meng;Ming Tang;Mehdi Setayesh;Vincent W.S. Wong","doi":"10.1109/TMC.2025.3562834","DOIUrl":null,"url":null,"abstract":"Decentralized federated learning (DFL) enables clients to train a neural network model in a device-to-device (D2D) manner without central coordination. In practical systems, DFL faces challenges due to dynamic topology changes, time-varying channel conditions, and limited computational capability of the clients. These factors can affect the learning performance and efficiency of DFL. To address the aforementioned challenges, in this paper, we propose a graph neural network (GNN)–based algorithm to minimize the total delay and energy consumption on training and improve the learning performance of DFL in D2D wireless networks. In our proposed GNN, a multi-head graph attention mechanism is used to capture different features of clients and wireless channels. We design a neighbor selection module which enables each client to select a subset of its neighbors for the participation of model aggregation. We develop a decoder that enables each client to determine its transmit power and computational resource. Experimental results show that our proposed algorithm achieves a lower total delay and energy consumption on training when compared with five baseline schemes. Furthermore, by properly selecting a subset of neighbors for each client, our proposed algorithm achieves similar testing accuracy to the full participation scheme.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 10","pages":"9554-9569"},"PeriodicalIF":9.2000,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10971879/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Decentralized federated learning (DFL) enables clients to train a neural network model in a device-to-device (D2D) manner without central coordination. In practical systems, DFL faces challenges due to dynamic topology changes, time-varying channel conditions, and limited computational capability of the clients. These factors can affect the learning performance and efficiency of DFL. To address the aforementioned challenges, in this paper, we propose a graph neural network (GNN)–based algorithm to minimize the total delay and energy consumption on training and improve the learning performance of DFL in D2D wireless networks. In our proposed GNN, a multi-head graph attention mechanism is used to capture different features of clients and wireless channels. We design a neighbor selection module which enables each client to select a subset of its neighbors for the participation of model aggregation. We develop a decoder that enables each client to determine its transmit power and computational resource. Experimental results show that our proposed algorithm achieves a lower total delay and energy consumption on training when compared with five baseline schemes. Furthermore, by properly selecting a subset of neighbors for each client, our proposed algorithm achieves similar testing accuracy to the full participation scheme.
解决分散联邦学习的资源分配:一种基于gnn的方法
分散式联邦学习(DFL)使客户能够在没有中央协调的情况下以设备到设备(D2D)的方式训练神经网络模型。在实际系统中,由于动态拓扑变化、时变信道条件和客户端有限的计算能力,DFL面临着挑战。这些因素都会影响外语的学习效果和学习效率。为了解决上述挑战,本文提出了一种基于图神经网络(GNN)的算法,以最大限度地减少训练的总延迟和能量消耗,提高D2D无线网络中DFL的学习性能。在我们提出的GNN中,使用多头图注意机制来捕获客户端和无线信道的不同特征。我们设计了一个邻居选择模块,使每个客户端能够选择其邻居的一个子集来参与模型聚合。我们开发了一种解码器,使每个客户端能够确定其传输功率和计算资源。实验结果表明,与5种基准方案相比,本文提出的算法具有较低的训练总延迟和能量消耗。此外,通过为每个客户端选择适当的邻居子集,我们提出的算法可以达到与完全参与方案相似的测试精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信