Cargando…

CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC

With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant p...

Descripción completa

Detalles Bibliográficos
Autores principales: Youn, Jiseung, Park, Joohan, Oh, Joohyun, Kim, Soohyeong, Ahn, Seyoung, Cho, Sunghyun, Park, Sangwoo, You, Cheolwoo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9607366/
https://www.ncbi.nlm.nih.gov/pubmed/36298310
http://dx.doi.org/10.3390/s22207959
_version_ 1784818525511090176
author Youn, Jiseung
Park, Joohan
Oh, Joohyun
Kim, Soohyeong
Ahn, Seyoung
Cho, Sunghyun
Park, Sangwoo
You, Cheolwoo
author_facet Youn, Jiseung
Park, Joohan
Oh, Joohyun
Kim, Soohyeong
Ahn, Seyoung
Cho, Sunghyun
Park, Sangwoo
You, Cheolwoo
author_sort Youn, Jiseung
collection PubMed
description With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant problem when providing mMTC services in cellular networks. Various studies on efficient preamble transmission have been conducted to solve the random access problem of mMTC services. However, supporting a large number of devices simultaneously with limited resources is a challenging problem. In this study, we investigate code-expanded random access (CeRA), which extends the limited preamble resources to the code domain to decrease the high collision rate. To solve the existing CeRA phantom codeword and physical uplink shared channel (PUSCH) resource shortage problems, we propose an optimal preamble codeword set selection algorithm based on mathematical analysis. The simulation results indicate that the proposed code-expanded random access scheme to enhance success probability (CeRA-eSP) achieves a higher random access success rate with a lower access delay compared to the existing random access schemes.
format Online
Article
Text
id pubmed-9607366
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-96073662022-10-28 CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC Youn, Jiseung Park, Joohan Oh, Joohyun Kim, Soohyeong Ahn, Seyoung Cho, Sunghyun Park, Sangwoo You, Cheolwoo Sensors (Basel) Article With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant problem when providing mMTC services in cellular networks. Various studies on efficient preamble transmission have been conducted to solve the random access problem of mMTC services. However, supporting a large number of devices simultaneously with limited resources is a challenging problem. In this study, we investigate code-expanded random access (CeRA), which extends the limited preamble resources to the code domain to decrease the high collision rate. To solve the existing CeRA phantom codeword and physical uplink shared channel (PUSCH) resource shortage problems, we propose an optimal preamble codeword set selection algorithm based on mathematical analysis. The simulation results indicate that the proposed code-expanded random access scheme to enhance success probability (CeRA-eSP) achieves a higher random access success rate with a lower access delay compared to the existing random access schemes. MDPI 2022-10-19 /pmc/articles/PMC9607366/ /pubmed/36298310 http://dx.doi.org/10.3390/s22207959 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Youn, Jiseung
Park, Joohan
Oh, Joohyun
Kim, Soohyeong
Ahn, Seyoung
Cho, Sunghyun
Park, Sangwoo
You, Cheolwoo
CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title_full CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title_fullStr CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title_full_unstemmed CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title_short CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
title_sort cera-esp: code-expanded random access to enhance success probability of massive mtc
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9607366/
https://www.ncbi.nlm.nih.gov/pubmed/36298310
http://dx.doi.org/10.3390/s22207959
work_keys_str_mv AT younjiseung ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT parkjoohan ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT ohjoohyun ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT kimsoohyeong ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT ahnseyoung ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT chosunghyun ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT parksangwoo ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc
AT youcheolwoo ceraespcodeexpandedrandomaccesstoenhancesuccessprobabilityofmassivemtc