The Community for Technology Leaders
Green Image
Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodes have limited memory. % In this article, we consider the cache placement problem of minimizing total data access cost in ad hoc networks with multiple data items and nodes with limited memory capacity. % The above optimization problem is known to be NP-hard. % Defining {\\em benefit} as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably 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 perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. % We simulate our distributed algorithm using a network simulator ({\\em ns2}), and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao~\\cite{YC}) in all important performance metrics. The performance differential is particularly large in more challenging scenarios, such as higher access frequency and smaller memory. %
Data Caching, Cache replacement policy, ad hoc neworks, Network Protocols, Algorithm/protocol design and analysis, Simulation
Samir R. Das, Bin Tang, Himanshu Gupta, "Benefit-Based Data Caching in Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 289-304, March 2008, doi:10.1109/TMC.2007.70770
82 ms
(Ver 3.3 (11022016))