Energy-efficient scheduling of delay constrained traffic over fading channels
IEEE Transactions on Wireless Communications
Online maximizing weighted throughput in a fading channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Online maximizing weighted throughput in a fading channel
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Energy optimal scheduler for diversity fading channels with maximum delay constraints
IEEE Transactions on Wireless Communications
IEEE Transactions on Signal Processing
Opportunistic transmission for wireless sensor networks under delay constraints
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
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
Uplink cross-layer scheduling with differential QoS requirements in OFDMA systems
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
Queueing Systems: Theory and Applications
Hi-index | 0.01 |
We seek to maximize the average data throughput of a single transmitter sending data over a fading channel to a single user class. The transmitter has a fixed amount of energy and a limited amount of time to send data. Given that the channel state determines the throughput obtained per unit of energy expended, the goal is to obtain a policy for scheduling transmissions that maximizes the expected data throughput. We develop a dynamic programming formulation that leads to an optimal transmission schedule, first where the present channel state is known just before transmission, and then to the case where the current channel state is unknown before transmission, but observed after transmission and evolves according to a Markov process. We then extend our approach to the problem of minimizing the expected energy required to send a fixed amount of data over a fading channel given deadline constraints.