Fair broadcasting schedules on dependent data in wireless environments

Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

Volumn , Issue , 2008, Pages 185-192

  Shih, Ming Te ^a   Liu, Chuan Ming ^a  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

DAGs; Data broadcasting; Latency; NP completeness; Scheduling

Indexed keywords

COMPUTER NETWORKS; CONTROL THEORY; DECODING; NUCLEAR PROPULSION; RADIO BROADCASTING; SENSORS; UBIQUITOUS COMPUTING;

DAGS; DATA BROADCASTING; LATENCY; NP-COMPLETENESS; SCHEDULING;

SENSOR NETWORKS;

EID: 50949116013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUTC.2008.55     Document Type: Conference Paper

References (25)

1. S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proceedings of the 1997 ACM SIGMOD international conference on management of data, pages 183-194, 1997.
2. A. Bar-Noy, J. Naor, and B. Schieber. Pushing dependent data in clients-providers-servers systems. Wireless Networks, 9(5):421-430, 2003.
3. Y. C. Chehadeh, A. R. Hurson, and M. Kavehrad. Object organization on a single broadcast channel in the mobile computing environment. Multimedia Tools and Applications, 9(1):69-94, 1999.
4. A. Eden, B. Joh, and T. Mudge. Web latency reduction via client-side prefetching. In Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software, pages 193 - 200, 2000.
5. S.-C. L. G. Lee and A. Chen. Data allocation on wireless broadcast channels for efficient query processing. IEEE transactios on Computers, 51(10), 2002.
6. S. Hambrusch, C.-M. Liu,W. G. Aref, and S. Prabhakar. Efficient query execution on broadcasted index tree structures. Data and Knowledge Engineering, 60(3):511-529, 2007.
7. S. Hambrusch, C.-M. Liu, and S. Prabhakar. Broadcasting and querying multi-dimensional index trees in a multichannel environment. Information Systems, 31(8):870-886, 2006.
8. S. E. Hambrusch, C.-M. Liu, W. G. Aref, and S. Prabhakar. Query processing in broadcasted spatial index trees. Lecture Notes in Computer Science, 2121:502-510, 2001.
9. L. He, S. Jarvis, D. Spooner, and G. Nudd. Performance evaluation of scheduling applications with dag topologies on multiclusters with independent local schedulers. In Proceedings of the 20th InternationalParallel and Distributed Processing Symposium, page 8, 2006.
10. R. V. Hogg and E. A. Tanis. The poisson distribution. In Probability and Statistical Inference, pages 131-133. Macmillan Publishing Company, 1989.
11. E. Horowitz, S. Sahni, and S. Rajasekaran. Np-hard and np-complete problems. In Computer Algorithms, page 553. W.H. Freeman and Company, 1998.
12. J.-L. Huang, M.-S. Chen, and W.-C. Peng. Broadcasting dependent data for ordered queries without replication in a multi-channel mobile environment. In Proceedings of the 19th International Conference on Data Engineering, pages 692-694, 2003.
13. H.-P. Hung and M.-S. Chen. On exploring channel allocation in the diverse data broadcastingenviroment. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems(ICDCS'05), pages 729-738, 2005.
14. A. Hurson and Y. Jiao. Data broadcasting in a mobile environment. In Wireless Information Highway, chapter 4, pages 96-154. IRM Press, 2004.
15. T. Imieliński, S. Viswanathan, and B. R. Badrinath. Data on air: Organization and access. IEEE Transactions on Knowledge and Data Engineering, 9(3):353-372, 1997.
16. G. Lee, S.-C. Lo, and A. Chen. Data allocation on wireless broadcast channels for efficient query processing. IEEE Transactions on Computers, 51(10), 2002.
17. Y. Li, Z. Gong, and K. Qi. Decting the content related parts of web pages. In Proceedings of the 2005 International Conference on Services Systems and services Management, pages 1071-1074, 2005.
18. K. H. Lio and R. C. Chen. On scheduling to minimize the variance of job completion time, 1999.
19. C.-M. Liu and S.-Y. Fu. Effective protocols for knn search on broadcast multi-dimensional index trees. Information Systems, 33(1):18-35, 2008.
20. C.-M. Liu and K.-F. Lin. Disseminating dependent data in wireless broadcast environments. Distributed and Parallel Databases, (1):1-25, 2007.
21. C.-M. Liu, L.-C. Wang, L. Chen, and C.-J. Chang. Ondemand data disseminating with considering channel interference for efficient shortest-route service on intelligent transportation system. In Proceedings of the 2004 IEEE International Conference on Networking, Sensing and Control, pages 701-706, 2004.
22. G. Malewicz, A. Rosenberg, and M. Yurkewych. On scheduling complex dags for internet-based computing. In Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, pages 66-66. IEEE, 2005.
23. N. V. S. Hameed. Efficient algorithms for scheduling data broadcast. ACM/Baltzer Journal of Wireless Networks, 5(3):183-193, 1999.
24. J. Shen, I. Nikolaidis, and J. Harms. A dag-based approach to wireless scheduling. In Proceedings of the 2005 IEEE International Conference on Communications, page 66, 2005.
25. B. Zheng, X. Wu, X. Jin, and D. Lee. Tosa: a near-optimal scheduling algorithm for multi-channel data broadcast. In Proceedings of the 6th International Conference on Mobile Data Management, pages 29-37, 2005.