一种MANET环境下基于兴趣度的协同缓存策略  

Interest Based Cooperative Caching Strategy in Mobile Ad Hoc Networks

作　　者：卢炎生[1] 巫建文[1] 娄强[1] 

机构地区：[1]华中科技大学计算机学院,湖北武汉430074

出　　处：《小型微型计算机系统》2008年第2期232-237,共6页Journal of Chinese Computer Systems

基　　金：湖北省自然科学基金项目(ABA048)资助

摘　　要：MANET网络中由于节点移动的随机性和无线链路的断连性,导致网络拓扑变化频繁,从而降低了数据可访问能力.提出一种基于兴趣度的协同缓存策略(IBCC).其主要思想是:针对节点转发的数据请求消息,引入ω-稳定节点集定义和兴趣度概念,定期挖掘ω-稳定节点集中具有相同兴趣度的数据形成预取集;针对回复的数据消息形成数据定位表,通过查找数据定位表将请求发送给同样拥有该数据但路由跳数较少的节点.该策略提高了在出现链路断接时节点对数据的访问能力.仿真实验结果证明该策略的有效性.In mobile ad hoc networks, because of the mobility of nodes and disconnection of wireless channel, network topology changes frequently, which reduces data accessibility. An interest based cooperative caching strategy （IBCC） is presented in this paper. The main idea is; for data request messages forwarded by nodes, the notions of-stable node set and interest are introduced, Mining data with the same interest based on data request message log can form data prefetch set of-stable node set.; For reply data messages can form data location table that will be used to redirect data request messages to the nodes which have this data but fewer hops. The strategy increases data accessibility and is proved validity through simulation.

关 键 词：协同缓存 兴趣度 移动AD HOC网络 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]