| Energy-efficient data caching and prefetching for mobile devices based on utility |
| Full text |
Pdf
(866 KB)
|
| Source
|
Mobile Networks and Applications
archive
Volume 10 , Issue 4 (August 2005)
table of contents
Pages: 475 - 486
Year of Publication: 2005
ISSN:1383-469X
|
|
Authors
|
|
Huaping Shen
|
Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
|
|
Mohan Kumar
|
Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
|
|
Sajal K. Das
|
Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
|
|
Zhijun Wang
|
Center for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
|
|
| Publisher |
Kluwer Academic Publishers
Hingham, MA, USA
|
| Bibliometrics |
Downloads (6 Weeks): 36, Downloads (12 Months): 103, Citation Count: 3
|
|
|
ABSTRACT
In mobile computing environments, vital resources like battery power and wireless channel bandwidth impose significant challenges in ubiquitous information access. In this paper, we propose a novel energy and bandwidth efficient data caching mechanism, called GreedyDual Least Utility (GD-LU), that enhances dynamic data availability while maintaining consistency. The proposed utility-based caching mechanism considers several characteristics of mobile distributed systems, such as connection-disconnection, mobility handoff, data update and user request patterns to achieve significant energy savings in mobile devices. We develop an analytical model for energy consumption of mobile devices in a dynamic data environment. Based on the utility function derived from the analytical model, we propose algorithms for cache replacement and passive prefetching of data objects. Our comprehensive simulation experiments demonstrate that the proposed caching mechanism achieves more than 10% energy saving and near-optimal performance tradeoff between access latency and energy consumption.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
[5] L. Breslau, P. Cao, J. Fan, G. Phillips and S. Shenker, Web caching and zipf-like distributions: Evidence and implications, in IEEE Proceedings of INFOCOM (1999) pp. 126-134.
|
| |
6
|
|
 |
7
|
|
| |
8
|
[8] P. Cao and S. Irani, Cost-aware WWW proxy caching algorithms, in: Proc. USENIX Symp. Internet Technologies and Systems (Dec 1997) pp. 193-206.
|
 |
9
|
Li Fan , Pei Cao , Wei Lin , Quinn Jacobson, Web prefetching between low-bandwidth clients and proxies: potential and performance, Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.178-187, May 01-04, 1999, Atlanta, Georgia, United States
|
| |
10
|
[10] L. Feeney and M. Nilsson, Investigating the energy consumption of a wireless network interface in an ad hoc networking environment, in: IEEE Proceedings of INFOCOM (2001), Vol. 5, no. 8.
|
| |
11
|
[11] S. Gitzenis and N. Bambos, Power-controlled data prefetching/caching in wireless packet networks, in: IEEE Proceedings of INFOCOM 2002, New York, June 2002.
|
| |
12
|
|
| |
13
|
|
| |
14
|
[14] W.H.O. Lau, M. Kumar and S. Venkatesh, A cache-based mobility-aware scheme for real-time continuous media delivery in wireless networks, in: IEEE International Conference on Multimedia and Expo. (2001).
|
 |
15
|
|
 |
16
|
|
| |
17
|
|
| |
18
|
[18] H. Shen, M. Kumar, S.K. Das and Z. Wang, Energy-efficient caching and prefetching with data consistency in mobile distributed systems, in: IEEE International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, NM (April 2004).
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
[26] N.E. Young, The K-server dual and loose competitivenesss for paging, Algorithmica 11(6) (1994) 525-541.
|
CITED BY 3
|
|
|
|
|
Chiara Boldrini , Marco Conti , Andrea Passarella, ContentPlace: social-aware data dissemination in opportunistic networks, Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems, October 27-31, 2008, Vancouver, British Columbia, Canada
|
|
|
|
|