Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Parallel Processor Scheduling with Limited Number of Preemptions
SIAM Journal on Computing
Scheduling Algorithms
On burst transmission scheduling in mobile TV broadcast networks
IEEE/ACM Transactions on Networking (TON)
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Joint Video Coding and Statistical Multiplexing for Broadcasting Over DVB-H Channels
IEEE Transactions on Multimedia
A generalized hypothetical reference decoder for H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
Mobile video streaming in modern wireless networks
Proceedings of the international conference on Multimedia
Statistical multiplexing of variable-bit-rate videos streamed to mobile devices
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Distortion-aware scalable video streaming to multinetwork clients
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Mobile TV broadcast networks have received significant attention from the industry and academia, as they have already been deployed in several countries around the world and their expected market potential is huge. In such networks, a base station broadcasts TV channels in bursts with bit rates much higher than the encoding bit rates of the videos. This enables mobile receivers to receive a burst of traffic and then turn off their receiving circuits till the next burst to conserve energy. The base station needs to construct a transmission schedule for all bursts of different TV channels. Constructing optimal (in terms of energy saving) transmission schedules has been shown to be an NP-complete problem when the TV channels carry video streams encoded at arbitrary and variable bit rates. In this paper, we propose a near-optimal approximation algorithm to solve this problem. We prove the correctness of the proposed algorithm and derive its approximation factor. We also conduct extensive evaluation of our algorithm using implementation in a real mobile TV testbed as well as simulations. Our experimental and simulation results show that the proposed algorithm: 1) is practical and produces correct burst schedules; 2) achieves near-optimal energy saving for mobile devices; and 3) runs efficiently in real time and scales to large scheduling problems.