5 papers
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…
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.…
Spatial random multiple access with multiple departure
Sergey Foss, Andrey Turlikov, Maxim Grankin
We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the s…
Stability and instability of a random multiple access model with adaptive energy harvesting
Sergey Foss, Dmitriy Kim, Andrey Turlikov
We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition…
Stability of a Random Multiple Access Channel with "Success-Failure" Feedback
Sergey Foss, Bruce Hajek, Andrey Turlikov
We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, li…