Research on Anycasting Routing Based on Heuristic Ring Searching Algorithm in MANET
Yong Liu · Chinese Journal of Computers · 2005
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.