• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Information and Automation >Cooperative Caching Algorithm based on Grouping Nodes in Mobile Ad Hoc Networks
【24h】

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.
机译：本文调查了移动临时网络中的协同缓存。基于物理网络接近度，网络拓扑分区为组。提出了一种基于分组节点的协作缓存算法，其考虑了查询访问频率，节点的能量消耗，节点的可变拓扑以及节点的数据更新。为了选择有效地缓存的数据项，还呈现了缓存成本估计模型。仿真实验结果表明，与其他缓存策略相比，缓存算法实现了高速缓存命中率和平均查询处​​理时间的显着改进。此外，缓存算法不仅大大降低了查询的能量成本，而且还适应了临时无线网络的特性，包括多跳通通信和动态变化的拓扑。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号