Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels

DOI10.1109/TIT.2012.2236917zbMATH Open1364.90158arXiv0906.5397OpenAlexW2165517274MaRDI QIDQ2989334FDOQ2989334

Authors: Juyul Lee, Nihar Jindal 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A hard-deadline, opportunistic scheduling problem in which $B$ bits must be transmitted within $T$ time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the current channel but without knowledge of the channel in future slots, with the objective of minimizing expected transmission energy. In order to focus on the effects of delay and fading, we assume that no other packets are scheduled simultaneously and no outage is considered. We also assume that the scheduler can transmit at capacity where the underlying noise channel is Gaussian such that the energy-bit relation is a Shannon-type exponential function. No closed form solution for the optimal policy is known for this problem, which is naturally formulated as a finite-horizon dynamic program, but three different policies are shown to be optimal in the limiting regimes where $T$ is fixed and $B$ is large, $T$ is fixed and $B$ is small, and where $B$ and $T$ are simultaneously taken to infinity. In addition, the advantage of optimal scheduling is quantified relative to a non-opportunistic (i.e., channel-blind) equal-bit policy.

Full work available at URL: https://arxiv.org/abs/0906.5397

Recommendations

• Scheduling weighted packets with deadlines over a fading channel
• Structural results on optimal transmission scheduling over dynamical fading channels: a constrained Markov decision process approach
• Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic
• Wireless scheduling with partial channel state information: large deviations and optimality
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
• Throughput optimal scheduling policies in networks of constrained queues
• Asymptotically Optimal Lagrangian Priority Policy for Deadline Scheduling With Processing Rate Limits
• Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
• Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime
• Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

This page was built for publication: Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989334)