|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 3, Pages 67–82
(Mi ppi619)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Communication Network Theory
Random Multiple Access in a Channel with Binary “Success – No Success” Feedback
B. S. Tsybakov, A. N. Beloyarov
Abstract:
We consider a random multiple access (RMA) algorithm for packets in a binary feedback channel. Through “success – no success” feedback, all stations learn if one of the following situations occurred in the channel: (a) a single packet was transmitted in the current window (success) or (b) no packets were transmitted or more than one packet was transmitted (no success). An RMA algorithm is proposed with rate $1/e=0.367$. Previously known algorithms had rates not exceeding 0.329. The algorithm is generalized to the case of “empty – not empty” binary feedback.
Received: 26.12.1988
Citation:
B. S. Tsybakov, A. N. Beloyarov, “Random Multiple Access in a Channel with Binary “Success – No Success” Feedback”, Probl. Peredachi Inf., 26:3 (1990), 67–82; Problems Inform. Transmission, 26:3 (1990), 245–260
Linking options:
https://www.mathnet.ru/eng/ppi619 https://www.mathnet.ru/eng/ppi/v26/i3/p67
|
Statistics & downloads: |
Abstract page: | 293 | Full-text PDF : | 114 | First page: | 2 |
|