Scholarlink

<p>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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$0.485$</EquationSource> </InlineEquation>.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A 0.485 Throughput Randomized Part-and-Try Algorithm

  • 期刊论文

  • 发表日期：

    2025年12月26日

查看全文
  • A. Burkov,
  • I. Pastushok,
  • A. Turlikov

摘要

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 $0.485$ .