• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Communication Technology >Uplink scheduling and power allocation with M2M/H2H co-existence in LTE-A cellular networks
【24h】

Uplink scheduling and power allocation with M2M/H2H co-existence in LTE-A cellular networks

机译：LTE-A蜂窝网络中M2M / H2H共存的上行链路调度和功率分配

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the development of radio technology, more and more devices connect to the radio cellular network. Since the radio resource is limited, how to provide effective resources allocation scheme is proved to be a challenge. Long Time Evolution-Advance (LTE-A) becomes an important candidate for its' universal connectivity and ubiquitous coverage in M2M/H2H co-existence communication. In this paper, we first formulate the uplink resources allocation problem into the sum-throughput optimization problem, then introduce the Lagrange dual function of original problem, decompose it into sub-problem and solve the sub-problem independently for each RB. Finally, we use the Ellipsoid method to update Lagrange dual multiplier and obtain the near-optimal resources allocation solution. We also give the simulation results of the proposed algorithm, and the results of Lagrange dual algorithm are better than greedy algorithm and more close to optimal solution.
机译：随着无线电技术的发展，越来越多的设备连接到无线电蜂窝网络。由于无线电资源有限，因此如何提供有效的资源分配方案被证明是一个挑战。长期演进高级（LTE-A）成为其M2M / H2H共存通信中的通用连接性和无处不在的覆盖范围的重要候选者。在本文中，我们首先将上行资源分配问题表述为和吞吐量优化问题，然后引入原始问题的拉格朗日对偶函数，将其分解为子问题，并针对每个RB独立解决子问题。最后，我们使用Ellipsoid方法更新Lagrange对偶乘子，并获得接近最优的资源分配解决方案。我们还给出了该算法的仿真结果，Lagrange对偶算法的结果优于贪婪算法，更接近最优解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号