首页> 外文期刊>IEEE communications letters >A New Contention-Based PUSCH Resource Allocation in 5G NR for mMTC Scenarios
【24h】

A New Contention-Based PUSCH Resource Allocation in 5G NR for mMTC Scenarios

机译:用于MMTC场景的5G NR中的基于争用的PUSCH资源分配

获取原文
获取原文并翻译 | 示例
           

摘要

This letter addresses the uplink radio resource allocation problem in a 5G massive Machine Type Communication (mMTC) scenario, where a large number of MTC devices generate small-sized packets. The current cellular networks are unsuitable for this scenario, due to the limited resources allocated to the Physical Random Access Channel (PRACH) and to the Physical Uplink Shared Channel (PUSCH). To overcome this issue, instead of improving the succeeded access attempts in the PRACH, as widely addressed in literature, we focus on the PUSCH. We present the innovative idea to exploit the unused PUSCH resources to serve also the MTC devices that have failed their access attempt, by assigning them a pool of resources, in a contention-based mode. The simulation results show that the proposed PUSCH Resource Reallocation Algorithm improves significantly any static and dynamic system performance in terms of number of succeeded communications, at the cost a negligible increment of energy consumption.
机译:这封信在5G大型机器类型通信(MMTC)场景中地址上行链路无线电资源分配问题,其中大量MTC设备生成小型数据包。由于分配给物理随机接入信道(PRACH)和物理上行链路共享信道(PUSCH)的资源有限,当前蜂窝网络不适合这种情况。为了克服这个问题,而不是改善PRACH中的成功访问尝试,而是在文献中广泛寻求的,我们专注于佩斯。我们提出了创新的想法,以利用未使用的PUSCH资源,该资源也通过在基于竞争的模式下分配了一种资源池来消除失败的MTC设备。仿真结果表明,在成功的通信数量的数量下,所提出的PUSCH资源重新分配算法可提高任何静态和动态系统性能,其能耗可忽略不计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号