Random multiple access in a vector disjunctive channel
E. V. Pustovalov, Andrey M. Turlikov · Problems of Information Transmission · 2013
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.