Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks

Despite its advantage of preserving data privacy, federated learning (FL) could suffer from the limited computation resources of the distributed clients particularly when they are connected by wireless networks. By imitating the distributed resources effectively, digital twin (DT) shows great potential in eliminating the straggler issue in FL. In this paper, we leverage DT in the FL framework over non-orthogonal multiple access (NOMA) network, where DT deployed at the server can assist FL training process. To minimize the total latency and energy consumption in the proposed system, we formulate a Stackelberg game by considering clients and the server as the leader and the follower, respectively. Specifically, the leader aims to minimize the energy consumption via the optimization of DT mapping data ratio and resource allocation, while the objective of the follower is to minimize the total latency during FL training by optimally allocating DT computation resource. The Stackelberg equilibrium is considered to obtain the optimal solutions. We first derive the closed-form solution for the follower-level problem and include it in the leader-level problem which is then solved through the deep reinforcement learning (DRL) method. Simulation results verify the superior performance of the proposed scheme.

Authors

Institutions

Publication Details

Published
2024-10-07
DOI
https://doi.org/10.1109/vtc2024-fall63153.2024.10758042
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks

Ming Zeng, Fang Fang, Xianbin Wang, Bibo Wu
1 citations
Privacy-Preserving Technologies in Data
0.35
article

Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks

Ming Zeng, Fang Fang, Xianbin Wang, Bibo Wu
article en
1 citations

Abstract

Despite its advantage of preserving data privacy, federated learning (FL) could suffer from the limited computation resources of the distributed clients particularly when they are connected by wireless networks. By imitating the distributed resources effectively, digital twin (DT) shows great potential in eliminating the straggler issue in FL. In this paper, we leverage DT in the FL framework over non-orthogonal multiple access (NOMA) network, where DT deployed at the server can assist FL training process. To minimize the total latency and energy consumption in the proposed system, we formulate a Stackelberg game by considering clients and the server as the leader and the follower, respectively. Specifically, the leader aims to minimize the energy consumption via the optimization of DT mapping data ratio and resource allocation, while the objective of the follower is to minimize the total latency during FL training by optimally allocating DT computation resource. The Stackelberg equilibrium is considered to obtain the optimal solutions. We first derive the closed-form solution for the follower-level problem and include it in the leader-level problem which is then solved through the deep reinforcement learning (DRL) method. Simulation results verify the superior performance of the proposed scheme.

Western University (CA), Université Laval (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 30%
Privacy-Preserving Technologies in Data
0.35
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.