An efficient broadcast scheduling for multi-item queries with skewed access possibility

The scheduling for multi-item queries is an important and challenging issue in wireless broadcasting. Several approaches have been proposed in previous works. However most of them construct the broadcast schedule in which each data appears exactly once. This construction leads to poor performance especially when the access probability of queries is skewed. In this paper we propose an efficient hybrid method which gives better performance for skewed broadcast scheduling for multi-item queries.