A Multi-item Broadcast Scheduling Based on A* Algorithm

Data broadcast is an efficient way to disseminate information to large numbers of users in mobile environments. Existing research on scheduling of multi-item broadcasting mostly consider access frequency or the relationships among data items, these scheduling algorithms only achieve local optimum. In this paper, we introduce the A* algorithm of artificial intelligence, considering both access frequency and the relationships among data items, design an evaluation function and propose an optimal search algorithm, at the same time set the size of a window in order to reach its work quickly. At last, comparing to QEM algorithm, the proposed algorithm has a better performance in access time.