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 two sum-rate-maximizing algorithms that satisfy these constraints as well as achieving the system's capacity region. In both algorithms, the power allocation policy has a closed-form expression for the two groups of users. However, interestingly, the power policy of the RT users, that we call the Lambert-power policy, differs in structure from the water-filling policy for the NRT users. The first algorithm is optimal for the on-off channel model with a polynomial-time scheduling complexity in the number of RT users. The second, on the other hand, works for any channel fading model which is shown, through simulations, to have an average complexity that is close-to-linear. We also show the superiority of the proposed algorithms over existing approaches using extensive simulations.

Original languageEnglish (US)
JournalIEEE Transactions on Vehicular Technology
DOIs
StateAccepted/In press - Nov 13 2017

Keywords

  • Channel models
  • Complexity theory
  • Downlink
  • Fading channels
  • Real-time systems
  • Resource management
  • Throughput

ASJC Scopus subject areas

  • Automotive Engineering
  • Aerospace Engineering
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Optimal Power Control and Scheduling for Real-Time and Non-Real-Time Data'. Together they form a unique fingerprint.

  • Cite this