Showing cs.ITShow all
2 papers · 1 filter
cs.IT2018
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC
Anton Glebov, Nikolay Matveev, Kirill Andreev +2
We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted A…
cs.IT2017
Multi-Channel Random Access with Replications
Olga Galinina, Andrey Turlikov, Sergey Andreev +1
This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station.…