Abstract

Time slicing is an important technology which can save the energy of mobile devices in mobile TV services. Some burst scheduling algorithms for time slicing are proposed in the literature. However, they are designed to maximize energy saving without considering channel switching delay limitation. In this letter, the burst scheduling problem with channel switching delay limit is studied and shown to be NP-complete. An algorithm for the problem is proposed and the simulation result demonstrates that the energy saving of the proposed algorithm is just 2% less than the limit when channel switching delay is limited to 0.5 seconds.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call