SlideShare a Scribd company logo
1 of 9
01001010100101011110010010100100101000101010110101010101010101010101010101010101010101010101100101001110100101010101010101010101010101010101010110101010101010101010101010101010101010101010101010101010101010101                                                                                          010101 101010                                                                                    11110011 101                                                                                                  1001 100 01010101010101010                                    100101111000100100 10101010101000001                                   1111100110101010 11101101001111101010111010011010101010100101010100 101010010101010110101010000010100000101101111111010 101001010100100101111110101100110010100110100100100                                       Ad-hoc On-Demand Distance Vector (AODV)Routing
When/Why do we need AODV? Basically when there is one node that wants to communicate with another node that is not in range, it finds a route through other nodes. In the example below node 1 is not in range with node 3, so it simply talks to node 3 through node 2. Node 1 Node 3 Node 2
How does it work? AODV Routing works by using Route Request Messages (RREQ) and Route Reply Messages (RREP).  If a node is not in range with a node that it wants to talk to, it sends a RREQ to its neighbors.   The RREQ contains source IP address and sequence number, and destination IP address and sequence number, as well as the life span of the RREQ.  If a neighbor of the source doesn’t know a route to the destination, it rebroadcasts the RREQ.  If a neighbor does know a route to the destination, it sends a RREP back to the source. Below, Node 1 is trying to                                             talk to node 5. RREP RREQ RREQ RREQ Node 4 Node 5 Node 3 Node 2 Node 1
How does it work? continued As seen in the last slide, node 4 had a route to node 5, so it sent node 1 a RREP.  Once node 1 receives the RREP, it notes the route to node 5 and sends the packet on that route.  SUCCESS!! Route 5 received the packet. RREP RREQ Node 1 Node 4 Node 5 Packet Packet
RREQ Now we can see it all in action! Node 1 Node 2 Node 3 RREP AODV Protocol Node 4 Node 5
Lets get more specific! Sequence Number: Each message contains a sequence number, which is essentially the age of the message.  This allows nodes to know how recent a message was sent, and it may allow nodes to find new, quicker routes. Life Span: Each message only last the time that is specified by its life span.  If the message dies before it reaches the destination, the source will resend the message with a longer life span.
And more specific… Hello Messages: These are simple messages that nodes send at certain time intervals to all its neighbors to let them know that it is still there.  If a node stops receiving hello messages from one of its neighbors, it knows that any routes through that node no longer exist.
It gets complicated! Things get much more complicated with many nodes. This is because nodes have many neighbors so RREQ get rebroadcasted a lot! That’s why sequence numbers and life spans                                                               are so key.
Error Messages RERR RERR are used mainly when nodes get moved around and connections are lost.  If a node receives a RERR, it deletes all routes associated with the new error.  Error messages are sent either when a message (not RREQ or RREP) is sent to a node that has no route to the destination, or when a route becomes invalid, or if it cannot communicate with one of its neighbors.

More Related Content

What's hot

Network Media and Data Transmission
Network Media and Data TransmissionNetwork Media and Data Transmission
Network Media and Data TransmissionClaisse Martinez
 
Classification of routing protocols
Classification of routing protocolsClassification of routing protocols
Classification of routing protocolsMenaga Selvaraj
 
Open Shortest Path First
Open Shortest Path FirstOpen Shortest Path First
Open Shortest Path FirstKashif Latif
 
Routing and routing algorithms
Routing and routing algorithmsRouting and routing algorithms
Routing and routing algorithmsBhatt Aadil
 
Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc  routing protocols cont..Lecture 11 14. Adhoc  routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..Chandra Meena
 
Multicast routing protocols in adhoc networks
Multicast routing protocols in adhoc networksMulticast routing protocols in adhoc networks
Multicast routing protocols in adhoc networksPradeep Kumar TS
 
Point to point protocol | PPP - Nitish Jadia
Point to point protocol | PPP - Nitish JadiaPoint to point protocol | PPP - Nitish Jadia
Point to point protocol | PPP - Nitish JadiaNitish Jadia
 
Multicast Routing Protocols
Multicast Routing ProtocolsMulticast Routing Protocols
Multicast Routing ProtocolsRam Dutt Shukla
 
Address resolution protocol (ARP)
Address resolution protocol (ARP)Address resolution protocol (ARP)
Address resolution protocol (ARP)NetProtocol Xpert
 
Multicastingand multicast routing protocols
Multicastingand multicast routing protocolsMulticastingand multicast routing protocols
Multicastingand multicast routing protocolsIffat Anjum
 
Congestion avoidance in TCP
Congestion avoidance in TCPCongestion avoidance in TCP
Congestion avoidance in TCPselvakumar_b1985
 

What's hot (20)

Network Media and Data Transmission
Network Media and Data TransmissionNetwork Media and Data Transmission
Network Media and Data Transmission
 
MANET VS VANET
MANET VS VANETMANET VS VANET
MANET VS VANET
 
Classification of routing protocols
Classification of routing protocolsClassification of routing protocols
Classification of routing protocols
 
Open Shortest Path First
Open Shortest Path FirstOpen Shortest Path First
Open Shortest Path First
 
Routing and routing algorithms
Routing and routing algorithmsRouting and routing algorithms
Routing and routing algorithms
 
Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc  routing protocols cont..Lecture 11 14. Adhoc  routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..
 
TCP and UDP
TCP and UDP TCP and UDP
TCP and UDP
 
Multicast routing protocols in adhoc networks
Multicast routing protocols in adhoc networksMulticast routing protocols in adhoc networks
Multicast routing protocols in adhoc networks
 
Point to point protocol | PPP - Nitish Jadia
Point to point protocol | PPP - Nitish JadiaPoint to point protocol | PPP - Nitish Jadia
Point to point protocol | PPP - Nitish Jadia
 
Multiprocessor system
Multiprocessor system Multiprocessor system
Multiprocessor system
 
X.25
X.25X.25
X.25
 
Routing protocols
Routing protocolsRouting protocols
Routing protocols
 
Multicast Routing Protocols
Multicast Routing ProtocolsMulticast Routing Protocols
Multicast Routing Protocols
 
Address resolution protocol (ARP)
Address resolution protocol (ARP)Address resolution protocol (ARP)
Address resolution protocol (ARP)
 
X.25 protocol
X.25 protocolX.25 protocol
X.25 protocol
 
X.25 and frame relay
X.25 and frame relayX.25 and frame relay
X.25 and frame relay
 
Multicastingand multicast routing protocols
Multicastingand multicast routing protocolsMulticastingand multicast routing protocols
Multicastingand multicast routing protocols
 
Presentation on arp protocol
Presentation on arp protocolPresentation on arp protocol
Presentation on arp protocol
 
Congestion avoidance in TCP
Congestion avoidance in TCPCongestion avoidance in TCP
Congestion avoidance in TCP
 
Routing
RoutingRouting
Routing
 

Viewers also liked

Dynamic source routing
Dynamic source routingDynamic source routing
Dynamic source routingAshraf Uddin
 
Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Shaikhul Islam Chowdhury
 
Wireless routing protocols
Wireless routing protocolsWireless routing protocols
Wireless routing protocolsbarodia_1437
 
Ad-hoc routing protocols
Ad-hoc routing protocolsAd-hoc routing protocols
Ad-hoc routing protocolsRama Raman
 
proactive and reactive routing comparisons
proactive and reactive routing comparisonsproactive and reactive routing comparisons
proactive and reactive routing comparisonsITM Universe - Vadodara
 
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2Sushant Kushwaha
 
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECT
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECTPerformance Analysis of AODV and DSDV - FINAL YEAR PROJECT
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECTRavi Teja P
 
Formation Outils collaboratifs
Formation Outils collaboratifsFormation Outils collaboratifs
Formation Outils collaboratifsMalvina ARTHEAU
 
Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolComparison between aodv and olsr protocol
Comparison between aodv and olsr protocolMehedi
 
FINAL PROJECT REPORT
FINAL PROJECT REPORTFINAL PROJECT REPORT
FINAL PROJECT REPORTSoham Wadekar
 
An intrusion detection system for detecting malicious nodes in manet using tr...
An intrusion detection system for detecting malicious nodes in manet using tr...An intrusion detection system for detecting malicious nodes in manet using tr...
An intrusion detection system for detecting malicious nodes in manet using tr...ijctet
 
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1Sushant Kushwaha
 

Viewers also liked (20)

AODV Protocol
AODV ProtocolAODV Protocol
AODV Protocol
 
AODV protocol
AODV protocolAODV protocol
AODV protocol
 
Dynamic source routing
Dynamic source routingDynamic source routing
Dynamic source routing
 
Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34
 
DSR Protocol
DSR ProtocolDSR Protocol
DSR Protocol
 
Wireless routing protocols
Wireless routing protocolsWireless routing protocols
Wireless routing protocols
 
Manet ppt
Manet pptManet ppt
Manet ppt
 
Ad-Hoc Networks
Ad-Hoc NetworksAd-Hoc Networks
Ad-Hoc Networks
 
Ad-hoc routing protocols
Ad-hoc routing protocolsAd-hoc routing protocols
Ad-hoc routing protocols
 
Improvement Of DSR Protocol
Improvement Of DSR ProtocolImprovement Of DSR Protocol
Improvement Of DSR Protocol
 
proactive and reactive routing comparisons
proactive and reactive routing comparisonsproactive and reactive routing comparisons
proactive and reactive routing comparisons
 
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2
 
3586
35863586
3586
 
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECT
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECTPerformance Analysis of AODV and DSDV - FINAL YEAR PROJECT
Performance Analysis of AODV and DSDV - FINAL YEAR PROJECT
 
Formation Outils collaboratifs
Formation Outils collaboratifsFormation Outils collaboratifs
Formation Outils collaboratifs
 
Proactive vs Reactive
Proactive vs ReactiveProactive vs Reactive
Proactive vs Reactive
 
Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolComparison between aodv and olsr protocol
Comparison between aodv and olsr protocol
 
FINAL PROJECT REPORT
FINAL PROJECT REPORTFINAL PROJECT REPORT
FINAL PROJECT REPORT
 
An intrusion detection system for detecting malicious nodes in manet using tr...
An intrusion detection system for detecting malicious nodes in manet using tr...An intrusion detection system for detecting malicious nodes in manet using tr...
An intrusion detection system for detecting malicious nodes in manet using tr...
 
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1
 

Similar to Aodv slide

IP Routing
IP RoutingIP Routing
IP RoutingBU
 
ERROR DETECTION data communication and computer network.pptx
ERROR DETECTION data communication and computer network.pptxERROR DETECTION data communication and computer network.pptx
ERROR DETECTION data communication and computer network.pptxgadisaAdamu
 
ERROR_DETECTION.pptx
ERROR_DETECTION.pptxERROR_DETECTION.pptx
ERROR_DETECTION.pptxBeniamTekeste
 

Similar to Aodv slide (7)

Aodv slide final
Aodv slide finalAodv slide final
Aodv slide final
 
Aodv guide
Aodv guideAodv guide
Aodv guide
 
IP Routing
IP RoutingIP Routing
IP Routing
 
ERROR DETECTION data communication and computer network.pptx
ERROR DETECTION data communication and computer network.pptxERROR DETECTION data communication and computer network.pptx
ERROR DETECTION data communication and computer network.pptx
 
Lecture 20
Lecture 20Lecture 20
Lecture 20
 
Encoding
EncodingEncoding
Encoding
 
ERROR_DETECTION.pptx
ERROR_DETECTION.pptxERROR_DETECTION.pptx
ERROR_DETECTION.pptx
 

Aodv slide

  • 1. 01001010100101011110010010100100101000101010110101010101010101010101010101010101010101010101100101001110100101010101010101010101010101010101010110101010101010101010101010101010101010101010101010101010101010101 010101 101010 11110011 101 1001 100 01010101010101010 100101111000100100 10101010101000001 1111100110101010 11101101001111101010111010011010101010100101010100 101010010101010110101010000010100000101101111111010 101001010100100101111110101100110010100110100100100 Ad-hoc On-Demand Distance Vector (AODV)Routing
  • 2. When/Why do we need AODV? Basically when there is one node that wants to communicate with another node that is not in range, it finds a route through other nodes. In the example below node 1 is not in range with node 3, so it simply talks to node 3 through node 2. Node 1 Node 3 Node 2
  • 3. How does it work? AODV Routing works by using Route Request Messages (RREQ) and Route Reply Messages (RREP). If a node is not in range with a node that it wants to talk to, it sends a RREQ to its neighbors. The RREQ contains source IP address and sequence number, and destination IP address and sequence number, as well as the life span of the RREQ. If a neighbor of the source doesn’t know a route to the destination, it rebroadcasts the RREQ. If a neighbor does know a route to the destination, it sends a RREP back to the source. Below, Node 1 is trying to talk to node 5. RREP RREQ RREQ RREQ Node 4 Node 5 Node 3 Node 2 Node 1
  • 4. How does it work? continued As seen in the last slide, node 4 had a route to node 5, so it sent node 1 a RREP. Once node 1 receives the RREP, it notes the route to node 5 and sends the packet on that route. SUCCESS!! Route 5 received the packet. RREP RREQ Node 1 Node 4 Node 5 Packet Packet
  • 5. RREQ Now we can see it all in action! Node 1 Node 2 Node 3 RREP AODV Protocol Node 4 Node 5
  • 6. Lets get more specific! Sequence Number: Each message contains a sequence number, which is essentially the age of the message. This allows nodes to know how recent a message was sent, and it may allow nodes to find new, quicker routes. Life Span: Each message only last the time that is specified by its life span. If the message dies before it reaches the destination, the source will resend the message with a longer life span.
  • 7. And more specific… Hello Messages: These are simple messages that nodes send at certain time intervals to all its neighbors to let them know that it is still there. If a node stops receiving hello messages from one of its neighbors, it knows that any routes through that node no longer exist.
  • 8. It gets complicated! Things get much more complicated with many nodes. This is because nodes have many neighbors so RREQ get rebroadcasted a lot! That’s why sequence numbers and life spans are so key.
  • 9. Error Messages RERR RERR are used mainly when nodes get moved around and connections are lost. If a node receives a RERR, it deletes all routes associated with the new error. Error messages are sent either when a message (not RREQ or RREP) is sent to a node that has no route to the destination, or when a route becomes invalid, or if it cannot communicate with one of its neighbors.