On-Demand Broadcast: New Challenges and Scheduling Algorithms
Mohamed A. Sharaf, Panos K. Chrysanthis · 2002
With the rapid growth in wireless technologies and the cost effectiveness in deploying wireless networks, wireless computers are quickly becoming the normal front-end devices for accessing enterprise data. In this paper, we are addressing the issue of efficient delivery of business-critical data in the form of summary tables to wireless clients equipped with OLAP front-end tools. Towards this, we propose a new heuristic, on-demand scheduling algorithm, called STOBS-ff, that aggregates requests and broadcasts the results only once to all clients. STOBS-ff exploits the structural dependencies among summary tables to maximize data sharing based on aggregation and does not assume fixed length or uniform broadcasts. The effectiveness of our proposed heuristic was evaluated experimentally using simulation with respect to both access time and fairness, as well as power consumption in the case of mobile clients.