Scalability study of cache access mechanisms in multiple-cell wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cache consistency in Wireless Multimedia Sensor Networks
Ad Hoc Networks
Analysis and performance study for coordinated hierarchical cache placement strategies
Computer Communications
Locus: a location-based data overlay for disruption-tolerant networks
Proceedings of the 5th ACM workshop on Challenged networks
A cooperative caching strategy in mobile ad hoc networks based on clusters
Proceedings of the 2011 International Conference on Communication, Computing & Security
Cooperative caching in mobile ad hoc networks through clustering
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Evaluation of a redirection technique in cooperative caching for MANETs
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Cooperative Caching in Mobile Ad Hoc Networks
International Journal of Mobile Computing and Multimedia Communications
Job scheduling and dynamic data replication in data grid environment
The Journal of Supercomputing
Community based cooperative content caching in social wireless networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Optimum Object Selection Made Easy
Wireless Personal Communications: An International Journal
MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
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. %