Multi-channel random access with replications

O. Galinina; A. Turlikov; S. Andreev; Y. Koucheryavy

doi:10.1109/ISIT.2017.8006987

Multi-channel random access with replications

O. Galinina, A. Turlikov, S. Andreev, Y. Koucheryavy

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

8 Citations (Scopus)

3 Downloads (Pure)

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.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory (ISIT)
Publisher	IEEE
Pages	2538-2542
Number of pages	5
ISBN (Electronic)	978-1-5090-4096-4
DOIs	https://doi.org/10.1109/ISIT.2017.8006987
Publication status	Published - 1 Jun 2017
Publication type	A4 Article in conference proceedings
Event	IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - Duration: 1 Jan 1900 → …

Publication series

Name
ISSN (Electronic)	2157-8117

Conference

Conference	IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
Period	1/01/00 → …

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

Publication forum classification

Publication forum level 1

Access to Document

10.1109/ISIT.2017.8006987

Multi-channel random access with replications 2017
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Accepted author manuscript, 262 KB

http://urn.fi/URN:NBN:fi:tuni-202002262380

Cite this

@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)",

}

TY - GEN

T1 - Multi-channel random access with replications

AU - Galinina, O.

AU - Turlikov, A.

AU - Andreev, S.

AU - Koucheryavy, Y.

N1 - jufoid=57403

PY - 2017/6/1

Y1 - 2017/6/1

N2 - 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.

AB - 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.

KW - approximation theory

KW - authorisation

KW - radio networks

KW - telecommunication security

KW - wireless channels

KW - access delay performance

KW - central base station

KW - hypothetical algorithm

KW - multichannel random access algorithms

KW - multiple message replicas

KW - simple lower bound

KW - Approximation algorithms

KW - Channel estimation

KW - Delays

KW - Heuristic algorithms

KW - Performance evaluation

KW - Redundancy

U2 - 10.1109/ISIT.2017.8006987

DO - 10.1109/ISIT.2017.8006987

M3 - Conference contribution

SP - 2538

EP - 2542

BT - 2017 IEEE International Symposium on Information Theory (ISIT)

PB - IEEE

T2 - IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

Y2 - 1 January 1900

ER -

Multi-channel random access with replications

Abstract

Publication series

Conference

Keywords

Publication forum classification

Access to Document

Fingerprint

Cite this