Some notes on AODV - An Ad Hoc Routing Protocol, from Ahmi Wolf.

From the intro page:
"The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes. It is loop-free, self-starting, and scales to large numbers of mobile nodes. "

This could be very useful for certain types of networked objects, when spontaneous and casual connections are needed, along the lines of edström, Holmquist, Dahlberg and Ljungstrand's Ad Hoc Information Spaces, among others.

The Mobility Management and Networking Lab (MOMENT), home of AODV.

Elizabeth M. Belding-Royer, who worked on AODV.