Adaptive gossip-based routing algorithm
Zhongmin Shi, Hong Shen · 2005
In this paper we investigate an up-to-date gossip-based ad hoc routing algorithm (AODV+G) [Z. J. Haas, et al., 2002] implemented in ad hoc on-demand distance vector routing (AODV) and discuss its weakness with respect to overall network routing performance. An enhanced approach, adaptive gossip-based ad hoc routing (AGAR), is introduced, simulated and compared with AODV+G. We expect that AGAR would outperform more significantly in larger scaled networks.