Broadcasting Video Streams Encoded With Arbitrary Bit Rates in Energy-Constrained Mobile TV Networks

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2010-06, Vol.18 (3), p.681-694
Main Authors: Cheng-Hsin Hsu, Hefeeda, Mohamed M
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Approximation algorithms
Base stations
Bit rate
Broadcast networks
Broadcasting
burst transmission
Bursts
Channels
Circuits
Digital Vido Broadcast-Handheld (DVB-H)
Energy conservation
energy saving
Job shop scheduling
Mobile TV
mobile video streaming
Multimedia communication
Networks
Schedules
Streaming media
Studies
Telecommunication traffic
Television
time slicing
TV broadcasting
Video compression
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2009.2033058