 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n |
AODV
intends to improve on DSDV shortcomings
|
|
|
| n |
basic
idea: create routes only “on demand” to eliminate
|
|
|
overhead
of periodic broadcasts
|
|
|
| n |
problem:
if purely “on demand”, could lead to long
|
|
|
latencies
before first packet gets transmitted
|
|
|
| n |
AODV
assumes symmetric links between two nodes
|
|
|
| n |
discover
new nodes in neighborhood using local hello
|
|
|
|
messages
|
|
|
| n |
primary
objectives of AODV:
|
|
|
|
– |
broadcast
discovery packets only when necessary
|
|
|
– |
distinguish
between local connectivity changes and general
|
|
|
topological
maintenance
|
|
|
– |
disseminate
information about local changes only to those
|
|
|
neighboring
mobiles that are likely to need information
|
|
