Skip to main content
SpringerLink
Log in

Disseminating dependent data in wireless broadcast environments

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

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 can be represented by a weighted DAG. In this paper, we explore how to efficiently generate the broadcast schedule in a wireless environment for the data set having a weighted DAG access pattern. Such a broadcast schedule not only minimizes the access latency but also is a topological ordering of the DAG. Minimized access latency ensures the quality of service (QoS). We prove that it is NP-hard to find an optimal broadcast schedule and provide some heuristics. After giving an analysis for these heuristics on the latency and complexity, we implement all the proposed heuristics to compare their performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, M. Franklin, and S. Zdonik, “Balancing push and pull for data broadcasts,” in Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, May 1997, pp. 183–194.

  2. A. Bar-Noy, J. Naor, and B. Schieber, “Pushing dependent data in clients-providers-servers systems,” Wireless Networks, vol. 9, pp. 421–430, 2003.

    Article  Google Scholar 

  3. G. Chartrand and O.R. Oellerman, Applied and Algorithmic Graph Theory. McGraw-Hill, 1993.

  4. Y. Chehadeh, A. Hurson, and M. Kavehrad, “Object organization on a single broadcast channel in the mobile computing environment,” Multimedia Tools and Applications, vol. 9, pp. 69–94, 1999.

    Article  Google Scholar 

  5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. McGraw-Hill, New York, 2002.

    Google Scholar 

  6. S. Even and Y. Shiloah, “Np-completeness of several arrangement problems,” Department of Computer Science, Israel Institute of Technology, Haifa, Isreal, Tech. Rep., 1975.

  7. S. Hambrusch, C.-M. Liu, W. Aref, and S. Prabhakar, “Query processing in broadcasted spatial index trees,” Lecture Notes in Computer Science, vol. 2121, pp. 502–510, 2001.

  8. S. Hameed and N. Vaidya, “Efficient algorithms for scheduling data broadcast,” ACM/Baltzer Journal of Wireless Networks, vol. 5, no. 3, pp. 183–193, 1999.

    Article  Google Scholar 

  9. 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, 2003, pp. 692–694.

  10. H.-P. Hung and M.-S. Chen, “On exploring channel allocation in the diverse data broadcasting environment,” in ICDCS ’05: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS’05), 2005, pp. 729–738.

  11. A. Hurson and Y. Jiao, “Data broadcasting in a mobile environment,” in Wireless Information Highway. IRM Press, 2004, Ch. 4, pp. 96–154.

  12. J.S. Ide, F.G. Cozman, and F.T. Ramos, “Generating random bayesian networks with constraints on induced width,” in Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004, pp. 323–327.

  13. T. Imieliñski, S. Viswanathan, and B.R. Badrinath, “Data on air: Organization and access,” IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 353–372, May/June 1997.

    Article  Google Scholar 

  14. G. Lee, S.-C. Lo, and A. Chen, “Data allocation on wireless broadcast channels for efficient query processing,” IEEE Transactions on Computers, vol. 51, no. 10, 2002.

  15. C.-M. Liu, “Broadcasting and blocking large data sets with an index tree,” Ph.D. dissertation, Purdue University, West Lafayette, IN, 2002.

  16. C.-M. Liu, L.-C. Wang, L. Chen, and C.-J. Chang, “On-demand 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, 2004, pp. 701–706.

  17. B. Zheng, X. Wu, X. Jin, and D.L. Lee, “Tosa: a near-optimal scheduling algorithm for multi-channel data broadcast,” in MEM ’05: Proceedings of the 6th international conference on Mobile data management, 2005, pp. 29–37.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taipei University of Technology, Taipei, 106, Taiwan

    Chuan-Ming Liu & Kun-Feng Lin

Authors
  1. Chuan-Ming Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kun-Feng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chuan-Ming Liu.

Additional information

Recommended by: Sunil Prabhakar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, CM., Lin, KF. Disseminating dependent data in wireless broadcast environments. Distrib Parallel Databases 22, 1–25 (2007). https://doi.org/10.1007/s10619-006-7006-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-006-7006-4

Keywords

Search

Navigation