The Ad-hoc On-demand Distance Vector (AODV) routing algorithm is an algorithm for routing data across Wireless mesh network. 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 routing protocol protocol. In AODV, the network is silent until a connection is needed. At that point the network node that needs a connection broadcasts a request for connection. Other AODV nodes forward this message, and record the node that they heard it from, creating an explosion of temporary routes back to the needy node. When a node receives such a message and already has a route to the desired node, it sends a message backwards through a temporary route to the requesting node. The needy node then begins using the route that has the least number of hops through other nodes. Unused entries in the routing tables are recycled after a time. When a link fails, a routing error is passed back to a transmitting node, and the process repeats. Much of the complexity of the protocol is to lower the number of messages to conserve the capacity of the network. For example, each request for a route has a sequence number. Nodes use this sequence number so that they do not repeat route requests that they have already passed on. Another such feature is that the route requests have a "time to live" number that limits how many times they can be retransmitted. Another such feature is that if a route request fails, another route request may not be sent until twice as much time has passed as the timeout of the previous route request. The advantage of AODV is that it creates no extra traffic for communication along existing links. Also, distance vector routing is simple, and doesn't require much memory or calculation. However AODV requires more time to establish a connection, and the initial communication to establish a route is heavier than some other approaches. AODV is one of several solutions to this problem. Another is Dynamic Source Routing, which substantially optmizes the network traffic. Another is OLSR, a Link-state routing protocol solving the same problem. OLSR continuously collects data about which nodes can talk to each other, and maintains an optimized routing table to every other node. So, connections are made quickly. However, OLSR is a relatively large, complex program that requires a large complex computer and significant amounts of memory and calculation. Also, the communication to discover network members occurs continuously and is a significant burden. For other alternatives see the Ad hoc protocol list. ==See Also== *Mesh networks *Wireless mesh network *Mobile ad-hoc network *Ad hoc protocol list ==External Links== *http://www.ietf.org/rfc/rfc3561.txt Request for Comments on AODV- the specification *http://moment.cs.ucsb.edu/AODV/aodv.html Wireless networking Network protocols
See other meanings of words starting from letter:
Words begining with Ad-hoc_On-demand_Distance_Vector:
Ad-hoc_On-demand_Distance_Vector
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 network. 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 routing protocol protocol. In AODV, the network is silent until a connection is needed. At that point the network node that needs a connection broadcasts a request for connection. Other AODV nodes forward this message, and record the node that they heard it from, creating an explosion of temporary routes back to the needy node. When a node receives such a message and already has a route to the desired node, it sends a message backwards through a temporary route to the requesting node. The needy node then begins using the route that has the least number of hops through other nodes. Unused entries in the routing tables are recycled after a time. When a link fails, a routing error is passed back to a transmitting node, and the process repeats. Much of the complexity of the protocol is to lower the number of messages to conserve the capacity of the network. For example, each request for a route has a sequence number. Nodes use this sequence number so that they do not repeat route requests that they have already passed on. Another such feature is that the route requests have a "time to live" number that limits how many times they can be retransmitted. Another such feature is that if a route request fails, another route request may not be sent until twice as much time has passed as the timeout of the previous route request. The advantage of AODV is that it creates no extra traffic for communication along existing links. Also, distance vector routing is simple, and doesn't require much memory or calculation. However AODV requires more time to establish a connection, and the initial communication to establish a route is heavier than some other approaches. AODV is one of several solutions to this problem. Another is Dynamic Source Routing, which substantially optmizes the network traffic. Another is OLSR, a Link-state routing protocol solving the same problem. OLSR continuously collects data about which nodes can talk to each other, and maintains an optimized routing table to every other node. So, connections are made quickly. However, OLSR is a relatively large, complex program that requires a large complex computer and significant amounts of memory and calculation. Also, the communication to discover network members occurs continuously and is a significant burden. For other alternatives see the Ad hoc protocol list. ==See Also== *Mesh networks *Wireless mesh network *Mobile ad-hoc network *Ad hoc protocol list ==External Links== *http://www.ietf.org/rfc/rfc3561.txt Request for Comments on AODV- the specification *http://moment.cs.ucsb.edu/AODV/aodv.html Wireless networking Network protocols
See other meanings of words starting from letter:
A
AB | AC | AD | AE | AF | AG | AH | AI | AJ | AK | AL | AM | AN | AO | AP | AR | AS | AT | AU | AW | AX | AY | AZ |Words begining with Ad-hoc_On-demand_Distance_Vector:
Ad-hoc_On-demand_Distance_Vector
Sponsored links: praca.
These materials are based on Wikipedia and licensed under the GNU FDL
YouTube.com videos better site than Turbo Tax 2007
