A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
IEEE International Conference on Performance, Computing, and Communications, 2004
In this paper we investigate an up-todate gossip-based Ad Hoc routing algorithm (AODV+G)  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 moredoi:10.1109/pccc.2004.1301101 fatcat:w5dh5e7afzgnjejewc7uanlykq