首页> 外文会议>IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications >Enhancing cellular M2M random access with binary countdown contention resolution
【24h】

Enhancing cellular M2M random access with binary countdown contention resolution

机译:通过二进制倒计时争用解决方案增强蜂窝M2M随机访问

获取原文

摘要

Accommodating Machine-to-Machine applications and their requirements is one of the challenges on the way from LTE towards 5G networks. The envisioned high density of devices, alongside with their sporadic and synchronized transmission patterns, might create signaling storms and overload in the current LTE network. Here, we address the notorious random access (RA) challenge, namely, scalability of the radio link connection establishment protocol in LTE networks. We revisit the binary countdown technique for contention resolution (BCCR), and apply it to the LTE RA procedure. We analytically investigate the performance gains and trade-offs of applying BCCR in LTE. We further simulatively compare BCCR RA with the state-of-the-art RA techniques, and demonstrate its advantages in terms of delay and throughput.
机译:适应机器对机器的应用及其要求是从LTE到5G网络的挑战之一。所设想的高密度设备以及它们的零星和同步传输模式,可能会在当前LTE网络中造成信令风暴和过载。在这里,我们解决了臭名昭著的随机访问(RA)挑战,即LTE网络中无线链路连接建立协议的可伸缩性。我们将重新审视用于竞争解决(BCCR)的二进制倒计时技术,并将其应用于LTE RA程序。我们分析性地研究了在LTE中应用BCCR的性能增益和取舍。我们进一步将BCCR RA与最新的RA技术进行了模拟比较,并展示了其在延迟和吞吐量方面的优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号