A pseudo gossip routing algorithm in mobile ad hoc networks

Many routing algorithms, proposed for ad hoc wireless networks, are based on source routing scheme. In routing protocols that use flooding, many routing messages are propagated unnecessarily. Gossiping can be used to significantly reduce the number of routing messages sent. When a route is broken, route recovery and maintenance are executed. However, these procedures consume many resources. With a reactive routing protocol, this leads to increased delay and routing overheads while route repair procedures are carried out. To minimize route breaking, it's important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dense ad hoc wireless networks, and it's due to the edge effect. In this paper, we derive the statistic results of link and path availability properties in ad hoc network, and propose a pseudo gossip routing algorithm based on the link stability. This routing algorithm can select a reliable path that can last longer by using fewer routing messages as to be shown by the simulation results.