|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 2, Pages 17–33
(Mi ppi2106)
|
|
|
|
Information Theory
Random multiple access in a vector disjunctive channel
E. V. Pustovalov, A. M. Turlikov Saint-Petersburg State University of Aerospace Instrumentation
Abstract:
We consider a random multiple access (RMA) procedure in a vector disjunctive channel. We show that exploiting properties of the channel allows one to reduce collision resolution time and thus increase the maximal stable throughput (MST) of RMA algorithms in this channel. We propose an algorithm, belonging to the class of splitting algorithms, which achieves the MST of 0.603.
Received: 12.10.2012 Revised: 01.03.2013
Citation:
E. V. Pustovalov, A. M. Turlikov, “Random multiple access in a vector disjunctive channel”, Probl. Peredachi Inf., 49:2 (2013), 17–33; Problems Inform. Transmission, 49:2 (2013), 111–126
Linking options:
https://www.mathnet.ru/eng/ppi2106 https://www.mathnet.ru/eng/ppi/v49/i2/p17
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 59 | References: | 40 | First page: | 13 |
|