On Throughput Bounds of NOMA-ALOHA

Jinho Choi

On Throughput Bounds of NOMA-ALOHA

Information Theory 2021-10-26 v1 math.IT

Authors: Jinho Choi

Abstract

In this paper, we focus on the throughput of random access with power-domain non-orthogonal multiple access (NOMA) and derive bounds on the throughput. In particular, we demonstrate that the expression for the throughput derived in [1] is an upper-bound and derive a new lower-bound as a closed-form expression. This expression allows to find the traffic intensity that maximizes the lower-bound, which is shown to be the square root of the number of power levels in NOMA. Furthermore, with this expression, for a large number of power levels, we obtain the asymptotic maximum throughput that is increased at a rate of the square root of the number of power levels.

Keywords

noma-aloha random access throughput bounds power-domain noma closed-form lower bound asymptotic throughput

Cite

@article{arxiv.2110.12530,
  title  = {On Throughput Bounds of NOMA-ALOHA},
  author = {Jinho Choi},
  journal= {arXiv preprint arXiv:2110.12530},
  year   = {2021}
}

Comments

4 pages, 3 figures (to appear in IEEE Wireless Communications Letters)

Related papers

View all related →

Networking and Internet Architecture · Computer Science

Optimizing Non-Orthogonal Multiple Access in Random Access Networks

Ziru Chen, Yong Liu, Sami Khairy, Lin X. Cai +2

2020-02-25

Signal Processing · Electrical Eng. & Systems

Throughput Analysis and User Barring Design for Uplink NOMA-Enabled Random Access