Sciweavers

720 search results - page 5 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
IMCSIT
2010
14 years 8 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
SUTC
2006
IEEE
15 years 4 months ago
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...
Kun-Feng Lin, Chuan-Ming Liu
INFOCOM
2007
IEEE
15 years 4 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...
MONET
2002
105views more  MONET 2002»
14 years 9 months ago
High Performance Data Broadcasting Systems
Data broadcasting as a means of efficient data dissemination is a key technology facilitating ubiquitous computing. For this reason, broadcast scheduling algorithms have received ...
Peter Triantafillou, R. Harpantidou, Michael Pater...
WWW
2004
ACM
15 years 10 months ago
Scheduling web requests in broadcast environments
On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time con...
Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu