• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Asilomar Conference on Signals, Systems and Computers >Optimal power control and scheduling under hard deadline constraints for continuous fading channels
【24h】

Optimal power control and scheduling under hard deadline constraints for continuous fading channels

机译：硬截止期限约束下的连续衰落信道的最优功率控制和调度

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

摘要

We consider a joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given an average power constraint on the base station, the problem is to find an algorithm that satisfies the RT hard deadline constraint and NRT queue stability constraint. We propose a sum-rate-maximizing algorithm that satisfies these constraints. We also show, through simulations, that the proposed algorithm has an average complexity that is close-to-linear in the number of RT users. The power allocation policy in the proposed algorithm has a closed-form expression for the two groups of users. However, interestingly, the power policy of the RT users differ in structure from that of the NRT users. We also show the superiority of the proposed algorithms over existing approaches using extensive simulations.
机译：我们考虑下行蜂窝系统的联合调度和功率分配问题。该系统由两组用户组成：实时（RT）用户和非实时（NRT）用户。给定基站上的平均功率约束，问题在于找到一种满足RT硬期限约束和NRT队列稳定性约束的算法。我们提出一种满足这些约束的求和率最大化算法。通过仿真，我们还表明，所提出的算法在RT用户数量上具有接近线性的平均复杂度。所提出的算法中的功率分配策略具有针对两组用户的闭式表达式。但是，有趣的是，RT用户的电源策略在结构上与NRT用户不同。我们还展示了所提出的算法相对于使用广泛仿真的现有方法的优越性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号