Cooperative caching algorithm based on grouping nodes in mobile ad hoc networks

This paper investigates cooperative caching in mobile ad hoc networks. The network topology is partitioned into groups based on the physical network proximity. A cooperative caching algorithm based on grouping node is presented, which considers the query access frequency, the energy consumption of n...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Information and Automation pp. 1294 - 1298
Main Author Han, Ke
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Cache replacement
Cooperative caching
Costs
Energy consumption
Floods
Frequency
Grouping node
Mobile ad hoc networks
Network topology
Partitioning algorithms
Peer to peer computing
Wireless networks
Online AccessGet full text
ISBN1424457017
9781424457014
DOI10.1109/ICINFA.2010.5512114

Cover

More Information
Summary:This paper investigates cooperative caching in mobile ad hoc networks. The network topology is partitioned into groups based on the physical network proximity. A cooperative caching algorithm based on grouping node is presented, which considers the query access frequency, the energy consumption of nodes, changeable topology of nodes, and the data updating of nodes. In order to select the data items to be cached effectively, a caching cost estimation model is also presented. Simulation experimental results show that the caching algorithm achieves significant improvements in cache hit ratio and average query processing time in comparison with other caching strategies. Furthermore, the caching algorithm not only greatly decreases energy cost of a query but also adapts to characteristics of Ad Hoc wireless networks, including multi hop communication and dynamically changing topology.
ISBN:1424457017
9781424457014
DOI:10.1109/ICINFA.2010.5512114