A Hoc On Demand Distance Vector

6206 Words25 Pages

4.1 A hoc On-Demand Distance Vector (AODV)
Ad hoc On-Demand Distance Vector (AODV) [1] Routing could be a routing protocol for (MANETs) and all other wireless ad-hoc networks. it 's collectively developed in Nokia centre, University of California, USA and University of cincinnati by C. Perkins, E. Belding-Royer and S. Das[16]. AODV is capable of each unicast and multicast routing. it 's a reactive routing protocol, that means that it establishes a route to a destination solely on demand. In distinction, the foremost common routing protocols of the internet are proactive, that means they notice routing route severally of the usage of the route. AODV is, because the name indicates, a distance-vector routing protocol. AODV avoids the counting-to-infinity weakness of different distance-vector protocols by use of sequence numbers on route updates.

4.2 Working
In AODV, the network is quiet until a connection is required. At that spot the network source that needs a transmission, broadcasts a request for connection. Other AODV intermediate nodes forward this message, and trace the node that they heard it from, create an detonation of temporary routes back to the source node. When a intermediate node receives such a message and already has a route to the target node, it sends a message backwards through a temporary route to the source node. The deprived node then begins using the route that has the least number of hops through other nodes. When a link
Get Access