• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Wireless Communications and Mobile Computing Conference >A linear programming approach to joint scheduling of real-time and non real-time services in OFDMA-based systems
【24h】

A linear programming approach to joint scheduling of real-time and non real-time services in OFDMA-based systems

机译：基于OFDMA的系统中实时和非实时服务联合调度的线性规划方法

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

摘要

As we move forward toward the fifth generation (5G) mobile communication systems, an increasing interest is devoted to heterogeneous broadband access techniques and application requirements. In this paper, we propose a linear programming formulation for the inter-class scheduling problem in OFDMA systems. Our objective is to efficiently and fairly allocate the limited system resources to both real-time and non real-time applications. Taking advantage of the medium size of this problem and the rapid growth of computational power, we find that it will be possible to use linear programming algorithms to solve it. However, because of the capacity constraint, an infeasibility may occur, which is unacceptable for this online problem. To overcome this issue, we extend the system with dummy subchannels that will accept the unsatisfied demands. Computational results show that it is possible to solve this joint scheduling problem within reasonable time for moderately and heavy loaded system.
机译：随着我们向第五代（5G）移动通信系统迈进，对异构宽带接入技术和应用需求的兴趣日益浓厚。在本文中，我们针对OFDMA系统中的类间调度问题提出了线性规划公式。我们的目标是将有限的系统资源有效且公平地分配给实时和非实时应用程序。利用此问题的中等大小和计算能力的快速增长，我们发现可以使用线性规划算法来解决该问题。但是，由于容量限制，可能会出现不可行的情况，这对于此在线问题是不可接受的。为解决此问题，我们使用伪子通道扩展了系统，这些子通道将接受未满足的需求。计算结果表明，对于中等负荷和重负荷的系统，可以在合理的时间内解决该联合调度问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号