Scribd
Upload
20 views

AODV

Contains a short description on Ad-Hoc Distance Vector routing, its problems and advantages over other wireless proactive routing protocols.

Uploaded by

Bharat Khatri
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
20 views

AODV

Contains a short description on Ad-Hoc Distance Vector routing, its problems and advantages over other wireless proactive routing protocols.

Uploaded by

Bharat Khatri
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
You are on page 1/ 2

Adhoc On Demand Distance Vector(AODV) Routing

AODV is a routing protocol for MANETs and other wireless adhoc networks. Forwarding Vs Routing Forwarding <Data Plane> : It's more about USING the forwarding table. Routing <Control Plane> : Routers talk amongst themselves to find the shortest path. It's more about CREATING the forwarding table.

DV algorithms are iterative and asynchronous. DV algorithms face the 'count to infinity' problem. The RREQ message contains the source, the destination, the TTL(lifespan) field, Bcast ID and a sequence number which serves as a timestamp. The pair of src ID and Bcast ID serves as a unique identifier for the RREQ request. The sequence numbers serve as timestamps; they allow nodes to gauge how fresh is their information on other nodes. Nodes also use the sequence number to ensure that they don't re-broadcast a RREQ message. Each node records the sequence number of all the nodes it talks to. Characteristics 1) On-demand routing 2) Periodic HELLO messages to keep track of neighbours. (Such periodic beaconing leads to overhead)

Adhoc On Demand Distance Vector(AODV) Routing

Every node maintains a monotonically increasing sequence number which is incremented each time a node notices a change in its neighbour topology. Many protocols like AODV, DSR etc employ flooding of control packets to discover new routes given that the overhead of conrol packet flooding is amortized over data packets being transferred betwen consecutive control flow floods. Broadcasting in wireless networks through FLOODING is a problem if two nodes try to transmit packets to their common neighbour at the same time. Is it the RERR messages that pervent the 'count-to-infinity' problem or the use of sequence numbers ?

You might also like