节点文献

采用实时公平监测的改进最大C/I调度算法

Enhanced Max-C/I Scheduling Algorithm with Real-Time Fairness Monitoring

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 隋延峰; 杨鸿文; 杨大成;

【Author】 SUI Yan-feng,YANG Hong-wen,YANG Da-cheng (School of Telecommunication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China)

【机构】 北京邮电大学电信工程学院; 北京邮电大学电信工程学院 北京100876; 北京100876;

【摘要】 针对cdma2000前向分组调度提出了一种新的调度算法.传统的正比公平算法通过一个公平指数α控制公平度,但受许多实际因素的制约,优化此指数有困难.新算法在最大载干比(C/I)调度算法基础上,通过实时监控公平度达到既保证正比公平,又能最大化吞吐量的目的.仿真结果表明,新算法的吞吐量与经优化后的传统算法相当.

【Abstract】 A scheduling algorithm is proposed for cdma2000 forward packet scheduling.In the conventional proportional fairness algorithm,fairness objective is achieved through the fairness exponent α.α is difficult to be optimized for the optimal value depends on many practical factors.In the proposed algorithm,the fairness objective is achieved by monitoring the real-time fairness of the maximum carrier to interference scheduler.Hence we may achieve the maximal throughput while keeping the fairness criterion not violated.Simulation results indicate that the proposed algorithm has a similar system throughput to the conventional proportional fairness algorithm with optimized fairness exponent α.

  • 【文献出处】 北京邮电大学学报 ,Journal of Beijing University of Posts and Telecommunications , 编辑部邮箱 ,2007年02期
  • 【分类号】TN929.5
  • 【被引频次】13
  • 【下载频次】148
节点文献中: 

本文链接的文献网络图示:

本文的引文网络