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

Tutkimustuotos: Konferenssiartikkeli › Scientific › vertaisarvioitu

8 Sitaatiot (Scopus)

4 Lataukset (Pure)

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	2017 IEEE International Symposium on Information Theory (ISIT)
Kustantaja	IEEE
Sivut	2538-2542
Sivumäärä	5
ISBN (elektroninen)	978-1-5090-4096-4
DOI - pysyväislinkit	https://doi.org/10.1109/ISIT.2017.8006987
Tila	Julkaistu - 1 kesäk. 2017
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - Kesto: 1 tammik. 1900 → …

Julkaisusarja

Nimi
ISSN (elektroninen)	2157-8117

Conference

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

Julkaisufoorumi-taso

Jufo-taso 1

Pääsy asiakirjaan

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

Siteeraa tätä

@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

Abstrakti

Julkaisusarja

Conference

Julkaisufoorumi-taso

Pääsy asiakirjaan

Sormenjälki

Siteeraa tätä