TY - GEN
T1 - Energy optimization in mobile TV broadcast networks
AU - Hefeeda, Mohamed
AU - Hsu, Cheng Hsin
PY - 2008/12/18
Y1 - 2008/12/18
N2 - We consider energy optimization in mobile TV networks which a base station broadcasts multiple TV channels to receivers over a common wireless medium. In these , the base station broadcasts TV channels in bursts bit rates much higher than the encoding rates of the streams. Thus, mobile devices can receive a burst of and then turn off their radio frequency circuits till next burst in order to save energy. To achieve this energy , the base station must carefully construct the schedule for all TV channels. In this paper, we formulate problem of determining the optimal burst schedules broadcasting multiple TV channels. We show that problem is NP-complete for channels with arbitrary bit . We then propose a practical simplification of the general , which allows TV channels to have different rates, but at power of two increments. Using this simplification, propose and analyze an optimal burst scheduling . We implement our algorithm in a mobile TV and we present empirical results to demonstrate its efficiency and optimality.
AB - We consider energy optimization in mobile TV networks which a base station broadcasts multiple TV channels to receivers over a common wireless medium. In these , the base station broadcasts TV channels in bursts bit rates much higher than the encoding rates of the streams. Thus, mobile devices can receive a burst of and then turn off their radio frequency circuits till next burst in order to save energy. To achieve this energy , the base station must carefully construct the schedule for all TV channels. In this paper, we formulate problem of determining the optimal burst schedules broadcasting multiple TV channels. We show that problem is NP-complete for channels with arbitrary bit . We then propose a practical simplification of the general , which allows TV channels to have different rates, but at power of two increments. Using this simplification, propose and analyze an optimal burst scheduling . We implement our algorithm in a mobile TV and we present empirical results to demonstrate its efficiency and optimality.
UR - https://www.scopus.com/pages/publications/67649467711
U2 - 10.1109/INNOVATIONS.2008.4781676
DO - 10.1109/INNOVATIONS.2008.4781676
M3 - Conference contribution
AN - SCOPUS:67649467711
SN - 9781424433971
T3 - 2008 International Conference on Innovations in Information Technology, IIT 2008
SP - 430
EP - 434
BT - 2008 International Conference on Innovations in Information Technology, IIT 2008
T2 - 2008 International Conference on Innovations in Information Technology, IIT 2008
Y2 - 16 December 2008 through 18 December 2008
ER -