Time slicing in mobile TV broadcast networks with arbitrary channel bit rates

Cheng Hsin Hsu, Mohamed Hefeeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries 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 circuit 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 are encoded at arbitrary 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 real implementation in a mobile TV testbed and simulations. Our experimental and simulation results show that the proposed algorithm: (i) is practical and produces correct burst schedules, (ii) achieves near-optimal energy saving for mobile devices, and (iii) runs efficiently in real time.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages2231-2239
Number of pages9
DOIs
Publication statusPublished - 12 Oct 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: 19 Apr 200925 Apr 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period19/4/0925/4/09

Fingerprint

Base stations
Energy conservation
Approximation algorithms
Testbeds
Mobile devices
Computational complexity
Networks (circuits)
Industry

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Hsu, C. H., & Hefeeda, M. (2009). Time slicing in mobile TV broadcast networks with arbitrary channel bit rates. In Proceedings - IEEE INFOCOM (pp. 2231-2239). [5062148] https://doi.org/10.1109/INFCOM.2009.5062148

Time slicing in mobile TV broadcast networks with arbitrary channel bit rates. / Hsu, Cheng Hsin; Hefeeda, Mohamed.

Proceedings - IEEE INFOCOM. 2009. p. 2231-2239 5062148.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hsu, CH & Hefeeda, M 2009, Time slicing in mobile TV broadcast networks with arbitrary channel bit rates. in Proceedings - IEEE INFOCOM., 5062148, pp. 2231-2239, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 19/4/09. https://doi.org/10.1109/INFCOM.2009.5062148
Hsu CH, Hefeeda M. Time slicing in mobile TV broadcast networks with arbitrary channel bit rates. In Proceedings - IEEE INFOCOM. 2009. p. 2231-2239. 5062148 https://doi.org/10.1109/INFCOM.2009.5062148
Hsu, Cheng Hsin ; Hefeeda, Mohamed. / Time slicing in mobile TV broadcast networks with arbitrary channel bit rates. Proceedings - IEEE INFOCOM. 2009. pp. 2231-2239
@inproceedings{6f323ff35166428db7b679e2fb57c3f0,
title = "Time slicing in mobile TV broadcast networks with arbitrary channel bit rates",
abstract = "Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries 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 circuit 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 are encoded at arbitrary 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 real implementation in a mobile TV testbed and simulations. Our experimental and simulation results show that the proposed algorithm: (i) is practical and produces correct burst schedules, (ii) achieves near-optimal energy saving for mobile devices, and (iii) runs efficiently in real time.",
author = "Hsu, {Cheng Hsin} and Mohamed Hefeeda",
year = "2009",
month = "10",
day = "12",
doi = "10.1109/INFCOM.2009.5062148",
language = "English",
isbn = "9781424435135",
pages = "2231--2239",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Time slicing in mobile TV broadcast networks with arbitrary channel bit rates

AU - Hsu, Cheng Hsin

AU - Hefeeda, Mohamed

PY - 2009/10/12

Y1 - 2009/10/12

N2 - Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries 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 circuit 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 are encoded at arbitrary 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 real implementation in a mobile TV testbed and simulations. Our experimental and simulation results show that the proposed algorithm: (i) is practical and produces correct burst schedules, (ii) achieves near-optimal energy saving for mobile devices, and (iii) runs efficiently in real time.

AB - Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries 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 circuit 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 are encoded at arbitrary 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 real implementation in a mobile TV testbed and simulations. Our experimental and simulation results show that the proposed algorithm: (i) is practical and produces correct burst schedules, (ii) achieves near-optimal energy saving for mobile devices, and (iii) runs efficiently in real time.

UR - http://www.scopus.com/inward/record.url?scp=67650311144&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650311144&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2009.5062148

DO - 10.1109/INFCOM.2009.5062148

M3 - Conference contribution

SN - 9781424435135

SP - 2231

EP - 2239

BT - Proceedings - IEEE INFOCOM

ER -