RANDOMIZED SPLITTING ALGORITHM FOR CENTRALIZED RANDOM MULTIPLE ACCESS SYSTEMS
Проблемы передачи информации / Problems of Information Transmission · 2025 · 61 (3) · 49
DOI: 10.7868/s3034583925030027 ↗Kurz gefasst
Fachartikel in der Zeitschrift Проблемы передачи информации / Problems of Information Transmission, 2025. Verfasst von A.A. Burkov und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
Modern communication systems widely use random multiple access (RMA) algorithms based on the ideas of the ALOHA algorithm. An alternative to this approach is to use ideas based on the splitting algorithm, which has a throughput of 0.4877 messages per unit of time, the highest throughput among all known RMA algorithms. The main problem in implementing this algorithm in practice is the need for precise time synchronization of all devices. This paper proposes an RMA algorithm based on the splitting algorithm that is free of this drawback, allowing it to be used in practice in centralized systems.
Zitieren
APA
Burkov, A., Pastushok, I., & Turlikov, A. (2025). RANDOMIZED SPLITTING ALGORITHM FOR CENTRALIZED RANDOM MULTIPLE ACCESS SYSTEMS. Проблемы передачи информации / Problems of Information Transmission, 61(3), 49. https://doi.org/10.7868/s3034583925030027
Vancouver
Burkov A, Pastushok I, Turlikov A. RANDOMIZED SPLITTING ALGORITHM FOR CENTRALIZED RANDOM MULTIPLE ACCESS SYSTEMS. Проблемы передачи информации / Problems of Information Transmission. 2025;61(3):49. doi:10.7868/s3034583925030027
BibTeX
@article{Burkov2025,
author = {Burkov, A.A. and Pastushok, I.A. and Turlikov, A.M.},
title = {RANDOMIZED SPLITTING ALGORITHM FOR CENTRALIZED RANDOM MULTIPLE ACCESS SYSTEMS},
journal = {Проблемы передачи информации / Problems of Information Transmission},
year = {2025},
volume = {61},
number = {3},
pages = {49},
doi = {10.7868/s3034583925030027}
}
EUVIMED