Shunfeng Chu, Jun Li, Jianxin Wang, Yiyang Ni, Kang Wei, Wen Chen, Shi Jin
{"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}
引用次数: 0
Abstract
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.