Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Convex Optimization
Optimal transmission scheduling over a fading channel with energy and deadline constraints
IEEE Transactions on Wireless Communications
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Delay-constrained capacity with causal feedback
IEEE Transactions on Information Theory
Delay-bounded packet scheduling of bursty traffic over wireless channels
IEEE Transactions on Information Theory
Variable-rate coding for slowly fading Gaussian multiple-access channels
IEEE Transactions on Information Theory
On adaptive transmission for energy efficiency in wireless data networks
IEEE Transactions on Information Theory
Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks
IEEE Transactions on Information Theory
On the delay limited secrecy capacity of fading channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Asymptotically optimal policies for hard-deadline scheduling over fading channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal scheduling in interference limited fading wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Real-time redundancy allocation for time-varying underwater acoustic channels
Proceedings of the Seventh ACM International Conference on Underwater Networks and Systems
Energy efficient transmission scheduling for non-stationary underwater acoustic channels
Proceedings of the Eighth ACM International Conference on Underwater Networks and Systems
| Hi-index | 0.01 |
A delay-constrained scheduling problem for point-to-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a time-varying channel. The transmitter/scheduler must determine how many bits to transmit, or equivalently how much energy to transmit with, during each time slot based on the current channel quality and the number of unserved bits, with the objective of minimizing expected total energy. In order to focus on the fundamental scheduling problem, it is assumed that no other packets are scheduled during this time period and no outage is allowed. Assuming transmission at capacity of the underlying Gaussian noise channel, a closed-form expression for the optimal scheduling policy is obtained for the case T = 2 via dynamic programming; for T 2, the optimal policy can only be numerically determined. Thus, the focus of the work is on derivation of simple, near-optimal policies based on intuition from the T = 2 solution and the structure of the general problem. The proposed bit-allocation policies consist of a linear combination of a delay-associated term and an opportunistic (channel-aware) term. In addition, a variation of the problem in which the entire packet must be transmitted in a single slot is studied, and a channel-threshold policy is shown to be optimal.