Title
Random multiple access in a vector disjunctive channel
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.
Year
DOI
Venue
2013
10.1134/S0032946013020026
Probl. Inf. Transm.
Keywords
Field
DocType
collision resolution time,rma algorithm,maximal stable throughput,vector disjunctive channel,splitting algorithm,random multiple access
Stable throughput,Single antenna interference cancellation,Communication channel,Algorithm,Information transmission,Collision,Random multiple access,Mathematics
Journal
Volume
Issue
ISSN
49
2
1608-3253
Citations 
PageRank 
References 
0
0.34
6
Authors
2
Name
Order
Citations
PageRank
E. V. Pustovalov100.34
A. M. Turlikov200.68