Benefit-based Data Caching in Ad Hoc Networks

  • Authors:

  • Bin Tang;Himanshu Gupta;Samir Das

  • Affiliations:

  • Computer Science Department, Stony Brook University, Stony Brook, NY 11790. Email: bintang@cs.sunysb.edu;Computer Science Department, Stony Brook University, Stony Brook, NY 11790. Email: hgupta@cs.sunysb.edu;Computer Science Department, Stony Brook University, Stony Brook, NY 11790. Email: samir@cs.sunysb.edu

  • Venue:
  • ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the accesslatency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodeshave limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard.Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm thatprovably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit.The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to performclose to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulateour distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existingcaching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularlylarge in more challenging scenarios, such as higher access frequency and smaller memory.