Scheduling data broadcast in asymmetric communication environments

With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to wireless clients are of significant interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the client...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Wireless networks Ročník 5; číslo 3; s. 171 - 182
Hlavní autoři: Vaidya, Nitin H., Hameed, Sohail
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.01.1999
Témata:
Algorithms
Communication
Data transmission
Handheld computers
Listening
Schedules
Scheduling
Studies
Wireless communications
Wireless networks
ISSN:1022-0038, 1572-8196
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to wireless clients are of significant interest. The environment under consideration is 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 schedule for broadcasting the data, such that the wait encountered by the clients is minimized. A broadcast schedule determines what is broadcast by the server and when. In this paper, we present algorithms for determining broadcast schedules that minimize the wait time. Broadcast scheduling algorithms for environments subject to errors, and systems where different clients may listen to different number of broadcast channels are also considered. Performance evaluation results are presented to demonstrate that our algorithms perform well.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1023/A:1019142809816