To random access or schedule? Optimum 3GPP licensed-assisted access for machine-to-machine communications

Shao-Yu Lien, Yueh Jir Wang
{"title":"To random access or schedule? Optimum 3GPP licensed-assisted access for machine-to-machine communications","authors":"Shao-Yu Lien, Yueh Jir Wang","doi":"10.4108/EAI.19-8-2015.2260365","DOIUrl":null,"url":null,"abstract":"To support various Internet-of-Thing (IoT) applications involving an enormous number of machine-type devices, deploying LTE/LTE-A networks on ISM bands with an extensive bandwidth has been regarded as a promising solution to enable machine-to-machine (M2M) communications. Designating as licensed-assisted access (LAA) in 3GPP Rel-13, unprecedented challenge of uncontrollable interference from collocated WiFi networks, however, obstructs the state-of-the-art scheduling based radio resource access in LTE/LTE-A. To practice LAA, in this paper, we shall derive the optimum radio access scheme for the urgent needs of 3GPP Rel-13 standardization. Observing the LAA-WiFi hidden terminal problem, we analytically derive the optimum number of LAA users randomly accessing a pool of radio resources and the optimum condition for random access, to reach a superior throughput of a LAA network as compared with that of a scheduling based scheme. Our analytic results demonstrate that the conventional scheduling based scheme in LTE/LTE-A may not always be optimal, and thus our proposition leads to the optimum radio access design for LAA networks.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/EAI.19-8-2015.2260365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

To support various Internet-of-Thing (IoT) applications involving an enormous number of machine-type devices, deploying LTE/LTE-A networks on ISM bands with an extensive bandwidth has been regarded as a promising solution to enable machine-to-machine (M2M) communications. Designating as licensed-assisted access (LAA) in 3GPP Rel-13, unprecedented challenge of uncontrollable interference from collocated WiFi networks, however, obstructs the state-of-the-art scheduling based radio resource access in LTE/LTE-A. To practice LAA, in this paper, we shall derive the optimum radio access scheme for the urgent needs of 3GPP Rel-13 standardization. Observing the LAA-WiFi hidden terminal problem, we analytically derive the optimum number of LAA users randomly accessing a pool of radio resources and the optimum condition for random access, to reach a superior throughput of a LAA network as compared with that of a scheduling based scheme. Our analytic results demonstrate that the conventional scheduling based scheme in LTE/LTE-A may not always be optimal, and thus our proposition leads to the optimum radio access design for LAA networks.
随机访问还是安排访问?机器对机器通信的最佳3GPP许可辅助接入
为了支持涉及大量机器类型设备的各种物联网(IoT)应用,在具有广泛带宽的ISM频段上部署LTE/LTE- a网络已被视为实现机器对机器(M2M)通信的有前途的解决方案。在3GPP Rel-13中指定许可辅助接入(LAA),然而,来自并配WiFi网络的不可控干扰的前所未有的挑战阻碍了LTE/LTE- a中最先进的基于调度的无线电资源接入。为了实现LAA,本文将根据3GPP Rel-13标准化的迫切需要,推导出最优的无线接入方案。针对LAA- wifi隐藏终端问题,分析推导出随机访问某一无线资源池的LAA用户的最优数量和随机访问的最优条件,从而使LAA网络的吞吐量优于基于调度的方案。我们的分析结果表明,传统的基于调度的LTE/LTE- a方案可能并不总是最优的,因此我们的命题导致了LAA网络的最佳无线接入设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信