Intent-Aware DRL-Based NOMA Uplink Dynamic Scheduler for IIoT

Salwa Mostafa, Mateus P. Mota, Alvaro Valcarce, Mehdi Bennis
3/27/2024
cs.ITcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

We investigate the problem of supporting Industrial Internet of Things user equipment (IIoT UEs) with intent (i.e., requested quality of service (QoS)) and random traffic arrival. A deep reinforcement learning (DRL) based centralized dynamic scheduler for time-frequency resources is proposed to learn how to schedule the available communication resources among the IIoT UEs. The proposed scheduler leverages an RL framework to adapt to the dynamic changes in the wireless communication system and traffic arrivals. Moreover, a graph-based reduction scheme is proposed to reduce the state and action space of the RL framework to allow fast convergence and a better learning strategy. Simulation results demonstrate the effectiveness of the proposed intelligent scheduler in guaranteeing the expressed intent of IIoT UEs compared to several traditional scheduling schemes, such as round-robin, semi-static, and heuristic approaches. The proposed scheduler also outperforms the contention-free and contention-based schemes in maximizing the number of successfully computed tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{mostafa2024intentaware,
  title  = {Intent-Aware DRL-Based NOMA Uplink Dynamic Scheduler for IIoT},
  author = {Salwa Mostafa and Mateus P. Mota and Alvaro Valcarce and Mehdi Bennis},
  year   = {2024},
  eprint = {2403.18364},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.18364v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.18364.svg)](https://codeofpaper.com/paper/2403.18364)

Discussion