首页> 外文会议>IEEE International Conference on Communications Workshops >Opportunistic Multicast Scheduling With Resource Fairness Constraints in Cellular Networks
【24h】

Opportunistic Multicast Scheduling With Resource Fairness Constraints in Cellular Networks

机译:蜂窝网络中资源公平约束的机会多播调度

获取原文
获取外文期刊封面目录资料

摘要

Multicast is emerging as an important means of transmitting the same content to multiple receivers so as to efficiently utilize the overall network resources. We propose an opportunistic multicast scheduling algorithm that exploits time-varying channel conditions in time division multiplexing (TDM) cellular networks and maximizes the overall network throughput under certain resource fairness constraints among all groups in the system. The optimum transmission rate for each group is selected by taking into account the current channel conditions and average received throughput of each user to achieve the best tradeoff between throughput and fairness. We then prove the optimality of the multicast scheduling algorithm and show that our algorithm does not deteriorate any group's performance to improve the overall network throughput compared with the non-opportunistic scheduling algorithm. Through extensive simulations we demonstrate that the proposed opportunistic multicast scheduling algorithm improves network resource efficiency under fairness constraints.
机译:多播是作为将相同内容发送到多个接收器的重要手段,以便有效地利用整体网络资源。我们提出了一种机会多播调度算法,其利用时分复用(TDM)蜂窝网络中的时变信道条件,并在系统中所有组之间的某些资源公平约束下最大化整体网络吞吐量。通过考虑到当前信道条件和每个用户的平均吞吐量来选择每个组的最佳传输速率,以实现吞吐量和公平性之间的最佳权衡。然后,我们证明了多播调度算法的最优性,并表明我们的算法与非机会调度算法相比,我们的算法不会降低任何组的性能来提高整体网络吞吐量。通过广泛的模拟,我们证明所提出的机会多播调度算法在公平约束下提高了网络资源效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号