Referenced Items are not available for this document.
In wireless mobile services, data broadcasting provides an effective method to disseminate information to mobile clients. In some applications, the access pattern of all data items can be represented by a weighted DAG. In this paper, we explore how to generate the data broadcast schedule for dependent data, which can be modeled as a weighted DAG, to serve all the mobile clients effectively and fairly. The resulting data broadcast schedules must keep the original dependency and minimizes the variance of latency. We prove that it is NP-complete to find such an optimal solution. Due to the NP-completeness, we provide two heuristics to solve the problem. In additions, we discuss the upper and lower bounds on the variance of latency for the problem.
Published in:
Sensor Networks, Ubiquitous and Trustworthy Computing, 2008. SUTC '08. IEEE International Conference on
Date of Conference: 11-13 June 2008
- Page(s):
- 185 - 192
- E-ISBN :
- 978-0-7695-3158-8
- Print ISBN:
- 978-0-7695-3158-8
- INSPEC Accession Number:
- 10060037
- Conference Location :
- Taichung
- Digital Object Identifier :
- 10.1109/SUTC.2008.55
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
