410 likes | 688 Views
A O D V. What is AODV?. Routing Protocol running into Ad-hoc Network. Dynamic Limited Resource Not Stationary. Have a active field Make route when it needs Reduce unnecessary forwarding Maintain Timer. Routing Table. 2. 5. 3. 1. 6. 4. AODV Control Packet. RREQ.
E N D
What is AODV? Routing Protocol running into Ad-hoc Network Dynamic Limited Resource Not Stationary Have a active field Make route when it needs Reduce unnecessary forwarding Maintain Timer
Routing Table 2 5 3 1 6 4
AODV Control Packet RREQ : Route Request RREP : Route Reply RREP-ACK : Route Reply-Ack RERR : Inform Broken Link
AODV Control Packet RREQ RREQ 1 boradcasting RREP 3 2 4 5 RREP-ACK 6 RERR
AODV Control Packet RREQ 1 boradcasting RREP 3 RREQ 2 4 5 RREP-ACK RREQ 6 RERR
AODV Control Packet RREQ 1 boradcasting RREP 3 2 4 RREQ 5 RREP-ACK RREQ 6 RERR
AODV Control Packet RREQ 1 RREP RREP 3 2 4 RREP 5 RREP-ACK unicasting RREP 6 RERR
AODV Control Packet RREQ 1 RERR RREP 3 2 4 RERR 5 RREP-ACK RERR 6
Example – Send RREQ RREQ 1 2 3 4 Update info About previous hop Update info About Originator
Example – Send RREQ RREQ 1 2 3 4 Update info About previous hop Update info About Originator
Example – Send RREQ RREQ 1 2 3 4 Update info About previous hop Update info About Originator
Example – Send RREQ RREQ 1 2 3 4 Update info About previous hop Update info About Originator
Example – Send RREP RREP 1 2 3 4 Update info About previous hop Update info About Destination
Example – Send RREP RREP 1 2 3 4 Update info About previous hop Update info About Destination
Example – Send RREP RREP 1 2 3 4 Update info About previous hop Update info About Destination
Example – Send RREP RREP 1 2 3 4 Update info About previous hop Update info About Destination
Example – Send RERR 6 7 1 4 3 2 5 While RREP is forwarding, previous node is inserted to precursor list
Example – Send RERR 6 7 RREP 1 4 3 2 5 While RREP is forwarding, previous node is inserted to precursor list
Example – Send RERR 6 7 RREP 1 4 3 2 5 While RREP is forwarding, previous node is inserted to precursor list
Example – Send RERR 6 7 RREP 1 4 3 2 5 While RREP is forwarding, previous node is inserted to precursor list
Example – Send RERR 6 7 RREP 1 4 3 2 5 While RREP is forwarding, previous node is inserted to precursor list
Example – Send RERR 6 7 1 4 3 2 5
Example – Send RERR 6 7 1 4 RERR 3 RERR RERR 2 5
Example – Send RERR 7 9 10 RERR RERR RERR
Maintain Sequence Number Seq# = Freshness of packet 6 7 3 MYSEQ=2 MYSEQ=4 RREP 8 1 5 9 4 2 Discard packet which have lower seq#
Maintain Sequence Number 1) Update seq# when node generate new rreq packet. 6 7 3 MYSEQ=1 8 1 4 9 2
Maintain Sequence Number 1) Update seq# when node generate new rreq packet. 6 7 RREQ 3 MYSEQ=2 8 1 4 9 2
Maintain Sequence Number 1) Update seq# when node generate new rreq packet. RREQ 6 RREQ 7 3 MYSEQ=2 RREQ 8 1 RREQ 4 9 2
Maintain Sequence Number 2) Neighbor node detect new infomation. 6 7 3 MYSEQ=2 8 1 4 9 2
Maintain Sequence Number 2) Neighbor node detect new infomation. 6 7 3 MYSEQ=2 8 1 4 9 2
Maintain Sequence Number 2) Neighbor node detect new infomation. 6 7 3 MYSEQ=2 8 1 4 RREQ RREQ 9 2 RREQ
Maintain Sequence Number 2) Neighbor node detect new infomation. 6 7 3 MYSEQ = “3” 8 1 4 9 2
Maintain Lifetime TTL field Use TTL field in IP Header to reduce unnecessary Broadcasting 6 TTL=2 7 TTL=1 3 TTL=2 TTL=3 8 1 TTL=2 4 9 2 TTL=2 5 TTL=1