.png){kind=icon}
.png){kind=icon}
Return
A 0.485 Throughput Randomized Part-and-Try Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1134/S0032946025030020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Among known random multiple access (RMA) algorithms, the part-and-try (splitting) algorithm demonstrates the highest throughput. However, its implementation in cellular random access channels is challenging, since the correct operation of the algorithm requires absolute time synchronization among all users to uniquely identify events in a Poisson arrival process. In this paper, we propose a modified RMA algorithm based on the principles of the part-and-try algorithm, in which the introduction of randomization eliminates the need for temporal event identification. This modification enables the algorithm to be implemented in practical random access systems. The achieved throughput of the algorithm is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$0.485$\end{document}.
Keywords:
cellular networks
random multiple access systems
part-and-try algorithm
massive machine-type communications
finite-state machine
Journal
P
IF:
0.9
Papers:
6
Citations:
0