N. H. Mahmood, O. A. López, H. Alves and M. Latva-aho, "A Predictive Interference Management Algorithm for URLLC in Beyond 5G Networks," in IEEE Communications Letters, doi: 10.1109/LCOMM.2020.3035111
A predictive interference management algorithm for URLLC in beyond 5G networks
|Author:||Mahmood, Nurul Huda1; López, Onel Alcaraz1; Alves, Hirley1;|
16G Flagship, Centre for Wireless Communications, University of Oulu, Finland
|Online Access:||PDF Full Text (PDF, 1 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2020110589335
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2020-11-05
Interference mitigation is a major design challenge in wireless systems, especially in the context of ultra-reliable low-latency communication (URLLC) services. Conventional average-based interference management schemes are not suitable for URLLC as they do not accurately capture the tail information of the interference distribution. This letter proposes a novel interference prediction algorithm that considers the entire interference distribution instead of only the mean. The key idea is to model the interference variation as a discrete state space discrete-time Markov chain. The state transition probability matrix is used to estimate the state evolution in time, and allocate radio resources accordingly. The proposed scheme is found to meet the target reliability requirements in a low-latency single-shot transmission system considering realistic system assumptions, while requiring only ~ 25% more resources than the optimum case with perfect interference knowledge.
IEEE communications letters
|Pages:||1 - 5|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work is supported by the Academy of Finland 6Genesis Flagship program (grant no. 318927).
|Academy of Finland Grant Number:||
318927 (Academy of Finland Funding decision)
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.