Sciweavers

Share
SUTC
2006
IEEE

Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels

9 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 to be downloaded can be represented by a DAG. In this paper, we consider the problem of efficiently generating the broadcast schedule on multiple channels when the data set has a DAG access pattern. We prove that it is NP-hard to find an optimal broadcast schedule which not only minimizes the latency but also satisfies the ancestor property which preserves the data dependency. We further rule out a condition for the input DAGs under which one can generate an optimal broadcast schedule in linear time and propose an algorithm, LBS, to generate the schedule under such a condition. For general DAGs, we provide three heuristics: the first one uses the overall access probability of each vertex; the second one considers the total access probability of a vertex’s descendants; the third one combines the above t...
Kun-Feng Lin, Chuan-Ming Liu
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where SUTC
Authors Kun-Feng Lin, Chuan-Ming Liu
Comments (0)
books