首页> 外文期刊>Wireless Communications, IEEE Transactions on >Optimal Access Class Barring for Stationary Machine Type Communication Devices With Timing Advance Information
【24h】

Optimal Access Class Barring for Stationary Machine Type Communication Devices With Timing Advance Information

机译:具有定时提前信息的固定式机器通信设备的最佳访问等级限制

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The current wireless cellular networks can be used to provide machine-to-machine (M2M) communication services. However, the Long Term Evolution (LTE) networks, which are designed for human users, may not be able to handle a large number of bursty random access requests from machine-type communication (MTC) devices. In this paper, we propose a scheme that uses both access class barring (ACB) and timing advance information to prevent random access overload in M2M systems. We formulate an optimization problem to determine the optimal ACB parameter, which maximizes the expected number of MTC devices successfully served in each random access slot. Hence, the number of random access slots required to serve all MTC devices can be minimized. To reduce the computational complexity and improve the practicability of the proposed scheme, we propose a closed-form approximate solution to the optimization problem and present an algorithm to estimate the number of active MTC devices requiring access in each random access slot. The correctness of the analytical model and the accuracy of the estimation algorithm are validated via simulations. Results show that both numerical and approximate solutions provide the same performance. Our proposed scheme can reduce nearly half of the random access slots required to serve all MTC devices compared to the existing schemes, which use timing advance information only, ACB only, or cooperative ACB.
机译:当前的无线蜂窝网络可用于提供机器对机器(M2M)通信服务。但是,专为人类用户设计的长期演进(LTE)网络可能无法处理来自机器类型通信(MTC)设备的大量突发随机访问请求。在本文中,我们提出了一种使用访问类别限制(ACB)和时序提前信息来防止M2M系统中随机访问过载的方案。我们提出了一个优化问题,以确定最佳的ACB参数,该参数将最大化每个随机接入时隙中成功服务的MTC设备的预期数量。因此,可以最小化服务所有MTC设备所需的随机接入时隙的数量。为了降低计算复杂度并提高所提出方案的实用性,我们针对优化问题提出了一种封闭形式的近似解决方案,并提出了一种算法来估计每个随机接入时隙中需要接入的活动MTC设备的数量。通过仿真验证了分析模型的正确性和估计算法的准确性。结果表明,数值解和近似解都提供相同的性能。与仅使用定时提前信息,仅使用ACB或协作式ACB的现有方案相比,我们提出的方案可以减少服务所有MTC设备所需的随机接入时隙的近一半。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号