Abstract: A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. These routing protocols are based on (some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. The network simulator ns-2 is used to accurately model the particular wireless network and to analyze the performance.
P. Sengottuvelan , C. Palanisamy and Amitabh Wahi , 2007. Incorporation of Gossip Based Approach in Ad-Hoc On-Demand Distance Vector (AODV) Routing. Asian Journal of Information Technology, 6: 1253-1259.