arXiv subjects

Bleron Klaiqi

Publications and source records attributed to Bleron Klaiqi.

4 recordsLinked to original sources

arXiv2025

Beam Misalignment in 3GPP mmWave NR

This paper presents an analytical framework for evaluating beam misalignment in 3GPP mmWave NR systems implementing analog beamforming. Our approach captures the interaction between user mobility, beam sweeping mechanisms, and deployment configurations, focusing on long-term average performance metrics. Specifically, we model the beam misalignment rates at both the base station (BS) and user equipment (UE) as Poisson processes and derive expressions for the expected misalignment duration, misalignment fraction, and overall beamforming gain. The framework accounts for practical constraints in NR such as Synchronization Signal Blocks (SSB) periodicity, TDD frame structures, and SSB overhead. Through numerical evaluation based on 3GPP mmWave parameters, we identify key trade-offs between beam counts, user mobility, and SSB timing, providing actionable design insights for robust and efficient beam management in future high-frequency networks.

cs.NI↗

arXiv2024

Low Layer Functional Split Management in 5G and Beyond: Architecture and Self-adaptation

Radio Access Network (RAN) disaggregation is emerging as a key trend in beyond 5G, as it offers new opportunities for more flexible deployments and intelligent network management. A relevant problem in disaggregated RAN is the functional split selection, which dynamically decides which baseband (BB) functions of a base station are kept close to the radio units and which ones are centralized. In this context, this paper firstly presents an architectural framework for supporting this concept relying on the O-RAN architecture. Then, the paper analyzes how the functional split can be optimized to adapt to the different load conditions while minimizing energy costs.

cs.NI↗

arXiv2023

Learning-Based Latency-Constrained Fronthaul Compression Optimization in C-RAN

The evolution of wireless mobile networks towards cloudification, where Radio Access Network (RAN) functions can be hosted at either a central or distributed locations, offers many benefits like low cost deployment, higher capacity, and improved hardware utilization. Nevertheless, the flexibility in the functional deployment comes at the cost of stringent fronthaul (FH) capacity and latency requirements. One possible approach to deal with these rigorous constraints is to use FH compression techniques. To ensure that FH capacity and latency requirements are met, more FH compression is applied during high load, while less compression is applied during medium and low load to improve FH utilization and air interface performance. In this paper, a model-free deep reinforcement learning (DRL) based FH compression (DRL-FC) framework is proposed that dynamically controls FH compression through various configuration parameters such as modulation order, precoder granularity, and precoder weight quantization that affect both FH load and air interface performance. Simulation results show that DRL-FC exhibits significantly higher FH utilization (68.7% on average) and air interface throughput than a reference scheme (i.e. with no applied compression) across different FH load levels. At the same time, the proposed DRL-FC framework is able to meet the predefined FH latency constraints (in our case set to 260 $μ$s) under various FH loads.

cs.NI↗

arXiv2023

Constrained Deep Reinforcement Learning for Fronthaul Compression Optimization

In the Centralized-Radio Access Network (C-RAN) architecture, functions can be placed in the central or distributed locations. This architecture can offer higher capacity and cost savings but also puts strict requirements on the fronthaul (FH). Adaptive FH compression schemes that adapt the compression amount to varying FH traffic are promising approaches to deal with stringent FH requirements. In this work, we design such a compression scheme using a model-free off policy deep reinforcement learning algorithm which accounts for FH latency and packet loss constraints. Furthermore, this algorithm is designed for model transparency and interpretability which is crucial for AI trustworthiness in performance critical domains. We show that our algorithm can successfully choose an appropriate compression scheme while satisfying the constraints and exhibits a roughly 70\% increase in FH utilization compared to a reference scheme.

eess.SY↗