Delay optimal scheduling for ARQ-aided power-constrained packet transmission over multi-state fading channels

Juan Liu, Wei Chen, Khaled Letaief

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we study the delay optimal scheduling policy for a multi-state wireless fading channel, by taking bursty packet arrivals and automatic repeat request-based packet transmission into account. In our system, the average delay each packet experiences includes the time it waits in the queue and the time it may take to retransmit due to packet delivery failure. To reduce the average delay, we propose a joint channel-aware and queue-aware stochastic scheduling policy to determine whether and with which probability the source should transmit based on channel and buffer states, subject to an average power constraint at the transmitter. To find the optimal scheduling probabilities, we formulate a non-linear power-constrained delay minimization problem with the aid of controlled Markov decision processes. The optimization problem is then converted into an equivalent linear programming problem by introducing new variables from the steady-state probabilities of the underlying Markov chain and transmission probabilities. By analyzing its property, we derive the structure of the optimal solution, and exploit it to obtain the optimal probabilities analytically. It is found that the optimal scheduling policy has a double threshold structure, and can significantly reduce the average delay.

Original languageEnglish
Article number8013077
Pages (from-to)7123-7137
Number of pages15
JournalIEEE Transactions on Wireless Communications
Volume16
Issue number11
DOIs
Publication statusPublished - 1 Nov 2017
Externally publishedYes

    Fingerprint

Keywords

  • Controlled Markov decision process
  • Cross-layer design
  • Delay-power tradeoff
  • Stochastic scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this