北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (2): 132-135.doi: 10.13190/jbupt.200702.132.suiyf

• 研究报告 • 上一篇    

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

隋延峰, 杨鸿文, 杨大成   

  1. (北京邮电大学 电信工程学院, 北京 100876)
  • 收稿日期:2005-01-06 修回日期:1900-01-01 出版日期:2007-04-30 发布日期:2007-04-30
  • 通讯作者: 隋延峰

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

SUI Yan-feng, YANG Hong-wen, YANG Da-cheng   

  1. (School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2005-01-06 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: SUI Yan-feng

摘要:

针对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 interferencescheduler. 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 .

Key words: proportional fairness, max carrier to interference scheduling algorithm, multiuser diversity

中图分类号: