Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
Dispatching in perfectly-periodic schedules
Journal of Algorithms
Broadcast disks with polynomial cost functions
Wireless Networks
Efficient algorithms for periodic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient data dissemination using locale covers
Pervasive and Mobile Computing
| Hi-index | 0.00 |
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such {\em clients}\, are of significant interest. The environment under consideration is {\em asymmetric}\, in that the information server has much more bandwidth available, as compared to the clients. In such environments, often it is not possible (or not desirable) for the clients to send explicit requests to the server. It has been proposed that in such systems the server should broadcast the data periodically. One challenge in implementing this solution is to determine the {\em schedule}\, for broadcasting the data, such that the wait encountered by the clients is minimized. A {\em broadcast schedule}\, determines what is broadcast by the server and when. In this report, we present three algorithms for determining broadcast schedules that minimize the wait time. Simulation results are presented to demonstrate that our algorithms perform well. Variations of our algorithms for environments subject to errors, and systems where different clients may listen to different number of broadcast channels are also considered.