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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.