13 May 2021 in IEEE Journal on Selected Areas in Communications
We provide the reader with an accessible yet rigorous introduction to Bayesian optimisation with Gaussian processes (BOGP) for the purpose of solving a wide variety of radio resource management (RRM) problems. We believe that BOGP is a powerful tool that has been somewhat overlooked in RRM research, although it elegantly addresses pressing requirements for fast convergence, safe exploration, and interpretability. BOGP also provides a natural way to exploit prior knowledge during optimization. After explaining the nuts and bolts of BOGP, we delve into more advanced topics, such as the choice of the acquisition function and the optimization of dynamic performance functions. Finally, we put the theory into practice for the RRM problem of uplink open-loop power control (OLPC) in 5G cellular networks, for which BOGP is able to converge to almost optimal solutions in tens of iterations without significant performance drops during exploration.
17 May 2021 in IEEE Transactions on Cognitive Communications and Networking
Communication protocols are the languages used by network nodes. Before a ue exchanges data with a bs, it must first negotiate the conditions and parameters for that transmission. This negotiation is supported by signaling messages at all layers of the protocol stack. Each year, the telecoms industry defines and standardizes these messages, which are designed by humans during lengthy technical (and often political) debates. Following this standardization effort, the development phase begins, wherein the industry interprets and implements the resulting standards. But is this massive development undertaking the only way to implement a given protocol? We address the question of whether radios can learn a pre-given target protocol as an intermediate step towards evolving their own. Furthermore, we train cellular radios to emerge a channel access policy that performs optimally under the constraints of the target protocol. We show that marl and l2c techniques achieve this goal with gains over expert systems. Finally, we provide insight into the transferability of these results to scenarios never seen during training.
19 June 2023 in IEEE Transactions on Cognitive Communications and Networking
Optimal resource allocation in modern communication networks calls for the optimization of objective functions that are only accessible via costly separate evaluations for each candidate solution. The conventional approach carries out the optimization of resource-allocation parameters for each system configuration, characterized, e.g., by topology and traffic statistics, using global search methods such as Bayesian optimization (BO). These methods tend to require a large number of iterations, and hence a large number of key performance indicator (KPI) evaluations. In this paper, we propose the use of meta-learning to transfer knowledge from data collected from related, but distinct, configurations in order to speed up optimization on new network configurations. Specifically, we combine meta-learning with BO, as well as with multi-armed bandit (MAB) optimization, with the latter having the potential advantage of operating directly on a discrete search space. Furthermore, we introduce novel contextual meta-BO and meta-MAB algorithms, in which transfer of knowledge across configurations occurs at the level of a mapping from graph-based contextual information to resource-allocation parameters. Experiments for the problem of open loop power control (OLPC) parameter optimization for the uplink of multi-cell multi-antenna systems provide insights into the potential benefits of meta-learning and contextual optimization.
19 December 2023 in IEEE Transactions on Machine Learning in Communications and Networking
This paper investigates various multi-agent reinforcement learning (MARL) techniques for designing grant-free random access (RA) schemes suitable for low-complexity, low-power battery-operated devices in massive machine-type communication (mMTC). Previous studies on RA with MARL have shown limitations in terms of scalability and suitability for mMTC. To address scalability and practicality of the proposed methods, we examine the impact of excluding agent identification in the observation vector of each agent on network performance. We employ value decomposition networks (VDN) and QMIX algorithms with parameter sharing (PS) and compare their policies with the deep recurrent Q-network (DRQN). Our simulation results demonstrate that the MARL-based RA schemes can achieve a better throughput-fairness trade-off between agents without having to condition on the agent identifiers. We also present a correlated traffic model, which is more descriptive of mMTC scenarios, and show that the proposed algorithm can easily adapt to traffic non-stationarities. Moreover, the robustness of the proposed method in terms of scalability is also shown through simulations.
23 September 2010 in IEEE Transactions on Antennas and Propagation
A method is introduced for the optimization of the numerical group velocity in standard finite-difference time-domain (FDTD) electromagnetic simulations. Through this method analytical expressions for the extrema of are presented for the first time, thus also characterizing its anisotropy. The knowledge of these expressions is hence essential for the evaluation of the anisotropy error in FDTD-based electrodynamics simulations of the propagation of wavepackets in 2D and 3D. This can be of assistance, for example, in the design of error-bounded FDTD simulations with pulsed sources at low computational cost.
13 March 2026 in IEEE Journal on Selected Areas in Communications
Integrating Large AI Models (LAMs) into 6G mobile networks is a key enabler of the AI-Native Air Interface (AI-AI), where protocol intelligence must scale beyond handcrafted logic. This paper presents, to our knowledge, the first standards-compliant emulation of the Radio Resource Control (RRC) layer using a decoder-only LAM (LLAMA-class) fine-tuned with Low-Rank Adaptation (LoRA) on a multi-vendor corpus of real-world traces spanning both 5G and 4G systems. We treat RRC as a domain-specific language and construct a segmentation-safe Question-and-Answer (QA) dataset that preserves Abstract Syntax Notation (ASN.1) structure through linearization prior to Byte Pair Encoding (BPE) tokenization. The proposed approach combines parameter-efficient adaptation with schema-bounded prompting to ensure syntactic and procedural fidelity. Evaluation introduces a standards-aware triad—ASN.1 conformance, field-level coverage analysis, and uplink-to-downlink state-machine checks—alongside semantic similarity and latency profiling across 120 configurations. On 30k 5G request–response pairs plus an additional 4.8k QA turns from 4G sessions, our 8B model achieves a median cosine similarity of 0.97, a 61% relative gain over a zero-shot baseline, while sustaining high conformance rates. These results demonstrate that LAMs, when augmented with protocol-aware reasoning, can directly orchestrate control-plane procedures, laying the foundation for the future Artificial Intelligence (AI)-native Radio Access Network (RAN).