Abstract: Owing to its potential to satisfy all outstanding requests for the same data item with a single response, on-demand data broadcast becomes a widely accepted approach to dynamic and scalable wireless information dissemination. In some emerging applications, such as road traffic navigation system, users prefer to request multiple dependent data items at a time. In addition, requests usually have deadline constraints for real-time applications. However, in existing works, clients will not know that their requests cannot be satisfied until the deadlines expire. In this paper, admission control is introduced to data broadcast systems such that clients can be informed in advance in the case that their requests have no hope to be satisfied so that earlier remedial actions can be taken. Furthermore, a matching based allocation scheme is proposed to maximize data sharing among requests in multi-channel architectures. Simulation results show that our proposed algorithms have better performance and quality of service (QoS) than traditional algorithms.
0 Replies
Loading