On-demand data broadcast with deadlines for avoiding conflicts in wireless networks
The paper presents UPF algorithm to solve data schedule problem in on-demand data broadcast for a set of requests. Two well-known conflicts are considered in this algorithm. The UFP algorithm tries best to allocate all data items of a request in its deadlines. Increasing the number of broadcast channels will reduce deadline miss ratio and access latency in different sizes of databases. Increasing the request size will increase deadline miss ratio and access latency in different sizes of databases.
on-demand data broadcast download deadline 2-conflict