A Random Access Scheme for Federated Learning Over Massive MIMO Systems

被引:1
|
作者
Han, Huimei [1 ]
Zhao, Jun [2 ]
Zhou, Xinyu [2 ]
机构
[1] Zhejiang Univ Technol, Key Lab Commun Networks & Applicat Zhejiang Prov, Coll Informat Engn, Hangzhou 310023, Zhejiang, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
Computational modeling; Data models; Massive MIMO; Convergence; Internet of Things; Optimization; Performance evaluation; Federated learning (FL); massive multiple-input multiple-output (MIMO); over-the-air computation; random access (RA); ALLOCATION;
D O I
10.1109/JIOT.2023.3278256
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we present a random access (RA) scheme for federated learning (FL) over massive multiple-input-multiple-output (MIMO) systems to tackle the issue of some local devices not being able to compute their local models. This scheme adopts a multichannel model and allows devices to randomly select their uploading channels, and then the base station (BS) aggregates the local models received from channels directly based on the over-the-air computation. We call this scheme as RA-based FL over massive MIMO (RAFL-MIMO). Furthermore, to enable more devices to be involved in the FL process, we propose to utilize an access class barring (ACB) method to select the uploading devices and formulate an optimization problem of the ACB factor. We also derive the expected asymptotic convergence rate of the proposed RAFL-MIMO scheme to analytically show that the proposed RAFL-MIMO scheme can improve the performance of FL. Simulation results based on L2-norm linear regression, and MNIST handwritten digits identification, Cifar-10 photograph classification show that the proposed RAFL-MIMO scheme significantly outperforms the case of the RAFL-MIMO without the ACB factor.
引用
收藏
页码:19027 / 19042
页数:16
相关论文
共 50 条
  • [21] A Graph-Based Random Access Protocol for Crowded Massive MIMO Systems
    Han, Huimei
    Li, Ying
    Guo, Xudong
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (11) : 7348 - 7361
  • [22] Hybrid-grant Random Access in Massive MIMO Systems
    Zhang, Qi
    Jin, Shi
    Zhu, Hongbo
    2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2020,
  • [23] Over-the-Air Federated Multi-Task Learning Over MIMO Multiple Access Channels
    Zhong, Chenxi
    Yang, Huiyuan
    Yuan, Xiaojun
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2023, 22 (06) : 3853 - 3868
  • [24] Federated Learning for Channel Estimation in Conventional and RIS-Assisted Massive MIMO
    Elbir, Ahmet M.
    Coleri, Sinem
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (06) : 4255 - 4268
  • [25] Communication-and-Energy Efficient Over-the-Air Federated Learning
    Liang, Yipeng
    Chen, Qimei
    Zhu, Guangxu
    Jiang, Hao
    Eldar, Yonina C.
    Cui, Shuguang
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2025, 24 (01) : 767 - 782
  • [26] Preamble-Data Superposition Random Access in Massive MIMO Systems
    Ding, Jie
    Choi, Jinho
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2020, 9 (06) : 906 - 910
  • [27] A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
    Bjornson, Emil
    de Carvalho, Elisabeth
    Sorensen, Jesper H.
    Larsson, Erik G.
    Popovski, Petar
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (04) : 2220 - 2234
  • [28] Massive MIMO for Serving Federated Learning and Non-Federated Learning Users
    Farooq, Muhammad
    Vu, Tung Thanh
    Ngo, Hien Quoc
    Tran, Le-Nam
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (01) : 247 - 262
  • [29] A Linear Bayesian Learning Receiver Scheme for Massive MIMO Systems
    Kosasih, Alva
    Hardjawana, Wibowo
    Vucetic, Branka
    Wen, Chao-Kai
    2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2020,
  • [30] Access Point Cooperation Strategies for Coded Random Access in Cell-Free Massive MIMO
    Testi, Enrico
    Tralli, Velio
    Paolini, Enrico
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (17): : 27916 - 27931