为数字双胞胎赋能的物联网网络提供资源高效的异步联盟学习

Shunfeng Chu, Jun Li, Jianxin Wang, Yiyang Ni, Kang Wei, Wen Chen, Shi Jin
{"title":"为数字双胞胎赋能的物联网网络提供资源高效的异步联盟学习","authors":"Shunfeng Chu, Jun Li, Jianxin Wang, Yiyang Ni, Kang Wei, Wen Chen, Shi Jin","doi":"arxiv-2408.14298","DOIUrl":null,"url":null,"abstract":"As an emerging technology, digital twin (DT) can provide real-time status and\ndynamic topology mapping for Internet of Things (IoT) devices. However, DT and\nits implementation within industrial IoT networks necessitates substantial,\ndistributed data support, which often leads to ``data silos'' and raises\nprivacy concerns. To address these issues, we develop a dynamic resource\nscheduling algorithm tailored for the asynchronous federated learning\n(FL)-based lightweight DT empowered IoT network. Specifically, our approach\naims to minimize a multi-objective function that encompasses both energy\nconsumption and latency by optimizing IoT device selection and transmit power\ncontrol, subject to FL model performance constraints. We utilize the Lyapunov\nmethod to decouple the formulated problem into a series of one-slot\noptimization problems and develop a two-stage optimization algorithm to achieve\nthe optimal transmission power control and IoT device scheduling strategies. In\nthe first stage, we derive closed-form solutions for optimal transmit power on\nthe IoT device side. In the second stage, since partial state information is\nunknown, e.g., the transmitting power and computational frequency of IoT\ndevice, the edge server employs a multi-armed bandit (MAB) framework to model\nthe IoT device selection problem and utilizes an efficient online algorithm,\nnamely the client utility-based upper confidence bound (CU-UCB), to address it.\nNumerical results validate our algorithm's superiority over benchmark schemes,\nand simulations demonstrate that our algorithm achieves faster training speeds\non the Fashion-MNIST and CIFAR-10 datasets within the same training duration.","PeriodicalId":501422,"journal":{"name":"arXiv - CS - Distributed, Parallel, and Cluster Computing","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource Efficient Asynchronous Federated Learning for Digital Twin Empowered IoT Network\",\"authors\":\"Shunfeng Chu, Jun Li, Jianxin Wang, Yiyang Ni, Kang Wei, Wen Chen, Shi Jin\",\"doi\":\"arxiv-2408.14298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an emerging technology, digital twin (DT) can provide real-time status and\\ndynamic topology mapping for Internet of Things (IoT) devices. However, DT and\\nits implementation within industrial IoT networks necessitates substantial,\\ndistributed data support, which often leads to ``data silos'' and raises\\nprivacy concerns. To address these issues, we develop a dynamic resource\\nscheduling algorithm tailored for the asynchronous federated learning\\n(FL)-based lightweight DT empowered IoT network. Specifically, our approach\\naims to minimize a multi-objective function that encompasses both energy\\nconsumption and latency by optimizing IoT device selection and transmit power\\ncontrol, subject to FL model performance constraints. We utilize the Lyapunov\\nmethod to decouple the formulated problem into a series of one-slot\\noptimization problems and develop a two-stage optimization algorithm to achieve\\nthe optimal transmission power control and IoT device scheduling strategies. In\\nthe first stage, we derive closed-form solutions for optimal transmit power on\\nthe IoT device side. In the second stage, since partial state information is\\nunknown, e.g., the transmitting power and computational frequency of IoT\\ndevice, the edge server employs a multi-armed bandit (MAB) framework to model\\nthe IoT device selection problem and utilizes an efficient online algorithm,\\nnamely the client utility-based upper confidence bound (CU-UCB), to address it.\\nNumerical results validate our algorithm's superiority over benchmark schemes,\\nand simulations demonstrate that our algorithm achieves faster training speeds\\non the Fashion-MNIST and CIFAR-10 datasets within the same training duration.\",\"PeriodicalId\":501422,\"journal\":{\"name\":\"arXiv - CS - Distributed, Parallel, and Cluster Computing\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Distributed, Parallel, and Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.14298\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Distributed, Parallel, and Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.14298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

作为一项新兴技术,数字孪生(DT)可为物联网(IoT)设备提供实时状态和动态拓扑映射。然而,数字孪生及其在工业物联网网络中的实施需要大量的分布式数据支持,这往往会导致 "数据孤岛 "并引发隐私问题。为了解决这些问题,我们为基于异步联合学习(FL)的轻量级 DT 物联网网络开发了一种动态资源调度算法。具体来说,我们的方法旨在通过优化物联网设备选择和发射功率控制,在 FL 模型性能约束条件下,最小化包含能耗和延迟的多目标函数。我们利用 Lyapunov 方法将所提出的问题解耦为一系列单槽优化问题,并开发了一种两阶段优化算法,以实现最佳发射功率控制和物联网设备调度策略。在第一阶段,我们得出了物联网设备侧最优发射功率的闭式解。在第二阶段,由于部分状态信息是未知的,例如数值结果验证了我们的算法优于基准方案,仿真证明我们的算法在相同的训练时间内,在 Fashion-MNIST 和 CIFAR-10 数据集上实现了更快的训练速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource Efficient Asynchronous Federated Learning for Digital Twin Empowered IoT Network
As an emerging technology, digital twin (DT) can provide real-time status and dynamic topology mapping for Internet of Things (IoT) devices. However, DT and its implementation within industrial IoT networks necessitates substantial, distributed data support, which often leads to ``data silos'' and raises privacy concerns. To address these issues, we develop a dynamic resource scheduling algorithm tailored for the asynchronous federated learning (FL)-based lightweight DT empowered IoT network. Specifically, our approach aims to minimize a multi-objective function that encompasses both energy consumption and latency by optimizing IoT device selection and transmit power control, subject to FL model performance constraints. We utilize the Lyapunov method to decouple the formulated problem into a series of one-slot optimization problems and develop a two-stage optimization algorithm to achieve the optimal transmission power control and IoT device scheduling strategies. In the first stage, we derive closed-form solutions for optimal transmit power on the IoT device side. In the second stage, since partial state information is unknown, e.g., the transmitting power and computational frequency of IoT device, the edge server employs a multi-armed bandit (MAB) framework to model the IoT device selection problem and utilizes an efficient online algorithm, namely the client utility-based upper confidence bound (CU-UCB), to address it. Numerical results validate our algorithm's superiority over benchmark schemes, and simulations demonstrate that our algorithm achieves faster training speeds on the Fashion-MNIST and CIFAR-10 datasets within the same training duration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Massively parallel CMA-ES with increasing population Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations Energy Efficiency Support for Software Defined Networks: a Serverless Computing Approach CountChain: A Decentralized Oracle Network for Counting Systems Delay Analysis of EIP-4844
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1