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

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
 
Comparison of different MANET routing protocols in wireless ADHOC
Comparison of different MANET routing protocols in wireless ADHOCComparison of different MANET routing protocols in wireless ADHOC
Comparison of different MANET routing protocols in wireless ADHOCAmitoj Kaur
 
MANET Routing Protocols , a case study
MANET Routing Protocols , a case studyMANET Routing Protocols , a case study
MANET Routing Protocols , a case studyRehan Hattab
 
AODV (adhoc ondemand distance vector routing)
AODV (adhoc ondemand distance vector routing) AODV (adhoc ondemand distance vector routing)
AODV (adhoc ondemand distance vector routing) ArunChokkalingam
 
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...Jean de la Sagesse
 
Routing in Manet
Routing in ManetRouting in Manet
Routing in Manetshiujinghan
 
Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)ArunChokkalingam
 
Wireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsWireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsVirendra Thakur
 
Classification of routing protocols
Classification of routing protocolsClassification of routing protocols
Classification of routing protocolsMenaga Selvaraj
 
Wsn routing protocol
Wsn routing protocolWsn routing protocol
Wsn routing protocolSuganthiN2
 
Distance Vector & Link state Routing Algorithm
Distance Vector & Link state Routing AlgorithmDistance Vector & Link state Routing Algorithm
Distance Vector & Link state Routing AlgorithmMOHIT AGARWAL
 
Applications of WSN
Applications of WSNApplications of WSN
Applications of WSNADEEBANADEEM
 
BGP (Border Gateway Protocol)
BGP (Border Gateway Protocol)BGP (Border Gateway Protocol)
BGP (Border Gateway Protocol)NetProtocol Xpert
 
LTE Basic Principle
LTE Basic PrincipleLTE Basic Principle
LTE Basic PrincipleTaiz Telecom
 

What's hot (20)

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..
 
Comparison of different MANET routing protocols in wireless ADHOC
Comparison of different MANET routing protocols in wireless ADHOCComparison of different MANET routing protocols in wireless ADHOC
Comparison of different MANET routing protocols in wireless ADHOC
 
MANET Routing Protocols , a case study
MANET Routing Protocols , a case studyMANET Routing Protocols , a case study
MANET Routing Protocols , a case study
 
Lte protocols
Lte protocolsLte protocols
Lte protocols
 
Dsdv
DsdvDsdv
Dsdv
 
AODV (adhoc ondemand distance vector routing)
AODV (adhoc ondemand distance vector routing) AODV (adhoc ondemand distance vector routing)
AODV (adhoc ondemand distance vector routing)
 
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...
2 g and 3g kpi improvement by parameter optimization (nsn, ericsson, huawei) ...
 
Routing in Manet
Routing in ManetRouting in Manet
Routing in Manet
 
Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)
 
Wireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsWireless Sensor Network Routing Protocols
Wireless Sensor Network Routing Protocols
 
Classification of routing protocols
Classification of routing protocolsClassification of routing protocols
Classification of routing protocols
 
20121120 handover in lte
20121120 handover in lte20121120 handover in lte
20121120 handover in lte
 
Wsn routing protocol
Wsn routing protocolWsn routing protocol
Wsn routing protocol
 
Distance Vector & Link state Routing Algorithm
Distance Vector & Link state Routing AlgorithmDistance Vector & Link state Routing Algorithm
Distance Vector & Link state Routing Algorithm
 
Applications of WSN
Applications of WSNApplications of WSN
Applications of WSN
 
Routing
RoutingRouting
Routing
 
BGP (Border Gateway Protocol)
BGP (Border Gateway Protocol)BGP (Border Gateway Protocol)
BGP (Border Gateway Protocol)
 
LTE Basic Principle
LTE Basic PrincipleLTE Basic Principle
LTE Basic Principle
 
Slide 11516
Slide 11516Slide 11516
Slide 11516
 
Lte questions adv
Lte questions advLte questions adv
Lte questions adv
 

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
 
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
 
DYNAMIC SOURCE ROUTING (DSR)
DYNAMIC SOURCE ROUTING  (DSR)DYNAMIC SOURCE ROUTING  (DSR)
DYNAMIC SOURCE ROUTING (DSR)
 

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.