Resource Allocation and Sharing in URLLC for IoT Applications using Shareability Graphs
Federico Librino, Paolo Santi

TL;DR
This paper introduces a graph-theoretical resource allocation method for URLLC in IoT, improving spectral efficiency and fairness in fragmented spectrum scenarios without requiring channel state information.
Contribution
It proposes a novel resource allocation approach based on shareability graphs for URLLC in IoT, addressing spectrum fragmentation and lack of CSI.
Findings
Spectral efficiency increased by up to 50% over benchmarks.
Fairness was improved alongside spectral efficiency.
Method effective in dense smart factory scenarios.
Abstract
The current development trend of wireless communications aims at coping with the very stringent reliability and latency requirements posed by several emerging Internet of Things (IoT) application scenarios. Since the problem of realizing Ultra Reliable Low-Latency Communications (URLLC) is becoming more and more important, it has attracted the attention of researchers, and new efficient resource allocation algorithms are necessary. In this paper, we consider a challenging scenario where the available spectrum might be fragmented across non-adjacent portions of the band, and channels are differently affected by interference coming from surrounding networks. Furthermore, Channel State Information (CSI) is assumed to be unavailable, thus requiring an allocation of resources based only on topology information and channel statistics. To address this challenge in a dense smart factory…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
