Tampere University of Technology

TUTCRIS Research Portal

Upper bound and approximation of random access throughput over chase combining HARQ

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Standard

Upper bound and approximation of random access throughput over chase combining HARQ. / Burkov, A.; Matveev, N.; Turlikov, A.; Bulanov, A.; Gahnina, O.; Andreev, S.

2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE, 2017. p. 143-147.

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Harvard

Burkov, A, Matveev, N, Turlikov, A, Bulanov, A, Gahnina, O & Andreev, S 2017, Upper bound and approximation of random access throughput over chase combining HARQ. in 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE, pp. 143-147, International Conference on Ultra Modern Telecommunications and Control Systems and Workshops, 1/01/00. https://doi.org/10.1109/ICUMT.2017.8255206

APA

Burkov, A., Matveev, N., Turlikov, A., Bulanov, A., Gahnina, O., & Andreev, S. (2017). Upper bound and approximation of random access throughput over chase combining HARQ. In 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) (pp. 143-147). IEEE. https://doi.org/10.1109/ICUMT.2017.8255206

Vancouver

Burkov A, Matveev N, Turlikov A, Bulanov A, Gahnina O, Andreev S. Upper bound and approximation of random access throughput over chase combining HARQ. In 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE. 2017. p. 143-147 https://doi.org/10.1109/ICUMT.2017.8255206

Author

Burkov, A. ; Matveev, N. ; Turlikov, A. ; Bulanov, A. ; Gahnina, O. ; Andreev, S. / Upper bound and approximation of random access throughput over chase combining HARQ. 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE, 2017. pp. 143-147

Bibtex - Download

@inproceedings{88b3a59c70cf4fb9bfb8a99b24d8491a,
title = "Upper bound and approximation of random access throughput over chase combining HARQ",
abstract = "Massive MTC (mMTC) scenarios featuring a tremendous number of devices challenge the conventional multiple access protocols, which are mostly based on classic ALOHA algorithms known for their instability at higher loads. While numerous modifications of ALOHA adopt the unrealistic assumption on the fixed number of contending uses, we in this paper study a model where a random number of users activate within the slot. In particular, we explore a modification of ALOHA augmented with the Chase combining HARQ (HARQ-CC) and derive an approximation for and a simple upper bound on the system throughput. While the former perfectly matches the corresponding simulation results for the SNR of up to 10dB, the latter constitutes an increasingly tight limit as the SNR grows. Based on both analytical considerations, the resulting system throughput may be significantly improved with the optimal choice of the transmission probability and code spectral efficiency.",
keywords = "Decoding, Interference, Nickel, Random variables, Signal to noise ratio, Throughput, Upper bound, ALOHA, Chase combining, Hybrid-ARQ, Random multiple access, system throughput, upper bound",
author = "A. Burkov and N. Matveev and A. Turlikov and A. Bulanov and O. Gahnina and S. Andreev",
note = "INT=elt,{"}Gahnina, O.{"} jufoid=72315",
year = "2017",
month = "11",
day = "1",
doi = "10.1109/ICUMT.2017.8255206",
language = "English",
publisher = "IEEE",
pages = "143--147",
booktitle = "2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

T1 - Upper bound and approximation of random access throughput over chase combining HARQ

AU - Burkov, A.

AU - Matveev, N.

AU - Turlikov, A.

AU - Bulanov, A.

AU - Gahnina, O.

AU - Andreev, S.

N1 - INT=elt,"Gahnina, O." jufoid=72315

PY - 2017/11/1

Y1 - 2017/11/1

N2 - Massive MTC (mMTC) scenarios featuring a tremendous number of devices challenge the conventional multiple access protocols, which are mostly based on classic ALOHA algorithms known for their instability at higher loads. While numerous modifications of ALOHA adopt the unrealistic assumption on the fixed number of contending uses, we in this paper study a model where a random number of users activate within the slot. In particular, we explore a modification of ALOHA augmented with the Chase combining HARQ (HARQ-CC) and derive an approximation for and a simple upper bound on the system throughput. While the former perfectly matches the corresponding simulation results for the SNR of up to 10dB, the latter constitutes an increasingly tight limit as the SNR grows. Based on both analytical considerations, the resulting system throughput may be significantly improved with the optimal choice of the transmission probability and code spectral efficiency.

AB - Massive MTC (mMTC) scenarios featuring a tremendous number of devices challenge the conventional multiple access protocols, which are mostly based on classic ALOHA algorithms known for their instability at higher loads. While numerous modifications of ALOHA adopt the unrealistic assumption on the fixed number of contending uses, we in this paper study a model where a random number of users activate within the slot. In particular, we explore a modification of ALOHA augmented with the Chase combining HARQ (HARQ-CC) and derive an approximation for and a simple upper bound on the system throughput. While the former perfectly matches the corresponding simulation results for the SNR of up to 10dB, the latter constitutes an increasingly tight limit as the SNR grows. Based on both analytical considerations, the resulting system throughput may be significantly improved with the optimal choice of the transmission probability and code spectral efficiency.

KW - Decoding

KW - Interference

KW - Nickel

KW - Random variables

KW - Signal to noise ratio

KW - Throughput

KW - Upper bound

KW - ALOHA

KW - Chase combining

KW - Hybrid-ARQ

KW - Random multiple access

KW - system throughput

KW - upper bound

U2 - 10.1109/ICUMT.2017.8255206

DO - 10.1109/ICUMT.2017.8255206

M3 - Conference contribution

SP - 143

EP - 147

BT - 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)

PB - IEEE

ER -