High-Effective Dynamical Schedule Algorithm for Wireless Broadcast

In pull-based wireless networks, clients request data items from a server. In order to solve cold and hot data and reduces clients´ waiting timer, server considers the hit rate of data items and the waiting time of requests for broadcasting. The hit rate of data items and the waiting time of requests always changed along with time elapsed. Therefore, server has to calculate overall weight value of data items and decides maximum weight value of data items before broadcasting. In order to increase the performance of the server, we propose an effective dynamically schedule algorithm (EDSA) for wireless broadcast. The EDSA uses weight value of data items and maintains them in a maximum heap tree for quick broadcasting. Furthermore, we present an indexing for accessing a data item´s information faster. The experiment results showed that our method is more effective than a general algorithm in the dynamic wireless environment. However, it is still have some problems about our EDSA, therefore we propose an improved-EDSA to correct the problems.