On burst transmission scheduling in mobile TV broadcast networks

Mohamed Hefeeda, Cheng Hsin Hsu

Research output: Contribution to journalArticle

30 Citations (Scopus)


In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequency circuits till the next burst in order to save energy. To achieve this energy saving without scarifying streaming quality, the base station must carefully construct the burst schedule for all TV channels. This is called the burst scheduling problem. In this paper, we prove that the burst scheduling problem for TV channels with arbitrary bit rates is NP-complete. We then propose a practical simplification of the general problem, which allows TV channels to be classified into multiple classes, and the bit rates of the classes have power of two increments, e.g., 100, 200, and 400 kbps. Using this practical simplification, we propose an optimal and efficient burst scheduling algorithm. We present theoretical analysis, simulation, and actual implementation in a mobile TV testbed to demonstrate the optimality, practicality, and efficiency of the proposed algorithm.

Original languageEnglish
Article number5299246
Pages (from-to)610-623
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number2
Publication statusPublished - 1 Apr 2010


  • Burst scheduling
  • Digital Video Broadcast-Handheld (DVB-H)
  • Energy saving
  • Mobile TV
  • Mobile multimedia
  • Video broadcast networks
  • Wireless video streaming

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On burst transmission scheduling in mobile TV broadcast networks'. Together they form a unique fingerprint.

  • Cite this