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 application/pdf.
Adaptive gossip-based routing algorithm
IEEE International Conference on Performance, Computing, and Communications, 2004
Preserved Fulltext
In this paper we investigate an up-todate gossip-based Ad Hoc routing algorithm (AODV+G) [2] 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
doi:10.1109/pccc.2004.1395018
dblp:conf/ipccc/ShiS04
fatcat:tehpsyn4gfaorp7npx5q6b5qri