Energy-Efficient Cache Replacement Policies for Cooperative Caching in Mobile Ad Hoc Network

Data caching on mobile clients is widely seen as an effective solution to improve system performance. In particular, cooperative caching, based on the idea of sharing and coordination of cache data among multiple users, can be particularly effective for information access in mobile ad hoc networks where mobile clients moving frequently and network topology changing dynamically. Most existing cache strategies perform replacement independently, and they seldom consider coordinated replacement and energy saving issues in the context of a mobile ad hoc network. This paper analysed the impact of energy on designing a cache replacement policy and formulate the energy-efficient coordinated cache replacement problem (ECORP) as a 0-1 knapsack problem. A heuristic algorithm called ECORP-greedy and an optimal solution called ECORP-OPT are presented to solve the problem. Simulations show that the proposed policies can significantly reduce energy consumption and access latency when compared to other replacement policies.

[1]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Takahiro Hara,et al.  Cooperative caching by mobile clients in push-based information systems , 2002, CIKM '02.

[3]  Jianliang Xu,et al.  Performance evaluation of an optimal cache replacement policy for wireless data dissemination , 2004, IEEE Transactions on Knowledge and Data Engineering.

[4]  Vikram Srinivasan,et al.  Energy-efficient caching strategies in ad hoc wireless networks , 2003, MobiHoc '03.

[5]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[6]  Françoise Sailhan,et al.  Cooperative Caching in Ad Hoc Networks , 2003, Mobile Data Management.

[7]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8]  Peter Scheuermann,et al.  Proxy Cache Algorithms: Design, Implementation, and Performance , 1999, IEEE Trans. Knowl. Data Eng..

[9]  Chita R. Das,et al.  A novel caching scheme for improving Internet-based mobile ad hoc networks performance , 2006, Ad Hoc Networks.

[10]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[11]  Philip S. Yu,et al.  Energy-efficient caching for wireless mobile computing , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[12]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Ahmed Amer,et al.  Towards universal mobile caching , 2005, MobiDE '05.

[14]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[15]  Mohan Kumar,et al.  Energy-efficient caching and prefetching with data consistency in mobile distributed systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..