Data Broadcast Scheduling in Wireless Mobile Computing
John Tsiligaridis and Raj Acharya
International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2007)
San Diego, California (USA), July 16-18, 2007
SPECTS_Summary
The expanding wireless communication technology gives mobile users the capability of accessing data at any time and place. The server fetches the requests and broadcasts the data to the air. The broadcast problem including the plan design is considered. The uniform items are inserted and numbered in predefined order into customized size relations. Under some divisible conditions our approach can guarantee the creation of full Broadcast Plan (BP) with predefined number of items repetition. A set of algorithms discovers the possibilities to get a full BP or an empty slot BP. For the latter the possibility to get a full BP from an empty slot one, is examined after some transformations. Servers now may provide self-monitoring, self-organizing, and other automated abilities. To increase the server broadcasting capabilities for the uniform data a new scheduling algorithm is introduced. The HOL waiting time group (HOL-WTG) scheduler, working as Round Robin, along with the bandwidth adjustment provides the service priority, diminishes the waste of bandwidth, and minimizes the number of rounds. Simulation experiments are provided.