Two-Phase Random Access Procedure for LTE-A Networks

Simultaneous random access attempts from massive machine-type communications (mMTC) devices may severely congest a shared physical random access channel (PRACH) in mobile networks. This paper presents a novel two-phase random access (TPRA) procedure to deal with the congestion caused by mMTC devices...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications 2019-04, Vol.18 (4), p.2374-2387
Hauptverfasser: Cheng, Ray-Guang, Becvar, Zdenek, Huang, Yi-Shin, Bianchi, Giuseppe, Harwahyu, Ruki
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2387
container_issue 4
container_start_page 2374
container_title IEEE transactions on wireless communications
container_volume 18
creator Cheng, Ray-Guang
Becvar, Zdenek
Huang, Yi-Shin
Bianchi, Giuseppe
Harwahyu, Ruki
description Simultaneous random access attempts from massive machine-type communications (mMTC) devices may severely congest a shared physical random access channel (PRACH) in mobile networks. This paper presents a novel two-phase random access (TPRA) procedure to deal with the congestion caused by mMTC devices accessing the PRACH. During the first phase, the TPRA splits the mMTC devices into smaller groups according to a preamble selected randomly by the devices. Then, in the second phase, each group of devices is assigned with a dedicated channel to complete the random access procedure. The proposed concept allows a base station to adjust the number of dedicated channels in real-time according to the actual network load. We then present an analytical model to estimate the access success probability and the average access delay of the TPRA. Finally, we propose a simple formula to determine the optimal number of random access resources for the second phase of the proposed TPRA. Simulations are carried out to validate the analytical models and to demonstrate the benefits of the TPRA compared to competitive techniques.
doi_str_mv 10.1109/TWC.2019.2903479
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TWC_2019_2903479</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8667033</ieee_id><sourcerecordid>2203400695</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-86d8ccc98f18965e145b95ecc4a26595a6e9401e359cac0a6655a9979e2a529d3</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt3wcuC59RJsslmjmWpH1C0yIrHELOz2GqbmrQU_71bWjzNHJ53Ph7GrgWMhAC8a97rkQSBI4mgygpP2EBobbmUpT3d98pwIStzzi5yXgCIymg9YGWzi3z26TMVr37VxmUxDoFyLmYpBmq3iYoupmLaTPi4eKbNLqavfMnOOv-d6epYh-ztftLUj3z68vBUj6c8KF1tuDWtDSGg7YRFo0mU-gM1hVB6aTRqbwhLEKQ0Bh_Am_4ij1ghSa8ltmrIbg9z1yn-bClv3CJu06pf6aTsvwQwqHsKDlRIMedEnVun-dKnXyfA7d243o3bu3FHN33k5hCZE9E_bo2pQCn1BxhmXS8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2203400695</pqid></control><display><type>article</type><title>Two-Phase Random Access Procedure for LTE-A Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Cheng, Ray-Guang ; Becvar, Zdenek ; Huang, Yi-Shin ; Bianchi, Giuseppe ; Harwahyu, Ruki</creator><creatorcontrib>Cheng, Ray-Guang ; Becvar, Zdenek ; Huang, Yi-Shin ; Bianchi, Giuseppe ; Harwahyu, Ruki</creatorcontrib><description>Simultaneous random access attempts from massive machine-type communications (mMTC) devices may severely congest a shared physical random access channel (PRACH) in mobile networks. This paper presents a novel two-phase random access (TPRA) procedure to deal with the congestion caused by mMTC devices accessing the PRACH. During the first phase, the TPRA splits the mMTC devices into smaller groups according to a preamble selected randomly by the devices. Then, in the second phase, each group of devices is assigned with a dedicated channel to complete the random access procedure. The proposed concept allows a base station to adjust the number of dedicated channels in real-time according to the actual network load. We then present an analytical model to estimate the access success probability and the average access delay of the TPRA. Finally, we propose a simple formula to determine the optimal number of random access resources for the second phase of the proposed TPRA. Simulations are carried out to validate the analytical models and to demonstrate the benefits of the TPRA compared to competitive techniques.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2019.2903479</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>analytical model ; Analytical models ; Computer simulation ; Delays ; Dynamic scheduling ; Electronic devices ; massive machine-type communications ; Mathematical models ; Mobile communication systems ; Performance evaluation ; Random access ; Real-time systems ; Resource management ; Wireless communication ; Wireless communications ; Wireless networks</subject><ispartof>IEEE transactions on wireless communications, 2019-04, Vol.18 (4), p.2374-2387</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-86d8ccc98f18965e145b95ecc4a26595a6e9401e359cac0a6655a9979e2a529d3</citedby><cites>FETCH-LOGICAL-c357t-86d8ccc98f18965e145b95ecc4a26595a6e9401e359cac0a6655a9979e2a529d3</cites><orcidid>0000-0003-3580-9128 ; 0000-0003-3309-7075 ; 0000-0002-6511-3546 ; 0000-0001-5155-8192</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8667033$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27915,27916,54749</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8667033$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cheng, Ray-Guang</creatorcontrib><creatorcontrib>Becvar, Zdenek</creatorcontrib><creatorcontrib>Huang, Yi-Shin</creatorcontrib><creatorcontrib>Bianchi, Giuseppe</creatorcontrib><creatorcontrib>Harwahyu, Ruki</creatorcontrib><title>Two-Phase Random Access Procedure for LTE-A Networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Simultaneous random access attempts from massive machine-type communications (mMTC) devices may severely congest a shared physical random access channel (PRACH) in mobile networks. This paper presents a novel two-phase random access (TPRA) procedure to deal with the congestion caused by mMTC devices accessing the PRACH. During the first phase, the TPRA splits the mMTC devices into smaller groups according to a preamble selected randomly by the devices. Then, in the second phase, each group of devices is assigned with a dedicated channel to complete the random access procedure. The proposed concept allows a base station to adjust the number of dedicated channels in real-time according to the actual network load. We then present an analytical model to estimate the access success probability and the average access delay of the TPRA. Finally, we propose a simple formula to determine the optimal number of random access resources for the second phase of the proposed TPRA. Simulations are carried out to validate the analytical models and to demonstrate the benefits of the TPRA compared to competitive techniques.</description><subject>analytical model</subject><subject>Analytical models</subject><subject>Computer simulation</subject><subject>Delays</subject><subject>Dynamic scheduling</subject><subject>Electronic devices</subject><subject>massive machine-type communications</subject><subject>Mathematical models</subject><subject>Mobile communication systems</subject><subject>Performance evaluation</subject><subject>Random access</subject><subject>Real-time systems</subject><subject>Resource management</subject><subject>Wireless communication</subject><subject>Wireless communications</subject><subject>Wireless networks</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWKt3wcuC59RJsslmjmWpH1C0yIrHELOz2GqbmrQU_71bWjzNHJ53Ph7GrgWMhAC8a97rkQSBI4mgygpP2EBobbmUpT3d98pwIStzzi5yXgCIymg9YGWzi3z26TMVr37VxmUxDoFyLmYpBmq3iYoupmLaTPi4eKbNLqavfMnOOv-d6epYh-ztftLUj3z68vBUj6c8KF1tuDWtDSGg7YRFo0mU-gM1hVB6aTRqbwhLEKQ0Bh_Am_4ij1ghSa8ltmrIbg9z1yn-bClv3CJu06pf6aTsvwQwqHsKDlRIMedEnVun-dKnXyfA7d243o3bu3FHN33k5hCZE9E_bo2pQCn1BxhmXS8</recordid><startdate>201904</startdate><enddate>201904</enddate><creator>Cheng, Ray-Guang</creator><creator>Becvar, Zdenek</creator><creator>Huang, Yi-Shin</creator><creator>Bianchi, Giuseppe</creator><creator>Harwahyu, Ruki</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-3580-9128</orcidid><orcidid>https://orcid.org/0000-0003-3309-7075</orcidid><orcidid>https://orcid.org/0000-0002-6511-3546</orcidid><orcidid>https://orcid.org/0000-0001-5155-8192</orcidid></search><sort><creationdate>201904</creationdate><title>Two-Phase Random Access Procedure for LTE-A Networks</title><author>Cheng, Ray-Guang ; Becvar, Zdenek ; Huang, Yi-Shin ; Bianchi, Giuseppe ; Harwahyu, Ruki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-86d8ccc98f18965e145b95ecc4a26595a6e9401e359cac0a6655a9979e2a529d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>analytical model</topic><topic>Analytical models</topic><topic>Computer simulation</topic><topic>Delays</topic><topic>Dynamic scheduling</topic><topic>Electronic devices</topic><topic>massive machine-type communications</topic><topic>Mathematical models</topic><topic>Mobile communication systems</topic><topic>Performance evaluation</topic><topic>Random access</topic><topic>Real-time systems</topic><topic>Resource management</topic><topic>Wireless communication</topic><topic>Wireless communications</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cheng, Ray-Guang</creatorcontrib><creatorcontrib>Becvar, Zdenek</creatorcontrib><creatorcontrib>Huang, Yi-Shin</creatorcontrib><creatorcontrib>Bianchi, Giuseppe</creatorcontrib><creatorcontrib>Harwahyu, Ruki</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cheng, Ray-Guang</au><au>Becvar, Zdenek</au><au>Huang, Yi-Shin</au><au>Bianchi, Giuseppe</au><au>Harwahyu, Ruki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two-Phase Random Access Procedure for LTE-A Networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2019-04</date><risdate>2019</risdate><volume>18</volume><issue>4</issue><spage>2374</spage><epage>2387</epage><pages>2374-2387</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Simultaneous random access attempts from massive machine-type communications (mMTC) devices may severely congest a shared physical random access channel (PRACH) in mobile networks. This paper presents a novel two-phase random access (TPRA) procedure to deal with the congestion caused by mMTC devices accessing the PRACH. During the first phase, the TPRA splits the mMTC devices into smaller groups according to a preamble selected randomly by the devices. Then, in the second phase, each group of devices is assigned with a dedicated channel to complete the random access procedure. The proposed concept allows a base station to adjust the number of dedicated channels in real-time according to the actual network load. We then present an analytical model to estimate the access success probability and the average access delay of the TPRA. Finally, we propose a simple formula to determine the optimal number of random access resources for the second phase of the proposed TPRA. Simulations are carried out to validate the analytical models and to demonstrate the benefits of the TPRA compared to competitive techniques.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TWC.2019.2903479</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0003-3580-9128</orcidid><orcidid>https://orcid.org/0000-0003-3309-7075</orcidid><orcidid>https://orcid.org/0000-0002-6511-3546</orcidid><orcidid>https://orcid.org/0000-0001-5155-8192</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1536-1276
ispartof IEEE transactions on wireless communications, 2019-04, Vol.18 (4), p.2374-2387
issn 1536-1276
1558-2248
language eng
recordid cdi_crossref_primary_10_1109_TWC_2019_2903479
source IEEE Electronic Library (IEL)
subjects analytical model
Analytical models
Computer simulation
Delays
Dynamic scheduling
Electronic devices
massive machine-type communications
Mathematical models
Mobile communication systems
Performance evaluation
Random access
Real-time systems
Resource management
Wireless communication
Wireless communications
Wireless networks
title Two-Phase Random Access Procedure for LTE-A Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T06%3A19%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Two-Phase%20Random%20Access%20Procedure%20for%20LTE-A%20Networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Cheng,%20Ray-Guang&rft.date=2019-04&rft.volume=18&rft.issue=4&rft.spage=2374&rft.epage=2387&rft.pages=2374-2387&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2019.2903479&rft_dat=%3Cproquest_RIE%3E2203400695%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2203400695&rft_id=info:pmid/&rft_ieee_id=8667033&rfr_iscdi=true