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 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.

关键词： Cooperative caching Grouping node Mobile ad hoc networks Cache replacement

作者: Han Ke

作者单位: Department of Computer and Information Engineering Harbin University of Commerce Harbin,Heilongjiang Province,China

会议类型: 国际会议

会议名称: 2010 IEEE信息与自动化国际会议(ICIA 2010)

会议地点: 哈尔滨

会议语种:英文

页码: 1-5

在线出版日期: 2010-06-20（万方平台首次上网日期，不代表论文的发表时间）