Efficient algorithms for scheduling data broadcast

Sohail Hameed, Nitin H. Vaidya

Research output: Contribution to journalArticlepeer-review


With the increasing acceptance of wireless technology, mechanisms to efficiently transmit information to wireless clients are of interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. It has been proposed that in such systems the server should broadcast the information periodically. A broadcast schedule determines what is broadcast by the server and when. This paper makes the simple, yet useful, observation that the problem of broadcast scheduling is related to the problem of fair queueing. Based on this observation, we present a log-time algorithm for scheduling broadcast, derived from an existing fair queueing algorithm. This algorithm significantly improves the time-complexity over previously proposed broadcast scheduling algorithms. Modification of this algorithm for transmissions that are subject to errors is considered. Also, for environments where different users may be listening to different number of broadcast channels, we present an algorithm to coordinate broadcasts over different channels. Simulation results are presented for proposed algorithms.

Original languageEnglish (US)
Pages (from-to)183-193
Number of pages11
JournalWireless Networks
Issue number3
StatePublished - 1999

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Efficient algorithms for scheduling data broadcast'. Together they form a unique fingerprint.

Cite this