User Scheduling in Federated Learning over Energy Harvesting Wireless Networks

被引:0
作者
Hamdi, Rami [1 ]
Chen, Mingzhe [2 ]
Ben Said, Ahmed [3 ]
Qaraqe, Marwa [1 ]
Poor, H. Vincent [2 ]
机构
[1] Hamad Bin Khalifa Univ, Coll Sci & Engn, Div Informat & Comp Technol, Doha, Qatar
[2] Princeton Univ, Dept Elect & Comp Engn, Princeton, NJ 08544 USA
[3] Qatar Univ, Coll Engn, Comp Sci & Engn Dept, Doha, Qatar
来源
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2021年
基金
美国国家科学基金会;
关键词
Federated learning; energy harvesting; resource allocation;
D O I
10.1109/GLOBECOM46510.2021.9685801
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, the deployment of federated learning (FL) is investigated in an energy harvesting wireless network in which the base station (BS) is equipped with a massive multiple-input multiple-output (MIMO) system and a set of users powered by independent energy harvesting sources to cooperatively perform FL. Since a certain number of users may not be served due to interference and energy constraints, a joint energy management and user scheduling problem is considered. This problem is formulated as an optimization problem whose goal is to minimize the FL training loss via optimizing user scheduling. To determine the effect of various wireless factors (transmit power and number of scheduled users) on training loss, the convergence rate of the FL algorithm is analyzed. Given this analytical result, the original user scheduling and energy management optimization problem can be decomposed, simplified and solved. Simulation results show that the proposed algorithm can reduce training loss compared to a standard FL algorithm.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Federated Learning Over Energy Harvesting Wireless Networks
    Hamdi, Rami
    Chen, Mingzhe
    Ben Said, Ahmed
    Qaraqe, Marwa
    Poor, H. Vincent
    IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (01) : 92 - 103
  • [2] Optimal User Scheduling in Energy Harvesting Wireless Networks
    Pathak, Kalpant
    Kalamkar, Sanket S.
    Banerjee, Adrish
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (10) : 4622 - 4636
  • [3] Scheduling and Aggregation Design for Asynchronous Federated Learning Over Wireless Networks
    Hu, Chung-Hsuan
    Chen, Zheng
    Larsson, Erik G.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2023, 41 (04) : 874 - 886
  • [4] Energy Efficient Federated Learning Over Wireless Communication Networks
    Yang, Zhaohui
    Chen, Mingzhe
    Saad, Walid
    Hong, Choong Seon
    Shikh-Bahaei, Mohammad
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (03) : 1935 - 1949
  • [5] Joint Device Scheduling and Bandwidth Allocation for Federated Learning Over Wireless Networks
    Zhang, Tinghao
    Lam, Kwok-Yan
    Zhao, Jun
    Feng, Jie
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2025, 24 (01) : 3 - 18
  • [6] Adaptive User Scheduling and Resource Allocation in Wireless Federated Learning Networks : A Deep Reinforcement Learning Approach
    Wu, Changxiang
    Ren, Yijing
    So, Daniel K. C.
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 1219 - 1225
  • [7] Joint Client Scheduling and Quantization Optimization in Energy Harvesting-Enabled Federated Learning Networks
    Ni, Zhengwei
    Zhang, Zhaoyang
    Luong, Nguyen Cong
    Niyato, Dusit
    Kim, Dong In
    Feng, Shaohan
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (08) : 9566 - 9582
  • [8] Scheduling Policies for Federated Learning in Wireless Networks
    Yang, Howard H.
    Liu, Zuozhu
    Quek, Tony Q. S.
    Poor, H. Vincent
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (01) : 317 - 333
  • [9] Federated Learning With Energy Harvesting Devices
    Zeng, Li
    Wen, Dingzhu
    Zhu, Guangxu
    You, Changsheng
    Chen, Qimei
    Shi, Yuanming
    IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, 2024, 8 (01): : 190 - 204
  • [10] Optimized Scheduling Transmissions for Wireless Powered Federated Learning Networks
    Pejoski, Slavche
    Poposka, Marija
    Hadzi-Velkov, Zoran
    IEEE COMMUNICATIONS LETTERS, 2025, 29 (03) : 640 - 644