Abstract
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the problem of data scheduling in multiple broadcast channels environments where the clients equip with multiple receivers. Each request is associated with a deadline. The clients can retrieve data items either from the broadcast channels or make requests to the server and then listen to the broadcast channels. The intention of our work is to serve as many requests as possible.In our method, the content of the broadcast program is first decided. Afterwards, the periodic broadcast program generation algorithm and the on-demand program generation algorithm are proposed. Simulations are performed to justify the benefit of our approaches. We conclude that our data scheduling algorithms are scalable and the time spent on executing our data scheduling algorithms is low. Moreover, by using our data scheduling algorithms, the percentage of requests that miss their deadlines is also low.