ad-hoc on-demand distance vector

The Ad-hoc On-demand Distance Vector (AODV) routing algorithm is an algorithm for routing data across Wireless Mesh Networks. It is capable of both unicast and multicast routing. It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. In contrast, the most common routing protocols of the Internet are proactive, meaning they find routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-vector protocol.

External Links

http://moment.cs.ucsb.edu/AODV/aodv.html

<< Previous

Word Browser

Next >>

michael myers (halloween)
podge and rodge
temple of sun
jungle warfare
jim delahunt
vyacheslav pleve
yasuhiro abe
yoshiharu abe
alexander hanson
old norberg mountain district
skinnskatteberg mountain district

new kopparberg mountain district
nora and hjulsj mountain district
lindes and ramsberg mountain district
grythytte and hllefors mountain district
ghost (chess)
the downfall
bull of union with the copts
karlskoga mountain district
bockenem
aburadako
asiatic warriors

the third jungle book
campbelltown
nousukausi
abby (j pop)
wilbur de paris
antigua caribbean liberation movement
bob crosby
the man with the twisted lip
boursorama
go daddy
grey brother

yuji adachi
dillenburg
gwili andre
life bar
japanese bobtail
saint aurelius
morio agata
aura (disambiguation)
list of popular local toponyms
glossinidae
lindfield

Ad-hoc On-demand Distance Vector

See Also

External Links