Resource Allocation in Mobility-Aware Federated Learning Networks: A Deep Reinforcement Learning Approach
Huy T. Nguyen, Nguyen Cong Luong, Jun Zhao, Chau Yuen, and Dusit, Niyato

TL;DR
This paper proposes a deep reinforcement learning approach to optimize resource allocation in mobility-aware federated learning networks, balancing energy and channel costs amid uncertain network conditions.
Contribution
It introduces a DQN-based method for the model owner to make optimal energy and channel decisions without prior network knowledge in federated learning.
Findings
DQN outperforms conventional algorithms in simulations.
The approach effectively balances energy recharge and channel costs.
Improves the number of global model transmissions under uncertainty.
Abstract
Federated learning allows mobile devices, i.e., workers, to use their local data to collaboratively train a global model required by the model owner. Federated learning thus addresses the privacy issues of traditional machine learning. However, federated learning faces the energy constraints of the workers and the high network resource cost due to the fact that a number of global model transmissions may be required to achieve the target accuracy. To address the energy constraint, a power beacon can be used that recharges energy to the workers. However, the model owner may need to pay an energy cost to the power beacon for the energy recharge. To address the high network resource cost, the model owner can use a WiFi channel, called default channel, for the global model transmissions. However, communication interruptions may occur due to the instability of the default channel quality. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsQ-Learning · Dense Connections · Convolution · Deep Q-Network
