Tobias Kallehauge

dblp:304/3028 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2025
0000-0001-9155-7856ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 4 first-author · 6 since 2021
YearPublicationVenuePosition
2025 Fast Transmission Control Adaptation for URLLC via Channel Knowledge Map and Meta-Learning
abstract
This article considers methods for delivering ultrareliable low-latency communication (URLLC) to enable mission-critical Internet of Things (IoT) services in wireless environments with unknown channel distribution. The methods rely upon the historical channel gain samples of a few locations in a target area. We formulate a nontrivial transmission control adaptation problem across the target area under the URLLC constraints. Then we propose two solutions to solve this problem. The first is a power scaling scheme in conjunction with the deep reinforcement learning (DRL) algorithm with the help of the channel knowledge map (CKM) without retraining, where the CKM employs the spatial correlation of the channel characteristics from the historical channel gain samples. The second solution is model agnostic meta-learning (MAML)-based meta-reinforcement learning algorithm that is trained from the known channel gain samples following distinct channel distributions and can quickly adapt to the new environment within a few steps of gradient update. Simulation results indicate that the DRL-based algorithm can effectively meet the reliability requirement of URLLC under various Quality-of-Service (QoS) constraints. Then the adaptation capabilities of the power scaling scheme and meta-reinforcement learning algorithm are also validated.
Hongsen Peng, Tobias Kallehauge, Meixia Tao, Petar Popovski
IEEE Internet Things J.2
2025 Prediction of Rare Channel Conditions Using Bayesian Statistics and Extreme Value Theory
abstract
Estimating the probability of rare channel conditions is a central challenge in ultra-reliable wireless communication, where random events, such as deep fades, can cause sudden variations in the channel quality. This paper proposes a sample-efficient framework for predicting the statistics of such events by utilizing spatial dependency between channel measurements acquired from various locations. The proposed framework combines radio maps with non-parametric models and extreme value theory (EVT) to estimate rare-event channel statistics under a Bayesian formulation. The framework can be applied to a wide range of problems in wireless communication and is exemplified by rate selection in ultra-reliable communications. Notably, besides simulated data, the proposed framework is also validated with experimental measurements. The results in both cases show that the Bayesian formulation provides significantly better results in terms of throughput compared to baselines that do not leverage measurements from surrounding locations. It is also observed that the models based on EVT are generally more accurate in predicting rare-event statistics than non-parametric models, especially when only a limited number of channel samples are available. Overall, the proposed methods can significantly reduce the number of measurements required to predict rare channel conditions and guarantee reliability.
Tobias Kallehauge, Anders E. Kalør, Pablo Ramirez-Espinosa, Christophe Biscio, Petar Popovski
IEEE Trans. Commun.1
2024 Experimental Study of Spatial Statistics for Ultra-Reliable Communications
abstract
This paper presents an experimental validation for prediction of rare fading events using channel distribution information (CDI) maps that predict channel statistics from measurements acquired at surrounding locations using spatial interpolation. Using experimental channel measurements from 127 locations, we demonstrate the use case of providing statistical guarantees for rate selection in ultra-reliable low-latency communication (URLLC) using CDI maps. By using only the user location and the estimated map, we are able to meet the desired outage probability with a probability between 93.6–95.6% targeting 95%. On the other hand, a model-based baseline scheme that assumes Rayleigh fading meets the target outage requirement with a probability of 77.2%. The results demonstrate the practical relevance of CDI maps for resource allocation in URLLC.
Tobias Kallehauge, Anders E. Kalør, Fengchun Zhang, Petar Popovski
ICC1
2024 On the Statistical Relation of Ultra-Reliable Wireless and Location Estimation
abstract
Location information is often used as a proxy to guarantee the performance of a wireless communication link. However, localization errors can result in a significant mismatch with the guarantees, particularly detrimental to users operating the ultra-reliable low-latency communication (URLLC) regime. This paper unveils the fundamental statistical relations between location estimation uncertainty and wireless link reliability, specifically in the context of rate selection for ultra-reliable communication. We start with a simple one-dimensional narrowband Rayleigh fading scenario and build towards a two-dimensional scenario in a rich scattering environment. The wireless link reliability is characterized by the meta-probability, the probability with respect to localization error of exceeding the outage capacity, and by removing other sources of errors in the system, we show that reliability is sensitive to localization errors. The ϵ-outage coherence radius is defined and shown to provide valuable insight into the problem of location-based rate selection. However, it is generally challenging to guarantee reliability without accurate knowledge of the propagation environment. Finally, several rate-selection schemes are proposed, showcasing the problem’s dynamics and revealing that properly accounting for the localization error is critical to ensure good performance in terms of reliability and achievable throughput.
Tobias Kallehauge, Martin Voigt Vejling, Pablo Ramirez-Espinosa, Kimmo Kansanen, Henk Wymeersch, Petar Popovski
IEEE Trans. Wirel. Commun.1
2022 Predictive Rate Selection for Ultra-Reliable Communication using Statistical Radio Maps
abstract
This paper proposes exploiting the spatial correlation of wireless channel statistics beyond the conventional received signal strength maps by constructing statistical radio maps to predict any relevant channel statistics to assist communications. Specifically, from stored channel samples acquired by previous users in the network, we use Gaussian processes (GPs) to estimate quantiles of the channel distribution at a new position using a non-parametric model. This prior information is then used to select the transmission rate for some target level of reliability. The approach is tested with synthetic data, simulated from urban micro-cell environments, highlighting how the proposed solution helps to reduce the training estimation phase, which is especially attractive for the tight latency constraints inherent to ultra-reliable low-latency (URLLC) deployments.
Tobias Kallehauge, Pablo Ramirez-Espinosa, Anders E. Kalør, Christophe Biscio, Petar Popovski
GLOBECOM1
2022 Power Adaptation in URLLC over Parallel Fading Channels in the Finite Blocklength Regime
abstract
We treat the problem of power and rate adaptation for a point-to-point ultra-reliable low latency communication (URLLC) system over parallel fading channels. The model includes a stochastic traffic arrival process and the transmissions are conducted in the finite blocklength (FBL) regime. The problem is formulated as a long term total power minimization problem under reliability, latency, and peak power constraints. We first establish a proactive outdated data dropping queueing model and transform the reliability constraint into a queuing status constraint. Then we train a deep reinforcement learning (DRL) agent to employ Deep Deterministic Policy Gradient (DDPG) in order to allocate the transmit power on each sub-channel and control the decoding error probability to meet the URLLC constraints. Simulation results show that the proposed DDPG-based algorithm can reduce the transmit power consumption by 13%-26% compared to a baseline approach based on effective capacity. Furthermore, the trained network is scalable and robust towards different traffic arrival models, as well as variations of the average arrival rate.
Hongsen Peng, Meixia Tao, Tobias Kallehauge, Petar Popovski
GLOBECOM3