Random access with adaptive packet aggregation in LTE/LTE-A
While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet a...
Gespeichert in:
Veröffentlicht in: | EURASIP journal on wireless communications and networking 2016-01, Vol.2016 (1), p.36-15, Article 36 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 15 |
---|---|
container_issue | 1 |
container_start_page | 36 |
container_title | EURASIP journal on wireless communications and networking |
container_volume | 2016 |
creator | Zhou, Kaijie Nikaein, Navid |
description | While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method. |
doi_str_mv | 10.1186/s13638-016-0531-6 |
format | Article |
fullrecord | <record><control><sourceid>proquest_pubme</sourceid><recordid>TN_cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_4750459</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808073751</sourcerecordid><originalsourceid>FETCH-LOGICAL-c544t-21d8b8546979ee81f7c38496442ee629882c55896c052cacf1c9c131f30f97863</originalsourceid><addsrcrecordid>eNqNkdtKAzEQhoMoHqoP4I0seOPNaibnIAhF6gEKgtTrELPZdXW7W5Ot4tub0lpUELwIkzDf_JOZH6FDwKcASpxFoIKqHIPIMaeQiw20C0LJHJjWm-u7JDtoL8ZnjCllmmyjHSJ0eii9i87vbVt008w652PM3uv-KbOFnfX1m89m1r34PrNVFXxl-7prs7rNxpPRWTr5cB9tlbaJ_mAVB-jhajS5vMnHd9e3l8Nx7jhjfU6gUI-KM6Gl9l5BKR1VTAvGiPeCaKWI41xp4TAnzroSnHZAoaS41FIJOkAXS93Z_HHqC-fbPtjGzEI9teHDdLY2PzNt_WSq7s0wyTHjOgmcrARC9zr3sTfTOjrfNLb13TwaUEQIrrj4D4oVllRySOjxL_S5m4c2bcKAFCStmkqSKFhSLnQxBl-u_w3YLFw0SxdNctEsXDSLgY--D7yu-LItAWQJxJRqKx--tf5T9RPloKTd</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1762349372</pqid></control><display><type>article</type><title>Random access with adaptive packet aggregation in LTE/LTE-A</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Springer Nature - Complete Springer Journals</source><source>Springer Nature OA/Free Journals</source><creator>Zhou, Kaijie ; Nikaein, Navid</creator><creatorcontrib>Zhou, Kaijie ; Nikaein, Navid</creatorcontrib><description>While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.</description><identifier>ISSN: 1687-1472</identifier><identifier>ISSN: 1687-1499</identifier><identifier>EISSN: 1687-1499</identifier><identifier>DOI: 10.1186/s13638-016-0531-6</identifier><identifier>PMID: 26900389</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Agglomeration ; Channels ; Collision rates ; Communications Engineering ; Devices ; Engineering ; Evolution of Radio Access Network Technologies towards 5G ; Information Systems Applications (incl.Internet) ; Mathematical models ; Networks ; Packet transmission ; Random access ; Signal,Image and Speech Processing ; Wireless communication</subject><ispartof>EURASIP journal on wireless communications and networking, 2016-01, Vol.2016 (1), p.36-15, Article 36</ispartof><rights>Zhou and Nikaein. 2016</rights><rights>The Author(s) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c544t-21d8b8546979ee81f7c38496442ee629882c55896c052cacf1c9c131f30f97863</citedby><cites>FETCH-LOGICAL-c544t-21d8b8546979ee81f7c38496442ee629882c55896c052cacf1c9c131f30f97863</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1186/s13638-016-0531-6$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1186/s13638-016-0531-6$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>230,314,778,782,862,883,27911,27912,41107,41475,42176,42544,51306,51563</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/26900389$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Zhou, Kaijie</creatorcontrib><creatorcontrib>Nikaein, Navid</creatorcontrib><title>Random access with adaptive packet aggregation in LTE/LTE-A</title><title>EURASIP journal on wireless communications and networking</title><addtitle>J Wireless Com Network</addtitle><addtitle>EURASIP J Wirel Commun Netw</addtitle><description>While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.</description><subject>Agglomeration</subject><subject>Channels</subject><subject>Collision rates</subject><subject>Communications Engineering</subject><subject>Devices</subject><subject>Engineering</subject><subject>Evolution of Radio Access Network Technologies towards 5G</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Packet transmission</subject><subject>Random access</subject><subject>Signal,Image and Speech Processing</subject><subject>Wireless communication</subject><issn>1687-1472</issn><issn>1687-1499</issn><issn>1687-1499</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqNkdtKAzEQhoMoHqoP4I0seOPNaibnIAhF6gEKgtTrELPZdXW7W5Ot4tub0lpUELwIkzDf_JOZH6FDwKcASpxFoIKqHIPIMaeQiw20C0LJHJjWm-u7JDtoL8ZnjCllmmyjHSJ0eii9i87vbVt008w652PM3uv-KbOFnfX1m89m1r34PrNVFXxl-7prs7rNxpPRWTr5cB9tlbaJ_mAVB-jhajS5vMnHd9e3l8Nx7jhjfU6gUI-KM6Gl9l5BKR1VTAvGiPeCaKWI41xp4TAnzroSnHZAoaS41FIJOkAXS93Z_HHqC-fbPtjGzEI9teHDdLY2PzNt_WSq7s0wyTHjOgmcrARC9zr3sTfTOjrfNLb13TwaUEQIrrj4D4oVllRySOjxL_S5m4c2bcKAFCStmkqSKFhSLnQxBl-u_w3YLFw0SxdNctEsXDSLgY--D7yu-LItAWQJxJRqKx--tf5T9RPloKTd</recordid><startdate>20160101</startdate><enddate>20160101</enddate><creator>Zhou, Kaijie</creator><creator>Nikaein, Navid</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>7X8</scope><scope>5PM</scope></search><sort><creationdate>20160101</creationdate><title>Random access with adaptive packet aggregation in LTE/LTE-A</title><author>Zhou, Kaijie ; Nikaein, Navid</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c544t-21d8b8546979ee81f7c38496442ee629882c55896c052cacf1c9c131f30f97863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Agglomeration</topic><topic>Channels</topic><topic>Collision rates</topic><topic>Communications Engineering</topic><topic>Devices</topic><topic>Engineering</topic><topic>Evolution of Radio Access Network Technologies towards 5G</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Packet transmission</topic><topic>Random access</topic><topic>Signal,Image and Speech Processing</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Kaijie</creatorcontrib><creatorcontrib>Nikaein, Navid</creatorcontrib><collection>Springer Nature OA/Free Journals</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><jtitle>EURASIP journal on wireless communications and networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Kaijie</au><au>Nikaein, Navid</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Random access with adaptive packet aggregation in LTE/LTE-A</atitle><jtitle>EURASIP journal on wireless communications and networking</jtitle><stitle>J Wireless Com Network</stitle><addtitle>EURASIP J Wirel Commun Netw</addtitle><date>2016-01-01</date><risdate>2016</risdate><volume>2016</volume><issue>1</issue><spage>36</spage><epage>15</epage><pages>36-15</pages><artnum>36</artnum><issn>1687-1472</issn><issn>1687-1499</issn><eissn>1687-1499</eissn><abstract>While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><pmid>26900389</pmid><doi>10.1186/s13638-016-0531-6</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1687-1472 |
ispartof | EURASIP journal on wireless communications and networking, 2016-01, Vol.2016 (1), p.36-15, Article 36 |
issn | 1687-1472 1687-1499 1687-1499 |
language | eng |
recordid | cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_4750459 |
source | DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Springer Nature - Complete Springer Journals; Springer Nature OA/Free Journals |
subjects | Agglomeration Channels Collision rates Communications Engineering Devices Engineering Evolution of Radio Access Network Technologies towards 5G Information Systems Applications (incl.Internet) Mathematical models Networks Packet transmission Random access Signal,Image and Speech Processing Wireless communication |
title | Random access with adaptive packet aggregation in LTE/LTE-A |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T18%3A33%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pubme&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Random%20access%20with%20adaptive%20packet%20aggregation%20in%20LTE/LTE-A&rft.jtitle=EURASIP%20journal%20on%20wireless%20communications%20and%20networking&rft.au=Zhou,%20Kaijie&rft.date=2016-01-01&rft.volume=2016&rft.issue=1&rft.spage=36&rft.epage=15&rft.pages=36-15&rft.artnum=36&rft.issn=1687-1472&rft.eissn=1687-1499&rft_id=info:doi/10.1186/s13638-016-0531-6&rft_dat=%3Cproquest_pubme%3E1808073751%3C/proquest_pubme%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1762349372&rft_id=info:pmid/26900389&rfr_iscdi=true |