A 0.485 throughput randomized part-and-try algorithm

DOI10.1134/S0032946025030020MaRDI QIDQ6878950zbMATH OpenFDO

Authors Andriy Burkov, I. Pastushok, A. M. Tyurlikov

Publication date 5 January 2026

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946025030020

zbMATH Keywords

cellular networksfinite-state machinemassive machine-type communicationspart-and-try algorithmrandom multiple access systems

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Randomized algorithms (68W20) Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Cites work

• A 0.487 throughput limited sensing algorithm
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation
• Bounds on the capacity of FCFS multiple-access algorithms
• scientific article; zbMATH DE number 4064190 (Why is no real title available?)
• scientific article; zbMATH DE number 3659453 (Why is no real title available?)
• scientific article; zbMATH DE number 3713612 (Why is no real title available?)
• Randomized and nonrandomized algorithms of random multiple access
• Some new random multiple-access algorithms
• Survey of USSR contributions to random multiple-access communications
• Tree algorithms for packet broadcast channels

This page was built for publication: A 0.485 throughput randomized part-and-try algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878950)