Optimal Time Slicing for Mobile TV Services

Abstract

Time slicing is an important energy saving technology in mobile TV networks. The general burst scheduling problem for time slicing has been proven to be NP-complete and some sub-optimal algorithms are proposed. A critical issue of time slicing is that it increases channel switching delay which is a very important metric in mobile TV services. In this paper we consider the channel switching delay is very short so that we can assume there is no buffer overflow in mobile devices. Base on this assumption we propose an optimal burst scheduling algorithm for time slicing in mobile TV networks.