TY - GEN
T1 - Power control and scheduling under hard deadline constraints for on-off fading channels
AU - Ewaisha, Ahmed
AU - Tepedelenlioglu, Cihan
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/5/10
Y1 - 2017/5/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85020074866&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85020074866&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2017.7925933
DO - 10.1109/WCNC.2017.7925933
M3 - Conference contribution
AN - SCOPUS:85020074866
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2017 IEEE Wireless Communications and Networking Conference, WCNC 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Wireless Communications and Networking Conference, WCNC 2017
Y2 - 19 March 2017 through 22 March 2017
ER -