Power Control and Scheduling under Hard Deadline Constraints for On-Off Fading Channels
Power Control and Scheduling under Hard Deadline Constraints for On-Off Fading Channels
复制标题
开关衰落信道硬期限约束下的功率控制和调度
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
C. Tepedelenlioğlu
中科院分区：
文献类型：
--
作者：
Ahmed E. Ewaisha;C. Tepedelenlioğlu
我们考虑下行链路蜂窝系统的联合调度和功率分配问题。该系统由两组用户组成：真实的-时间（RT）和非真实的-时间（NRT）用户。给定基站上的一些平均功率约束，问题是找到满足RT和NRT服务质量（QoS）约束的算法。RT QoS约束保证RT分组中错过其最后期限的部分不超过预先指定的阈值。另一方面，NRT的QoS只是为了保证队列的稳定性。我们提出了一个总和速率最大化算法，满足所有的QoS和平均功率约束。所提出的功率分配策略具有两组用户的封闭形式的表达式。然而，RT用户的功率策略在结构上不同于NRT用户。所提出的算法是最佳的开关信道模型与多项式时间调度复杂度。使用广泛的模拟，所提出的算法的吞吐量超过现有的方法。
We consider the 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 some average power constraint on the base station, the problem is to find an algorithm that satisfies the RT and NRT quality-of-service (QoS) constraints. The RT QoS constraints guarantee the portion of RT packets that miss their deadline are no more than a pre-specified threshold. On the other hand, the NRT QoS is only to guarantee the stability of their queues. We propose a sum-rate- maximizing algorithm that satisfy all QoS and average power constraints. The proposed power allocation policy has a closed form expression for the two groups of users. However, the power policy of the RT users differ in structure from the NRT users. The proposed algorithm is optimal for the on-off channel model with a polynomial-time scheduling complexity. Using extensive simulations, the throughput of the proposed algorithm is shown to exceed existing approaches.