Achieving Maximum Urgency-Dependent Throughput in Random Access

doi:10.1109/TCOMM.2023.3305465

Achieving Maximum Urgency-Dependent Throughput in Random Access

2023-11-01

2

PRE

AI

DOI：10.1109/TCOMM.2023.3305465

Original

Original request for help

Save

Abstract

En 中文

Designing efficient random access is a vital problem for urgency-constrained packet delivery in uplink Internet of Things (IoT), which has not been investigated in depth so far. In this paper, we focus on unpredictable frame-synchronized traffic, which captures a number of scenarios in IoT communications, and generalize prior studies on this issue by considering a general ALOHA-like protocol, a general single-packet reception (SPR) channel, urgency-dependent throughput (UDT) based on a general urgency function, and the dynamic programming optimality. With a complete knowledge of the number of active users, we use the theory of Markov Decision Process (MDP) to explicitly obtain optimal policies for maximizing the UDT, and prove that a myopic policy is in general optimal. With an incomplete knowledge of the number of active users, we use the theory of Partially Observable MDP (POMDP) to seek optimal policies, and show that a myopic policy is in general not optimal by presenting a counterexample. Because of the prohibitive complexity to obtain optimal or near-optimal policies for this case, we propose two practical policies that utilize the inherent property of our MDP framework and channel model. Simulation results show that both outperform other alternatives. The robustness under relaxed system settings is also examined.

Keywords:

Throughput

Markov processes

Uplink

Protocols

Complexity theory

Channel models

Mobile communication

Internet of Things

random access

stochastic optimal control

urgency constraint

delivery deadline

Achieving Maximum Urgency-Dependent Throughput in Random Access

Abstract

Journal

Organization