@inproceedings{ed322e00f4584394b08e479e441b3753,
title = "Multi-channel random access with replications",
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.",
keywords = "approximation theory, authorisation, radio networks, telecommunication security, wireless channels, access delay performance, central base station, hypothetical algorithm, multichannel random access algorithms, multiple message replicas, simple lower bound, Approximation algorithms, Channel estimation, Delays, Heuristic algorithms, Performance evaluation, Redundancy",
author = "O. Galinina and A. Turlikov and S. Andreev and Y. Koucheryavy",
note = "jufoid=57403; IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY ; Conference date: 01-01-1900",
year = "2017",
month = jun,
day = "1",
doi = "10.1109/ISIT.2017.8006987",
language = "English",
publisher = "IEEE",
pages = "2538--2542",
booktitle = "2017 IEEE International Symposium on Information Theory (ISIT)",
address = "United States",
}