# Optimal Power Control and Scheduling under Hard Deadline Constraints for Continuous Fading Channels

## TL;DR

This paper introduces a joint scheduling and power allocation algorithm for downlink cellular systems with real-time and non-real-time users, ensuring hard deadline constraints and queue stability under average power limits.

## Contribution

It presents a novel sum-rate-maximizing algorithm with a closed-form power allocation policy that satisfies real-time deadlines and queue stability, outperforming existing methods.

## Key findings

- Algorithm achieves near-linear complexity in RT users
- Power policies differ structurally between RT and NRT users
- Proposed method outperforms existing approaches in simulations

## Abstract

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.