Random multiple access in a vector disjunctive channel

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, bel...

Full description

Saved in:
Bibliographic Details
Published in:Problems of information transmission 2013-04, Vol.49 (2), p.111-126
Main Authors: Pustovalov, E. V., Turlikov, A. M.
Format: Article
Language:English
Subjects:
Communications Engineering
Control
Electrical Engineering
Engineering
Information Storage and Retrieval
Information Theory
Networks
Systems Theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0032-9460
1608-3253
DOI:10.1134/S0032946013020026