Energy-aware and spectrum-efficient massive random access mechanism for ultra-reliable low latency communications

IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Nahid Mohammadi, Behrouz Shahgholi Ghahfarokhi, Mohammad Reza Khayyambashi, Naser Movahedinia
{"title":"Energy-aware and spectrum-efficient massive random access mechanism for ultra-reliable low latency communications","authors":"Nahid Mohammadi,&nbsp;Behrouz Shahgholi Ghahfarokhi,&nbsp;Mohammad Reza Khayyambashi,&nbsp;Naser Movahedinia","doi":"10.1016/j.phycom.2024.102478","DOIUrl":null,"url":null,"abstract":"<div><p>With the growing demand for Internet of Things (IoT) applications, supporting massive access to the media is a necessary requirement in 5G cellular networks. Accommodating the stringent requirements of Ultra-Reliable Low Latency Communications (URLLC) is a challenge in massive access to the medium. The random-access procedure is of the most challenging issues in massive IoT (mIoT) networks with URLL requirements as a high number of channel access requests result in high channel access latency or low reliability. In previous works, some solutions have been proposed to solve this challenge including grant-free access, priority-based access, and grouping nodes to restrict random access requests to groups’ leaders. Particularly, previous idea that is based on grouping, clusters the devices with similar reaction against an event to a group, which is not always applicable for various IoT applications. This research proposes a novel device grouping to improve the random-access procedure of mIoT devices with URLLC requirements. In the proposed method, device grouping is accomplished based on the analysis of devices’ traffic. A similarity index is used to obtain the similarity of time series made from historical traffic patterns of devices and then, an innovative algorithm is proposed to group the devices based on this index. Grouping devices based on similar traffic patterns, provides access to the media with less complexity and more efficiency for a large number of devices. Performance of the proposed approach is evaluated using simulations and real traffic dataset. The evaluation results show higher suitability of proposed method compared to the baseline mechanism of LTE and the previous method in terms of access failures (which affects delay and reliability) and energy consumption. For a usual setting, the channel access failure decreases by about 94 % compared to the previous method and by 0.88 % compared to LTE. The energy consumption also improves by about 1.8 % compared to LTE and by 1.2 % compared to previous method. Moreover, the results show that the proposed method is appropriate for IoT applications with regular traffic patterns.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"66 ","pages":"Article 102478"},"PeriodicalIF":2.0000,"publicationDate":"2024-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Communication","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874490724001964","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

With the growing demand for Internet of Things (IoT) applications, supporting massive access to the media is a necessary requirement in 5G cellular networks. Accommodating the stringent requirements of Ultra-Reliable Low Latency Communications (URLLC) is a challenge in massive access to the medium. The random-access procedure is of the most challenging issues in massive IoT (mIoT) networks with URLL requirements as a high number of channel access requests result in high channel access latency or low reliability. In previous works, some solutions have been proposed to solve this challenge including grant-free access, priority-based access, and grouping nodes to restrict random access requests to groups’ leaders. Particularly, previous idea that is based on grouping, clusters the devices with similar reaction against an event to a group, which is not always applicable for various IoT applications. This research proposes a novel device grouping to improve the random-access procedure of mIoT devices with URLLC requirements. In the proposed method, device grouping is accomplished based on the analysis of devices’ traffic. A similarity index is used to obtain the similarity of time series made from historical traffic patterns of devices and then, an innovative algorithm is proposed to group the devices based on this index. Grouping devices based on similar traffic patterns, provides access to the media with less complexity and more efficiency for a large number of devices. Performance of the proposed approach is evaluated using simulations and real traffic dataset. The evaluation results show higher suitability of proposed method compared to the baseline mechanism of LTE and the previous method in terms of access failures (which affects delay and reliability) and energy consumption. For a usual setting, the channel access failure decreases by about 94 % compared to the previous method and by 0.88 % compared to LTE. The energy consumption also improves by about 1.8 % compared to LTE and by 1.2 % compared to previous method. Moreover, the results show that the proposed method is appropriate for IoT applications with regular traffic patterns.

用于超可靠低延迟通信的能量感知和频谱高效大规模随机接入机制
随着物联网(IoT)应用需求的不断增长,支持海量媒体接入是 5G 蜂窝网络的必要条件。如何满足超可靠低延迟通信(URLLC)的严格要求是大规模接入介质的一个挑战。在有 URLL 要求的大规模物联网(mIoT)网络中,随机接入程序是最具挑战性的问题,因为大量信道接入请求会导致高信道接入延迟或低可靠性。在以前的工作中,已经提出了一些解决方案来解决这一难题,包括免授权访问、基于优先级的访问以及将节点分组以限制组长的随机访问请求。特别是以前基于分组的想法,会将对事件有相似反应的设备聚为一组,这并不总是适用于各种物联网应用。本研究提出了一种新颖的设备分组方法,以改进具有 URLLC 要求的移动物联网设备的随机访问程序。在所提出的方法中,设备分组是基于对设备流量的分析来完成的。利用相似性指数来获取设备历史流量模式时间序列的相似性,然后根据该指数提出一种创新算法来对设备进行分组。根据相似的流量模式对设备进行分组,可使大量设备以更低的复杂度和更高的效率访问媒体。通过模拟和真实流量数据集对所提方法的性能进行了评估。评估结果表明,与 LTE 基线机制和以前的方法相比,建议的方法在接入失败(影响延迟和可靠性)和能耗方面更合适。在通常情况下,信道接入失败率比以前的方法降低了约 94%,比 LTE 降低了 0.88%。与 LTE 相比,能耗也降低了约 1.8%,与之前的方法相比降低了 1.2%。此外,研究结果表明,所提出的方法适用于具有常规流量模式的物联网应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Physical Communication
Physical Communication ENGINEERING, ELECTRICAL & ELECTRONICTELECO-TELECOMMUNICATIONS
CiteScore
5.00
自引率
9.10%
发文量
212
审稿时长
55 days
期刊介绍: PHYCOM: Physical Communication is an international and archival journal providing complete coverage of all topics of interest to those involved in all aspects of physical layer communications. Theoretical research contributions presenting new techniques, concepts or analyses, applied contributions reporting on experiences and experiments, and tutorials are published. Topics of interest include but are not limited to: Physical layer issues of Wireless Local Area Networks, WiMAX, Wireless Mesh Networks, Sensor and Ad Hoc Networks, PCS Systems; Radio access protocols and algorithms for the physical layer; Spread Spectrum Communications; Channel Modeling; Detection and Estimation; Modulation and Coding; Multiplexing and Carrier Techniques; Broadband Wireless Communications; Wireless Personal Communications; Multi-user Detection; Signal Separation and Interference rejection: Multimedia Communications over Wireless; DSP Applications to Wireless Systems; Experimental and Prototype Results; Multiple Access Techniques; Space-time Processing; Synchronization Techniques; Error Control Techniques; Cryptography; Software Radios; Tracking; Resource Allocation and Inference Management; Multi-rate and Multi-carrier Communications; Cross layer Design and Optimization; Propagation and Channel Characterization; OFDM Systems; MIMO Systems; Ultra-Wideband Communications; Cognitive Radio System Architectures; Platforms and Hardware Implementations for the Support of Cognitive, Radio Systems; Cognitive Radio Resource Management and Dynamic Spectrum Sharing.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信