首页> 外文期刊>Wireless personal communications: An Internaional Journal >A Near Optimal Scheduling Algorithm for Efficient Radio Resource Management in Multi-user MIMO Systems
【24h】

A Near Optimal Scheduling Algorithm for Efficient Radio Resource Management in Multi-user MIMO Systems

机译:多用户MIMO系统中有效无线电资源管理的近优化调度算法

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

摘要

Multiple input multiple output (MIMO) systems have high potential to achieve maximum channel capacity in wireless communication systems. Multi-user (MU) MIMO network with transmit antennas Tx at base station can schedule as many single antenna users in one time slot. This necessitates incorporation of a user scheduling strategy. Maximizing sumrate performance without under utilization of channel resources is a primary objective of such scheduling algorithms. Another key design factor for such techniques is to optimize fairness i.e. allowing equal opportunity to all communicating entities. In this paper, we present a simple approach to solve the scheduling problem in MU-MIMO systems while addressing the conflicting objectives of sumrate and fairness. Two variants of the proposed method are also discussed that provide options for maximizing the cumulative sumrate and improving the fairness. Simulations validate the proposed algorithm as a better choice over other conventional methods as it achieves optimal performance with relatively less computational complexity and without compromising fairness. Fairness results are verified by average sumrate method and Jain's Fariness Index.
机译:多输入多输出(MIMO)系统具有高潜力,以实现无线通信系统中的最大信道容量。具有在基站的传输天线Tx的多用户(MU)MIMO网络可以在一次时隙中安排多个天线用户。这需要纳入用户调度策略。在不利用信道资源的情况下最大化SUMRATE性能是此类调度算法的主要目标。这种技术的另一个关键设计因素是优化公平性I.。允许所有沟通实体的机会。在本文中,我们展示了一种简单的方法来解决MU-MIMO系统中的调度问题,同时解决SUMRATE和公平性的矛盾。还讨论了所提出的方法的两种变体,其提供了用于最大化累积苏格兰和改善公平性的选择。仿真验证所提出的算法作为其他传统方法的更好选择,因为它实现了具有相对较少的计算复杂性和不影响公平性的最佳性能。公平结果是通过平均萨姆拉特方法和耆那教的令人情愿指数来验证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号