Multi-Channel Random Access with Replications
Information Theory
2017-05-15 v1 math.IT
Abstract
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. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number of channels.
Cite
@article{arxiv.1705.04509,
title = {Multi-Channel Random Access with Replications},
author = {Olga Galinina and Andrey Turlikov and Sergey Andreev and Yevgeni Koucheryavy},
journal= {arXiv preprint arXiv:1705.04509},
year = {2017}
}
Comments
5 pages, 2 figures, accepted by ISIT 2017