Optimality of threshold policies for transmission scheduling in correlated fading channels

Authors:
Minh Hanh Ngo;Vikram Krishnamurthy
Affiliations:
Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada;Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 5
Cited 1

Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Optimal power and retransmission control policies for random access systems

IEEE/ACM Transactions on Networking (TON)
Monotonicity of constrained optimal transmission policies in correlated fading channels with ARQ

IEEE Transactions on Signal Processing
MIMO Transmission Control in Fading Channels—A Constrained Markov Decision Process Formulation With Monotone Randomized Policies

IEEE Transactions on Signal Processing
Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policies

IEEE Transactions on Wireless Communications

Monotonicity of constrained optimal transmission policies in correlated fading channels with ARQ

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider exploiting perfect channel state information for optimal scheduling for point-to-point data transmission over correlated fading wireless channels, where retransmissions are allowed via the use of a channel-aware ARQ protocol. The objective is to achieve a trade-off between energy and packet loss rate subject to a hard delay constraint. Specifically, the aim of the transmission scheduling problem is to minimize the sum of accumulated transmission costs and a penalty cost on the number of lost packets, subject to the constraint that each batch of a finite number of link layer packets has to be transmitted within a pre-specified number of transmission time slots. Using the concept of supermodularity, we prove that under some conditions on the costs, the optimal transmission scheduling policy is threshold in the residual transmission time and the buffer occupancy. These two threshold results substantially reduce the computational complexity required to implement the optimal transmission scheduling policy.