Data networks (2nd ed.)
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
M/M/1 Queues with Switching Costs and Hysteretic Optimal Control
Operations Research
Wireless Communications
IEEE Transactions on Signal Processing
IEEE Transactions on Communications
Hi-index | 0.00 |
We present an optimal adaptive modulation and coding policy that minimizes the transmission latency and modulation/coding switching cost across a finite-state Markovian fading channel. We formulate the optimal tradeoff between transmission latency and modulation/coding switching cost as a discounted infinite horizon Markov Decision Problem (MDP). By exploiting special structures of the formulated MDP and under certain sufficient conditions, we show that optimal modulation and coding selection policies are monotone in the state variables. These monotone optimal policies are computationally inexpensive to implement and are scalable in terms of channel and switching cost parameters. Numerical results confirm the monotonicity and threshold-based structure of the optimal Modulation and Coding Scheme (MCS) selection policies under the proposed sufficient conditions.