|
Problemy Peredachi Informatsii, 1993, Volume 29, Issue 1, Pages 82–91
(Mi ppi167)
|
|
|
|
Communication Network Theory
Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel
N. B. Likhanov, I. Plotnik, Y. Shavitt, M. Sidi, B. S. Tsybakov
Abstract:
Random access algorithms to a common channel with multiple reception capability by receivers and an $n$-ary feedback channel are presented. The algorithms belong to the class of splitting algorithms. It is shown that the throughput of these algorithms is 1.5–3% higher than the throughput of the best known algorithm with ternary feedback channel.
Received: 10.04.1992
Citation:
N. B. Likhanov, I. Plotnik, Y. Shavitt, M. Sidi, B. S. Tsybakov, “Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel”, Probl. Peredachi Inf., 29:1 (1993), 82–91; Problems Inform. Transmission, 29:1 (1993), 70–79
Linking options:
https://www.mathnet.ru/eng/ppi167 https://www.mathnet.ru/eng/ppi/v29/i1/p82
|
Statistics & downloads: |
Abstract page: | 305 | Full-text PDF : | 177 | First page: | 3 |
|