Random multiple access in a vector disjunctive channel

Authors:
E. V. Pustovalov;A. M. Turlikov
Affiliations:
St. Petersburg State University of Aerospace Instrumentation, St. Petersburg, Russia;St. Petersburg State University of Aerospace Instrumentation, St. Petersburg, Russia
Venue:
Problems of Information Transmission
Year:
2013

Citing 6
Cited 0

Conflict-resolving tree algorithm stable to incomplete interference damping

Automation and Remote Control
Tree algorithms for packet broadcast channels

IEEE Transactions on Information Theory
On the T-user M-frequency noiseless multiple-access channel with and without intensity information

IEEE Transactions on Information Theory
Survey of USSR contributions to random multiple-access communications

IEEE Transactions on Information Theory
High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

IEEE Transactions on Information Theory
Multiple access system for a vector disjunctive channel

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

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.