By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Han Ke ; Dept. of Comput. & Inf. Eng., Harbin Univ. of Commerce, Harbin, China

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.

Published in:

Information and Automation (ICIA), 2010 IEEE International Conference on

Date of Conference:

20-23 June 2010