Skip to main content

Adaptive Power-Aware Prefetching Schemes for Mobile Broadcast Environments

  • Conference paper
  • First Online:
Mobile Data Management (MDM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2574))

Included in the following conference series:

  • 608 Accesses

Abstract

Caching and prefetching are common techniques in mobile broadcast environments. Several prefetching policies have been proposed in the literature to either achieve the minimum access latency or save power as much as possible. However, little work has been carried out to adaptively balance these two metrics in a dynamic environment where the user request arrival patterns change over time. This paper investigates how both low latency and low power consumption can be achieved for dynamic request patterns. Two adaptive power-aware schemes, PT with secure region (PTSR) and adaptive prefetching with sliding caches (APSC), are proposed. Experimental results show the proposed policies, in particular APSC, achieve a much lower power consumption while maintaining a similar access latency as the existing policies.

Supported by Research Grants Council, Hong Kong SAR under grant HKUST6225/02E.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. Broadcast disks: Data management for asymmetric communications environments. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 199–210, San Jose, CA, USA, May 1995.

    Google Scholar 

  2. S. Acharya, M. Franklin, and S. Zdonik. Prefetching from a broadcast disk. In Proceedings of the 12th International Conference on Data Engineering (ICDE’96), pages 276–285, New Orleans, LA, USA, February 1996.

    Google Scholar 

  3. V. Grassi. Prefetching policies for engery saving and latency reduction in a wireless broadcast data delivery system. In Proceedings of the 3rd ACM International Work on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM’00), Boston, MA, USA, August 2000.

    Google Scholar 

  4. H. B. Hu, J. L. Xu, and D. L. Lee. Adaptive power-aware prefetching schemes for mobile broadcast environments. Technical report, Department of Computer Science, Hong Kong University of Science and Technology, http://www.cs.ust.hk/haibo/pub/prefetching.pdf, June 2002.

  5. L. Tassiulas and C. J. Su. Optimal memory management strategies for a mobile user in a broadcast data delivery system. IEEE Journal on Selected Areas in Communications (JSAC), 15(7):1226–1238, September 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, H., Xu, J., Lun Lee, D. (2003). Adaptive Power-Aware Prefetching Schemes for Mobile Broadcast Environments. In: Chen, MS., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds) Mobile Data Management. MDM 2003. Lecture Notes in Computer Science, vol 2574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36389-0_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-36389-0_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00393-9

  • Online ISBN: 978-3-540-36389-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics