Download now Free registration required
In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequency circuits till the next burst in order to save energy. To achieve this energy saving without scarifying streaming quality, the base station must carefully construct the burst schedule for all TV channels. This is called the burst scheduling problem. In this paper, the authors prove that the burst scheduling problem for TV channels with arbitrary bit rates is NP-complete.
- Format: PDF
- Size: 1163.3 KB