移动自组网络中基于启发式环索算法的Anycasting路由的研究  

Research on Anycasting Routing Based on Heuristic Ring Searching Algorithm in MANET

作　　者：刘永强[1] 严伟[1] 

机构地区：[1]北京大学信息科学技术学院网络与分布式系统实验室,北京100871

出　　处：《计算机学报》2005年第10期1608-1613,共6页Chinese Journal of Computers

基　　金：国家自然科学基金(60273002);国家"八六三"高技术研究发展计划项目基金(2001AA2130)资助.~~

摘　　要：移动无线自组网络(MobileAdHocNetworks)是一种新型的无线网络,网络中不需要固定通信设施的支持,具有很高的灵活性.任播路由(AnycastingRouting)在移动无线自组网络中有着十分重要的潜在应用.该文提出的基于启发式环索算法的Anycasting路由在路由请求过程中能够根据以前搜索中获得的“先验”知识动态地调整搜索的参数,使搜索总是向着“最可能”的方向进行.模拟实验表明,采用启发式环索算法的混合式Anycasting路由在不影响路由正确性的情况下能极大地减少网络中无用的路由请求消息,从而提高网络的整体性能.Mobile Ad Hoc Networks is a kind of novel wireless network. Being independent on fixed network establishment it is more flexible. Anycasting routing has great advantages in Ad Hoc networks with many potential applications. This paper proposes a heuristic ring searching algorithm which is used to optimize the anycasting routing discovery and minimize the overhead of ad hoc network. Compared with original anycasting routing approaches, the anycasting routing based on heuristic ring searching is more sophisticated and efficient. It is a hybrid routing method combined with the advantages of proactive and reactive discovery. Being accessed frequently in the network, the anycasting host advertises its presence periodically throughout its zone by proactively updating the routing entries of the nodes in the zone and the nodes outside the zone execute an effective ring search when needing anycasting service. Furthermore, based on probability characteristic, the cached “experience” is used to optimize search arguments such as TTL and start hop. Simulation results show that above routing approach almost has the same performance with other ones in Packet Delivery and Mean Hops, but the network overhead is reduced nearly 40 %. So without loss of routing accuracy, the anycasting routing based on heuristic ring search can greatly improve the ad hoc network performance.

关 键 词：移动自组网 Anycasting路由 启发式环索算法 网络直径 递减因子 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]