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 条
  • [31] BiSPARCs for Unsourced Random Access in Massive MIMO
    Agostini, Patrick
    Utkovski, Zoran
    Stanczak, Slawomir
    FIFTY-SEVENTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, IEEECONF, 2023, : 299 - 303
  • [32] Federated Learning With Cooperating Devices: A Consensus Approach for Massive IoT Networks
    Savazzi, Stefano
    Nicoli, Monica
    Rampa, Vittorio
    IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (05) : 4641 - 4654
  • [33] A Reconfigurable Access Scheme for Massive-MIMO MTC Networks
    Shoaei, Atoosa Dalili
    Nguyen, Duc Tuong
    Le-Ngoc, Tho
    IEEE ACCESS, 2021, 9 : 65547 - 65559
  • [34] Dynamic Unsourced Random Access With Massive MIMO
    Jiang, Jia-Cheng
    Wang, Hui-Ming
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (08) : 9460 - 9473
  • [35] Over-the-Air Hierarchical Personalized Federated Learning
    Zhou, Fangtong
    Wang, Zhibin
    Shan, Hangguan
    Wu, Liantao
    Tian, Xiaohua
    Shi, Yuanming
    Zhou, Yong
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2025, 74 (03) : 5006 - 5021
  • [36] Serving Federated Learning and Non-Federated Learning Users: A Massive MIMO Approach
    Farooq, Muhammad
    Vu, Tung T.
    Hien Quoc Ngo
    Le-Nam Tran
    2022 IEEE 23RD INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATION (SPAWC), 2022,
  • [37] Federated Learning for Hybrid Beamforming in mm-Wave Massive MIMO
    Elbir, Ahmet M.
    Coleri, Sinem
    IEEE COMMUNICATIONS LETTERS, 2020, 24 (12) : 2795 - 2799
  • [38] RANDOM ACCESS FOR MASSIVE MIMO SYSTEMS WITH INTRA-CELL PILOT CONTAMINATION
    de Carvalho, Elisabeth
    Bjornson, Emil
    Larsson, Erik G.
    Popovski, Petar
    2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS, 2016, : 3361 - 3365
  • [39] Grant-Free Random Access With Channel Differentiation in Massive MIMO Systems
    He, Yuxuan
    Ren, Guangliang
    Dong, Xiaodai
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (02) : 2695 - 2700
  • [40] Virtual Carrier Sensing-Based Random Access in Massive MIMO Systems
    Ding, Jie
    Qu, Daiming
    Jiang, Hao
    Jiang, Tao
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (10) : 6590 - 6600