Traffic Prediction Based Fast Uplink Grant for Massive IoT
Mohammad Shehab, Alexander K. Hagelskj{\ae}r, Anders E. Kal{\o}r,, Petar Popovski, Hirley Alves

TL;DR
This paper introduces a traffic prediction framework for massive IoT networks using hidden Markov models to optimize uplink resource allocation, significantly improving system efficiency and reducing missed opportunities.
Contribution
It proposes a novel traffic prediction method based on HMMs for IoT devices and integrates it into a fast uplink grant scheme to enhance resource allocation.
Findings
Outperforms conventional random access in regret and efficiency.
Maintains lower age of information in massive deployments.
Reduces missed resource allocation opportunities.
Abstract
This paper presents a novel framework for traffic prediction of IoT devices activated by binary Markovian events. First, we consider a massive set of IoT devices whose activation events are modeled by an On-Off Markov process with known transition probabilities. Next, we exploit the temporal correlation of the traffic events and apply the forward algorithm in the context of hidden Markov models (HMM) in order to predict the activation likelihood of each IoT device. Finally, we apply the fast uplink grant scheme in order to allocate resources to the IoT devices that have the maximal likelihood for transmission. In order to evaluate the performance of the proposed scheme, we define the regret metric as the number of missed resource allocation opportunities. The proposed fast uplink scheme based on traffic prediction outperforms both conventional random access and time division duplex in…
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.
