This Article 
 Bibliographic References 
 Add to: 
Supporting Cooperative Caching in Ad Hoc Networks
January 2006 (vol. 5 no. 1)
pp. 77-89
Most researches in ad hoc networks focus on routing and not much work has been done on data access. A common technique used to improve the performance of data access is caching. Cooperative caching, which allows the sharing and coordination of cached data among multiple nodes, can further explore the potential of the caching techniques. Due to mobility and resource constraints of ad hoc networks, cooperative caching techniques designed for wired networks may not be applicable to ad hoc networks. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: CacheData, which caches the data, and CachePath, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (HybridCache), which can further improve the performance by taking advantage of CacheData and CachePath while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.

[1] C. Aggarwal, J. Wolf, and P. Yu, “Caching on the World Wide Web,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, Jan./Feb. 1999.
[2] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, 1999.
[3] J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, Oct. 1998.
[4] G. Cao, “Proactive Power-Aware Cache Management for Mobile Computing Systems,” IEEE Trans. Computer, vol. 51, no. 6, pp. 608-621, June 2002.
[5] G. Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, Sept./Oct. 2003, preliminary version appeared in Proc. ACM MobiCom'00.
[6] M. Cieslak, D. Foster, G. Tiwana, and R. Wilson, “Web Cache Coordination Protocol v2.0,” IETF Internet draft, http://www.ietf. org/internet-drafts/org/ internet-draftsdraft-wilson-wrec-wccp-v2-00.txt , 2000.
[7] S. Das, C. Perkins, and E. Royer, “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” Proc. IEEE INFOCOM, pp. 3-12, 2000.
[8] L. Fan, P. Cao, J. Almeida, and A. Broder, “Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol,” Proc. ACM SIGCOMM, pp. 254-265, 1998.
[9] T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM, 2001.
[10] C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. ACM MobiCom, Aug. 2000.
[11] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp. 153-181, Kluwer, 1996.
[12] Y. Ko and N. Vaidya, “Location-Aided Routing in Mobile Ad Hoc Networks,” Proc. ACM MobiCom, pp. 66-75, 1998.
[13] W. Lau, M. Kumar, and S. Venkatesh, “A Cooperative Cache Architecture in Supporting Caching Multimedia Objects in MANETs,” Proc. Fifth Int'l Workshop Wireless Mobile Multimedia, 2002.
[14] ns Notes and Documentation,, 2002.
[15] M. Papadopouli and H. Schulzrinne, “Effects of Power Conservation, Wireless Coverage, and Cooperation on Data Dissemination among Mobile Devices,” Proc. ACM MobiHoc, Oct. 2001.
[16] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, pp. 234-244, 1994.
[17] C. Perkins, E. Belding-Royer, and I. Chakeres, “Ad Hoc On Demand Distance Vector (AODV) Routing,” IETF Internet draft, draft-perkins-manet-aodvbis-00.txt, Oct. 2003.
[18] J. Pitkow and M. Recker, “A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns,” Proc. Second Int'l World Wide Web Conf., 1994.
[19] K. Ross, “Hash Routing for Collections of Shared Web Caches,” IEEE Networks, pp. 37-44, 1997.
[20] A. Rousskov and D. Wessels, “Cache Digests,” Computer Networks and ISDN Systems, vol. 30, no. 22-23, pp. 2155-2168, 1998.
[21] J. Shim, P. Scheuermann, and R. Vingralek, “Proxy Cache Algorithms: Design, Implementation, and Performance,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 4, July/Aug. 1999.
[22] D. Wessels and K. Claffy, “ICP and the Squid Web Cache,” IEEE J. Selected Areas in Comm., pp. 345-357, 1998.
[23] S. Williams, M. Abrams, C. Standridge, G. Abdulla, and E. Fox, “Removal Policies in Network Caches for World-Wide Web Documents,” Proc. ACM Sigcomm96, 1996.
[24] K. Wu and P. Yu, “Latency-Sensitive Hashing for Collaborative Web Caching,” Proc. World Wide Web Conf., pp. 633-644, 2000.
[25] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, pp. 70-84, July 2001.
[26] F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, “A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks,” Proc. ACM MobiCom, 2002.
[27] L. Yin, G. Cao, and Y. Cai, “A Generalized Target-Driven Cache Replacement Policy for Mobile Environments,” Proc. 2003 Int'l Symp. Applications and the Internet (SAINT), Jan. 2003.
[28] G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.

Index Terms:
Index Terms- Cooperative cache, cache management, cache replacement policy, ad hoc networks, data dissemination, simulations.
Liangzhong Yin, Guohong Cao, "Supporting Cooperative Caching in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 77-89, Jan. 2006, doi:10.1109/TMC.2006.15
Usage of this product signifies your acceptance of the Terms of Use.