loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)
Fair Broadcasting Schedules on Dependent Data in Wireless Environments
June 11-June 13
ISBN: 978-0-7695-3158-8
ASCII Text
x 
 
Ming-Te Shih, Chuan-Ming Liu, "Fair Broadcasting Schedules on Dependent Data in Wireless Environments," Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on, pp. 185-192, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/SUTC.2008.55,
author = {Ming-Te Shih and Chuan-Ming Liu},
title = {Fair Broadcasting Schedules on Dependent Data in Wireless Environments},
journal ={Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3158-8},
pages = {185-192},
doi = {http://doi.ieeecomputersociety.org/10.1109/SUTC.2008.55},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
TI - Fair Broadcasting Schedules on Dependent Data in Wireless Environments
SN - 978-0-7695-3158-8
SP185
EP192
A1 - Ming-Te Shih,
A1 - Chuan-Ming Liu,
PY - 2008
VL - 0
JA - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
ER -
 
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.
Citation:
Ming-Te Shih, Chuan-Ming Liu, "Fair Broadcasting Schedules on Dependent Data in Wireless Environments," sutc, pp.185-192, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.