Throughput and Latency in the Distributed Q-Learning Random Access mMTC Networks

In mMTC mode, with thousands of devices trying to access network resources sporadically, the problem of random access (RA) and collisions between devices that select the same resources becomes crucial. A promising approach to solve such an RA problem is to use learning mechanisms, especially the Q-learning algorithm, where the devices learn about the best time-slot periods to transmit through rewards sent by the central node. In this work, we propose a distributed packet-based learning method by varying the reward from the central node that favors devices having a larger number of remaining packets to transmit. Our numerical results indicated that the proposed distributed packet-based Q-learning method attains a much better throughput-latency trade-off than the alternative independent and collaborative techniques in practical scenarios of interest. In contrast, the number of payload bits of the packet-based technique is reduced regarding the collaborative Q-learning RA technique for achieving the same normalized throughput.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2023

Multi-Power Level Q-Learning Algorithm for Random Access in NOMA mMTC Systems

The massive machine-type communications (mMTC) service will be part of n...
research
04/13/2018

Shifted Coded Slotted ALOHA

The random access scheme is a fundamental scenario in which users transm...
research
10/14/2020

Breaking the Unit Throughput Barrier in Distributed Systems

A multi-level random power transmit strategy that is used in conjunction...
research
01/09/2020

Online Estimation and Adaptation for Random Access with Successive Interference Cancellation

This paper proposes an adaptive transmission algorithm for slotted rando...
research
10/16/2019

Throughput and Delay Analysis of Slotted Aloha with Batch Service

In this paper, we study the throughput and delay performances of the slo...
research
05/28/2020

Analysis of Tree-Algorithms with Multi-Packet Reception

In this paper, we analyze binary-tree algorithms in a setup in which the...
research
11/06/2017

Throughput Maximization for Delay-Sensitive Random Access Communication

We consider a single cell uplink in which many devices randomly transmit...

Please sign up or login with your details

Forgot password? Click here to reset