Beam Management Driven by Radio Environment Maps in O-RAN Architecture
Not on the map. Why?
Abstract (arXiv)
The Massive Multiple-Input Multiple-Output (M-MIMO) is considered as one of the key technologies in 5G, and future 6G networks. From the perspective of, e.g., channel estimation, especially for high-speed users it is easier to implement an M-MIMO network exploiting a static set of beams, i.e., Grid of Beams (GoB). While considering GoB it is important to properly assign users to the beams, i.e., to perform Beam Management (BM). BM can be enhanced by taking into account historical knowledge about the radio environment, e.g., to avoid radio link failures. The aim of this paper is to propose such a BM algorithm, that utilizes location-dependent data stored in a Radio Environment Map (REM). It utilizes received power maps, and user mobility patterns to optimize the BM process in terms of Reinforcement Learning (RL) by using the Policy Iteration method under different goal functions, e.g., maximization of received power or minimization of beam reselections while avoiding radio link failures. The proposed solution is compliant with the Open Radio Access Network (O-RAN) architecture, enabling its practical implementation. Simulation studies have shown that the proposed BM algorithm can significantly reduce the number of beam reselections or radio link failures compared to the baseline algorithm.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 21 Mar 2023.
Builds on
4 of 19 references.
References · 4
- 2020Intelligence and Learning in O-RAN for Data-driven NextG Cellular Networkscited by 45
- 2020Energy and Latency of Beamforming Architectures for Initial Access in mmWave Wireless Networkscited by 3
- 2019Performance Assessment of MIMO Precoding on Realistic mmWave Channelscited by 1
- 2020Beam Management in 5G: A Stochastic Geometry Analysiscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.