Optimality of threshold policies for transmission scheduling in correlated fading channels

• Published in: IEEE transactions on communications Vol. 57; no. 8; pp. 2474 - 2483
• Main Authors: Minh Hanh Ngo, Krishnamurthy, V.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.08.2009; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Automatic repeat request; Channel state information; Channels; Computational complexity; Correlation; Cost function; Costs; cross-layer optimization; Data communication; Delay; Detection, estimation, filtering, equalization, prediction; dynamic programming; Exact sciences and technology; Fading; Information, signal and communications theory; Markov decision processes; Optimal scheduling; Optimization; Policies; Processor scheduling; Scheduling; Signal and communications theory; Signal, noise; Studies; Switching and signalling; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Thresholds; Transmission and modulation (techniques and equipments); Wireless application protocol; Fading channels; Markov process; Packet switching; Parameter estimation; Markov decision; Wireless telecommunication; Loss rate; Data transmission; Scheduling; Buffer system; Computational complexity; Transmission time; Implementation; Optimization; Markov decision processes; Channel estimation; Batch process; Telecommunication channels; cross-layer optimization; Delay time; Optimal planning; Dynamic programming; Transmission loss; Automatic repeat request
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2009.08.070350

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 prespecified 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.