• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFIP TC6 International Conference on Personal Wireless Communications(PWC 2004); 20040921-23; Delft(NL) >Network-Level Simulation Results of Fair Channel-Dependent Scheduling in Enhanced UMTS
【24h】

Network-Level Simulation Results of Fair Channel-Dependent Scheduling in Enhanced UMTS

机译：增强型UMTS中基于公平信道的调度的网络级仿真结果

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, previously performed UMTS studies have been extended to enhanced UMTS, and combined with several scheduling algorithms (ref. [1,2]). Scheduling algorithms for W-CDMA systems ranging from C/I based scheduling to Round-Robin scheduling are presented and discussed. We also include a trade-off between these two extreme methods of scheduling: Fair channel-dependent scheduling. All these scheduling algorithms have been implemented in a network simulator in ns-2, employing input trace files of SNRs, modeled from link-level simulation results. The network-level simulation results indeed display that the advantages of both extremes in scheduling algorithms have been combined in the new algorithm: a good fairness, comparable to that of Round-Robin scheduling, together with an efficient use of resources, as seen in C/I based scheduling.
机译：在本文中，先前执行的UMTS研究已扩展到增强的UMTS，并与几种调度算法结合（参考文献[1,2]）。提出并讨论了W-CDMA系统的调度算法，范围从基于C / I的调度到循环调度。我们还包括以下两种极端的调度方法之间的权衡：公平的通道相关调度。所有这些调度算法均已在ns-2的网络仿真器中实现，采用了从链路级仿真结果建模的SNR输入轨迹文件。网络级的仿真结果确实表明，调度算法中的两种极端情况的优点已在新算法中得到了结合：一种良好的公平性（可与Round-Robin调度相媲美）以及对资源的有效利用，如C基于/ I的调度。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号