Mean Field-based Dynamic Backoff Optimization for MIMO-enabled Grant-Free NOMA in Massive IoT Networks
Haibo Wang, Hongwei Gao, Pai Jiang, Matthieu De Mari, Panzer Gu and, Yinsheng Liu

TL;DR
This paper introduces a mean field game approach to optimize dynamic backoff strategies in MIMO-enabled grant-free NOMA for massive IoT, significantly reducing access delay and energy consumption.
Contribution
It develops a novel mean field game framework for backoff optimization in grant-free NOMA, addressing high-dimensional challenges and dynamic channel conditions.
Findings
MFDB outperforms ACB, ALOHA, and MBB in access delay
Achieves lower cumulative cost in simulations
Effective in static and dynamic channels
Abstract
In the 6G Internet of Things (IoT) paradigm, unprecedented challenges will be raised to provide massive connectivity, ultra-low latency, and energy efficiency for ultra-dense IoT devices. To address these challenges, we explore the non-orthogonal multiple access (NOMA) based grant-free random access (GFRA) schemes in the cellular uplink to support massive IoT devices with high spectrum efficiency and low access latency. In particular, we focus on optimizing the backoff strategy of each device when transmitting time-sensitive data samples to a multiple-input multiple-output (MIMO)-enabled base station subject to energy constraints. To cope with the dynamic varied channel and the severe uplink interference due to the uncoordinated grant-free access, we formulate the optimization problem as a multi-user non-cooperative dynamic stochastic game (MUN-DSG). To avoid dimensional disaster as the…
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.
Taxonomy
MethodsFocus · Balanced Selection
