28-routing in mobile ad-hoc networks

832019 28-Routing in Mobile Ad-Hoc Networks

httpslidepdfcomreaderfull28-routing-in-mobile-ad-hoc-networks 189

Routing in Mobile Ad-hoc

Networks



By

P Victer Paul

Dear

We planned to share our eBooks and projectseminar contentsfor free to all needed friends like u To get to know about morefree computerscience ebooks and technology advancements incomputer science Please visit

httpfree-computerscience-ebooksblogspotcom

httprecent-computer-technologyblogspotcom

httpcomputertechnologiesebooksblogspotcom

Please to keep provide many eBooks and technology news forFREE Encourage us by Clicking on the advertisement in theseBlog



Contents

bull Ad-hoc Networksbull Problems with Routing

bull Destination Sequenced Distance Vector (DSDV)

bull Wireless Routing Protocol(WRP)

bull (Clusterhead Gateway Switch Routing (CGSR)

bull Ad Hoc On demand Distance Vector Routing(AODV)

bull Dynamic Source Routing (DSR)

bull Zone Routing Protocol(ZRP)bull Source Tree Adaptive Routing(STAR)



Ad-hoc Networks

bull Two types of wireless network

ndash Infrastructured

bull the mobile node can move while communicating

bull the base stations are fixedbull as the node goes out of the range of a base station it gets

into the range of another base station

ndash Infrastructureless or ad-hoc


bull there are no fixed base stations

bull all the nodes in the network need to act as routers

ndash In Latin ldquoad-hocrdquo literally means ldquofor this purpose

onlyrdquo Then an ad-hoc network can be regarded as

ldquospontaneous networkrdquo



bull Infrastructured network

PDA

Pen computer

Radio tower

Laptop computer

Radio tower

Infrastructure (Wired line)

Desktop computer

Laptop computer

Ad-hoc Networks



bull Infrastructurless (ad-hoc) network orMANET (Mobile Ad-hoc NETwork)

Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA



ndash Single hop ndash nodes are in theirreach area andcan communicatedirectly

ndash Multi hop ndash some nodes are farand cannot communicatedirectly The traffic has to beforwarded by other intermediate

nodes

Classification of Ad-hocNetworks



bull Characteristics of an ad-hoc network ndash Collection of mobile nodes forming a

temporary network

ndash Network topology changes frequently andunpredictably

ndash No centralized administration or standardsupport services

ndash Each host is an independent router ndash Hosts use wireless RF transceivers as

network interface

ndash Number of nodes 10 to 100 or at most

1000

Ad-hoc Networks



bull Why we need ad-hoc networks ndash Setting up of fixed access points and backbone

infrastructure is not always viable

bull Infrastructure may not be present in a disaster areaor war zone

bull Infrastructure may not be practical for short-rangeradios Bluetooth (range ~ 10m)

ndash Do not need backbone infrastructure support

bull Are easy to deploy

bull Useful when infrastructure is absent destroyed orimpractical

Ad-hoc Networks



Ad-hoc Networks

bull Example applications of ad hoc networks

ndash emergency search-and-rescue operations

ndash meetings or conventions in which persons

wish to quickly share information ndash data acquisition operations in inhospitable

terrain

ndash local area networks in the future



Ad-hoc Networks

Mobile Ad Hoc Networking is amulti-layer problem

PhysicalLink Layer

Network Layer

Transport Layer

Application Layer

- Routing - Addressing- Location Management

- Power Control- Multiuser Detection- Channel Access

- TCP- Quality of Service

- Security- Service Discovery- Location-dependent

Application



bull Is it possible to use standard routingprotocols

ndash Distance-vector protocols

bull Slow convergence due to ldquoCount to InfinityrdquoProblem

bull Creates loops during node failure networkpartition or congestion

ndash Link state protocols

bull Use flooding technique and create excessivetraffic and control overhead

bull Require a lot of processor power and thereforehigh power consumption

Problems with Routing




bull Limitations of the Wireless Network ndash packet loss due to transmission errors

ndash variable capacity links

ndash frequent disconnectionspartitions ndash limited communication bandwidth

ndash Broadcast nature of the communications

bull Limitations Imposed by Mobility

ndash dynamically changing topologiesroutes ndash lack of mobility awareness by

systemapplications

bull Limitations of the Mobile Computer

ndash short battery lifetime



bull Proactive (table driven)bull Require each node to maintain one or more tables tostore routing information

bull Each node responds to changes in network topology

by propagating updates throughout the network inorder to maintain a consistent network view

bull DSDV WRPCSGRSTAR

bull Reactive protocols (source initiated)

bull Creates routes only when desired by the sourcenode

Classification of the RoutingProtocols



bull Once a route has been established it ismaintained by a route maintenance procedure untileither the destination becomes inaccessible alongevery path from the source or until the route is no

longer desired

bull DSR AODV (Ad-hoc On-demand Distance Vector)

bull Hybrid Protocol ndash ZRP



Proactive Approach Reactive Approach

RouteLatency

Lower

bullA route is kept at all times

Higher

bullA route is never keptwhen not used

RoutingOverhead

HigherbullA frequent disseminationof topology information isrequired

LowerbullFewer control packetsin general

bull Various simulation studies have shown that reactive

protocols perform better in mobile ad hoc networks thanproactive ones ndash However no single protocol works well in all environments

ndash Which approach achieves a better trade-off depends on thetraffic and mobility patterns




bull Other classification

ndash Pro active protocols

bull DSDV STAR WRP

ndash Reactive protocols

bull AODV DSR TORA

ndash HierarchicalClustering protocols

bull CGSR ZRP CBR FSR LANMAR ndash Position aware protocols

bull GPSR LAR GRA ABR




bull Leading protocols chosen by MANET

ndash DSR Dynamic Source Routing

ndash AODV Ad-hoc On-demand DistanceVector Routing

bull Both are ldquoon demandrdquo protocolsroute information discovered only asneeded



DSDV

bull DSDV (Destination SequencedDistance Vector)

ndash Each node sends and responds torouting control message the same way

ndash No hierarchical structure

ndash Avoids the resource costs involved inmaintaining high-level structure

ndash Scalability may become an issue inlarger networks



bull Basic Routing Protocol ndash known also as Distributed Bellman-Ford

Every node maintains a routing table

ndash all available destinations ndash the next node to reach to destination

ndash the number of hops to reach thedestination

bull Periodically send table to allneighbors to maintain topology

bull Bi-directional links are required

DSDV



Traditional Distance vector tables

C

Dest Next Metric hellip

A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)

Distance Vector Updates

C

Dest Next Metric hellip A A 1B B 0C C 1

Dest Next Metric hellip A A 0B B 1C B 3 2

1 1

Dest Next Metric hellip A B 3 2B B 1C C 0

BA

B broadcasts the new routinginformation to his neighbors

Routing tableis updated

DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance

Vector ndash New Node joins the

network

C1 1

BA D1

broadcasts toupdatetables of C B Awith new entry for D

Dest Next Metric hellip A B 2B B 1C C 0D D 1

Dest Next Metric hellip A A 1B B 0C C 1D C 2

Dest Next Metric hellip A A 0B B 1C B 2D B 3

DSDV



Distance Vector ndash Broken link

C1 1

BA D1

Destc

Next Metric hellip

hellip hellip hellip D C 2


hellip hellip hellip

D B 3



D B 1



D D

DSDV



(D 2)(D 2)

Distance Vector - Loops

C1 1

BA D1


hellip hellip hellip D B 3





DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)

Distance vector - Count to Infinity

C1 1

BA D1


hellip hellip hellip D B 3 5 hellip



Destc

Next Metric hellip

hellip hellip hellip D C 2 4 6hellip

DSDV



bull Traditional Distance Vector are notsuited for ad-hoc networks

ndash Loops

bull Bandwidth reduction in networkbull Unnecessary work for loop nodes

ndash Count to Infinity

bull Very slow adaptation to topology

changes

bull Solution -gt Introduce destination

sequence numbers

DSDV



bull DSDV keeps the simplicity oftraditional Distance Vector Protocols

bull DSDV need to guarantee loop

freeness ndash New Table Entry for Destination Sequence

Number

bull DSDV need to allow fast reaction totopology changes ndash Make immediate route advertisement on

significant changes in routing table

ndash but wait with advertising of unstable routesdam in fluctuations

DSDV



bull Features introduced in DSDV ndash Sequence number originated from

destination Ensures loop freeness

ndash Install Time when entry was made (used todelete stale entries from table

ndash Stable Data Pointer to a table holdinginformation on how stable a route is Used todamp fluctuations in network

Destination

Next Metric Seq Nr InstallTime

Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV



bull Advertise to each neighbor own routing information ndash Destination Address

ndash Metric = Number of Hops to Destination

ndash Destination Sequence Number

ndash Other info (eg hardware addresses)bull Rules to set sequence number information

ndash On each advertisement increase own destinationsequence number (use only even numbers)

ndash If a node is no more reachable (timeout) increasesequence number of this node by 1 (odd sequencenumber) and set metric =

DSDV ndash RouteAdvertisement



bull Update information is compared to ownrouting table

1 Select route with higher destinationsequence number (This ensure to usealways newest information fromdestination)

2 Select the route with better metric whensequence numbers are equal

DSDV ndash Route Selection



DSDV Tables

C

Dest Next Metric Seq

A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)

DSDV Route Advertisement

CBA

B increases SeqNr from 100 -gt 102B broadcasts routing informationto Neighbors A C including

destination sequence numbers


A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV



bull DSDV Respond to topology changes

ndash Immediate advertisements

bull Information on new routes broken Links

metric change is immediately propagated toneighbors

ndash FullIncremental Update

bull Full Update Send all routing information fromown table

bull Incremental Update Send only entries thathas changed (Make it fit into one single

packet)

DSDV



(D 0 D-000)

When new node joins the network

CBA D

Dest Next Metric SeqA A 0 A-550B B 1 B-102C B 2 C-590

Dest Next Metric SeqA A 1 A-550B B 0 B-102C C 1 C-590

Dest Next Metric SeqA B 2 A-550B B 1 B-102C C 0 C-590D D 1 D-000

1 D broadcast for first timeSend Sequence number D-000

2 Insert entry for D withsequence number D-000Then immediately broadcastown table

DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D

Dest Next Metric SeqA A 1 A-550B B 0 B-102C C 1 C-592D C 2 D-000



helliphelliphellip helliphelliphellip

3 C increases its sequencenumber to C-592 thenbroadcasts its new table

4 B gets this newinformation and updates itstablehelliphellip

DSDV



(D 2 D-100)(D 2 D-100)

No loops no countto infinity

CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101

1 Node C detects broken Link-gt Increase Seq Nr by 1(only case where not the

destination sets the sequencenumber -gt odd number)

2 B does its broadcast-gt no affect on C (C knows that B hasstale information because C has higher

seq number for destination D)-gt no loop -gt no count to infinity

DSDV



(D D-101)(D D-101)

Immediate Advertisement

CBA D

Destc

Next Metric Seq


D C 3 D-100


hellip hellip hellip D B 4 D-100





D D 1 D-100

D D D-101

1 Node C detects broken link-gt Increase Seq Nr by 1(only case where not thedestination sets the sequencenumber -gt odd number)

3 ImmediatepropagationB to A(update information hashigher Seq Nr -gt

replace table entry)

2 Immediate propagationC to B(update information has higherSeq Nr -gt replace table entry)

Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV



bull Advantages ndash Simple (almost like Distance Vector)

ndash Loop free through destination seq numbers

ndash No latency caused by route discovery

bull Disadvantages

ndash No sleeping nodes ndash Bi-directional links required

ndash Overhead most routing information neverused

ndash Scalability is a major problem

DSDV



CGSR

bull CSGR(ClusterheadGateway SwitchRouting)

ndash Similar to DSDV

ndash Based on conceptof clusters and

cluster heads ndash Routing is done

via the clusterheads andatewa s

CGSR



CGSRbull Problems with CGSR

ndash More time is spend in selection of cluster headsand gateways

ndash Has a hierarchy

ndash Distributed cluster selection algorithm is used toselect cluster head



bull Cluster head is bottleneck

bull Least cluster change(LCC) algorithm- clusterheads only change when two cluster headscome into contact

bull Each node maintains

bull cluster member table-stores destination clusterhead for each node regularly braodcasted using

DSDV protocolbull Routing Table- next hop

bull Updates are required for both tables



Wireless Routing Protocol (WRP)

bull A path-finding algorithm

bull Utilizes information regarding the length and thepredecessor-to-dest in the shortest path to eachdestination

bull Eliminates the ldquoCount to Infinityrdquo Problem and converges

faster

bull An Update message is sent after processing updatesfrom neighbors or a change in link to a neighbor is

detected

bull Each route update from neighbor k causes route entriesof other neighbors that use k to be re-computed



The Algorithm

bull Each node i maintains a Distance table (i D jk ) Routingtable (Destination Identifier Distance i D j Predecessor P j the successor S j and a marker tag) link cost table (Cost Update Period ) message retransmission list (Seq No

Counter Acknowledgement flag Update List )bull Listen for updatesACKs which include i in the response

list Acknowledge each update

bull Process the Distance table entries Compute

D jb = D kb + k D j Update predecessor as reported by k bull Update own Distance and predecessor information



bull Choose neighbor p such that the path from p to j does

not include i and i D jp lt= i D jx and i D yp lt= i D yx bull Broadcast new update message Delete stale entries

from MRL for new updates Decrement counter for allentries in list

bull Retransmit MRL entry when counter hits zero settingresponse list of update message to those neighborswho have not yet acknowledged

bull Lack of NULL updates for given HelloInterval indicate

change in link to a neighbor



bull Each node implementing WRP keeps a table of routes and distances andlink costs It also maintains a message retransmission list (MRL)

bull Routing table entries contain distance to a destination node the previousand next nodes along the route and is tagged to identify the routes state

whether it is a simple path loop or invalid route (Storing the previous andsuccessive nodes assists in detecting loops and avoiding the counting-to-infinity problem - a shortcoming of Distance Vector Routing)

bull The link cost table maintains the cost of the link to its nearest neighbors(nodes within direct transmission range) and the number of timeouts sincesuccessfully receiving a message from the neighbor

bull Nodes periodically exchange routing tables with their neighbors via update

messages or whenever the link state table changes The MRL maintains alist of which neighbors are yet to acknowledged an update message sothey can be retransmitted if necessary Where no change in the routingtable a node is required to transmit a hello message to affirm itsconnectivity

bull When an update message is received a node updates its distance tableand reassesses the best route paths It also carries out a consistency check

with its neighbors to help eliminate loops and speed up convergence



bull WRP has the same advantage as that of DSDVIn addition it has faster convergence andinvolves fewer table updates But the complexityof maintenance of multiple tables demands a

larger memory and greater processing powerfrom nodes in the ad hoc wireless network Athigh mobility the control overhead involved inupdating table entries is almost the same as that

of DSDV and hence is not suitable for highlydynamic and also for a very large ad hocwireless network



WRP Example



DSR

bull DSR (Dynamic Source Routing)

ndash Similar to the source routing in traditional

networks ndash A node maintains route cache containing

the routes it knows

ndash Includes route discovery on request androute maintenance when needed

DSR



DSRbull Route discovery

ndash The source sends a broadcast packet whichcontains source address destinationaddress request id and path

ndash If the host receiving this packet saw this

packet before discards it ndash Otherwise it looks up its route caches to lookfor a route to destination If a route is notfound it appends its address into the packet

and rebroadcasts it ndash If the route is found it sends a reply packet to

the source node

ndash The route will be eventually found when the

request packet reaches the destination



Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR

bull How to send a reply packet

ndash If the destination has a route to the sourcein its cache use it

ndash Else if symmetric links are supported usethe reverse of the route record

ndash Else if symmetric links are not supported

the destination initiate route discovery tosource



DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache

(21) gt 21 (24) gt 24 Route cache

(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)

Source destination sourceroute)

Sourc

e

Destination



DSR

bull Route maintenance

ndash Whenever a node transmits a data packet aroute reply or a route error it must verify thatthe next hop correctly receives the packet

ndash If not the node must send a route error to thenode responsible for generating this routeheader

ndash The source restarts the route discovery



DSR

bull Advantages ndash Do not exchange routing update periodically

so overhead transmission is greatly reduced

ndash Can refer to cache for the new route when linkfails

bull Disadvantages ndash Scalability problem High route discovery

latency for large network ndash High mobility problem although the packet

dropped may not be substantial the overheadtraffic will increase a lot



AODV

bull Pure on-demand routing protocol ndash A node does not perform route discovery or

maintenance until it needs a route to another node orit offers its services as an intermediate node

ndash Nodes that are not on active paths do not maintainrouting information and do not participate in routingtable exchanges

bull Uses a broadcast route discovery mechanismbull Uses hop-by-hop routing

ndash Routes are based on dynamic table entriesmaintained at intermediate nodes

ndash Similar to Dynamic Source Routing (DSR) but DSRuses source routing



AODV concepts

bull Local HELLO messages are used to determinelocal connectivity ndash Can reduce response time to routing requests

ndash Can trigger updates when necessary

bull Sequence numbers are assigned to routes androuting table entries ndash Used to supersede stale cached routing entries

bull Every node maintains two counters ndash Node sequence number

ndash Broadcast ID



AODV Route Request

bull Initiated when a node wants tocommunicate with another node but doesnot have a route to that node

bull Source node broadcasts a route request(RREQ) packet to its neighbors

broadcast_iddest_addr

type flags hopcntresvd

dest_sequence_

source_addr

source_sequence_



AODV Route Request

bull Sequence numbers ndash Source sequence indicates ldquofreshnessrdquo of reverse route to the

source

ndash Destination sequence number indicates freshness of route to thedestination

bull Every neighbor receives the RREQ and either hellip ndash Returns a route reply (RREP) packet or

ndash Forwards the RREQ to its neighbors

bull (source_addr broadcast_id) uniquely identifies the

RREQ ndash broadcast_id is incremented for every RREQ packet sent

ndash Receivers can identify and discard duplicate RREQ packets



AODV Route Request

bull If a node cannot respond to the RREQ

ndash The node increments the hop count

ndash The node saves information to implement a reversepath set up (AODV assumes symmetrical links)

bull Neighbor that sent this RREQ packet

bull Destination IP address

bull Source IP address

bull Broadcast ID

bull Source node‟s sequence number

bull Expiration time for reverse path entry (to enable garbagecollection)



AODV Example (1)

1

35

2

6

7

4

Node 1 needs to send a data packet to Node 7Assume Node 6 knows a current route to Node 7Assume that no other route information exists in the network

(related to Node 7)



bull Node 1 sends a RREQ packet to its neighbors

ndash source_addr = 1

ndash dest_addr = 7

ndash broadcast_id = broadcast_id + 1

ndash source_sequence_ = source_sequence_ + 1

ndash dest_sequence_ = last dest_sequence_ for Node 7

1

4

35

2

6

7



bull Nodes 2 and 4 verify that this is a new RREQand that the source_sequence_ is not stalewith respect to the reverse route to Node 1

bull Nodes 2 and 4 forward the RREQ ndash Update source_sequence_ for Node 1

ndash Increment hop_cnt in the RREQ packet

14

35

2

6

7



bull RREQ reaches Node 6 which knows a route to 7 ndash Node 6 must verify that the destination sequence number is less

than or equal to the destination sequence number it has

recorded for Node 7bull Nodes 3 and 5 will forward the RREQ packet but the

receivers recognize the packets as duplicates

14

35

2

6

7



AODV Route Reply

bull If a node receives an RREQ packet and it has acurrent route to the target destination then itunicasts a route reply packet (RREP) to the

neighbor that sent the RREQ packet

dest_addr

type flags hopcntrsvd

dest_sequence_

source_addr

lifetime

prsz



bull Intermediate nodes propagate the first RREP for thesource towards the source using cached reverse routeentries

bull Other RREP packets are discarded unlesshellip

ndash dest_sequence_ number is higher than the previous or ndash destination_sequence_ is the same but hop_cnt is smaller (ie

there‟s a better path)

bull RREP eventually makes it to the source which can usethe neighbor sending the RREP as its next hop for

sending to the destinationbull Cached reverse routes will timeout in nodes not seeing a

RREP packet



bull Node 6 knows a route to Node 7 and sends an RREP toNode 4 ndash source_addr = 1

ndash dest_addr = 7 ndash dest_sequence_ = maximum(own sequence number

dest_sequence_ in RREQ)

ndash hop_cnt = 1

14

35

2

6

7



bull Node 4 verifies that this is a new routereply (the case here) or one that has a

lower hop count and if so propagates theRREP packet to Node 1 ndash Increments hop_cnt in the RREP packet

14

35

2

6

7



bull Node 1 now has a route to Node 7 in three hopsand can use it immediately to send data packets

bull Note that the first data packet that promptedpath discovery has been delayed until the firstRREP was returned

1

35

2

6

7

Dest Next Hops

7 4 3

4

AODV Route Maintenance




bull Route changes can be detected byhellip ndash Failure of periodic HELLO packets ndash Failure or disconnect indication from the link level ndash Failure of transmission of a packet to the next hop

(can detect by listening for the retransmission if it isnot the final destination)

bull The upstream (toward the source) nodedetecting a failure propagates an route error(RERR) packet with a new destination sequence

number and a hop count of infinity (unreachable)bull The source (or another node on the path) can

rebuild a path by sending a RREQ packet



bull Assume that Node 7 moves and link 6-7 breaks

bull Node 6 issues an RERR packet indicating thebroken path

bull The RERR propagates back to Node 1

bull Node 1 can discover a new route

14

35

2

6

7

7

Z R i P l



Zone Routing Protocol

bull A Hybrid Routing Protocol

bull A Zone is defined for each node

bull Proactive maintenance of topology within a zone(IARP) Distance Vector or Link State

bull Reactive queryreply mechanism between zones(IERP)

bull Uses bdquoBordercast‟ instead of neighbor broadcast

bull Neighbor DiscoveryMaintenance (NMD) and BorderResolution Protocol (BRP) used for query controlroute accumulation etc



ZRP Example



Node S is Source X destination







Zone Routing Protocol cont

bull Routing Zone and IntrAzone Routing Protocol

ndash Zone Radius may be based on hop count

ndash Identity and distance of each Node within the Zone isproactively maintained

bull The Interzone Routing Protocol

ndash Check if destination is within the routing zone

ndash Bordercast a route query to all peripheral nodes

ndash Peripheral nodes execute the same algorithm




bull Route Accumulation

ndash Provide reverse path from discovery node tosource node

ndash May employ global caching to reduce querypacket length

bull Query DetectionControl

ndash Intermediate nodes update a Detected Queries

Table[Query Source ID] bull Route Maintenance may be reactive or proactive

STAR



STAR

bull The approach used in the STAR protocol isinbetween these two approaches

bull The idea is to maintain a source tree at eachnode which connects the node to all the

destinations through loop-free tree branchesbull The aim is not to emphasize the determination of

shortest paths rather find paths which arereasonable with respect to some metric

bull This is called the Least Overhead RoutingApproach (LORA)



bull DSDV uses the Optimum Routing Approach(ORA) which requires frequent exchange ofrouting table updates

bull In the LORA approach route optimality is

sacrificed in favour of lower number of overheadmessages

bull In the STAR protocol the LORA approach isused and the exchange of source trees among

the nodes is infrequent Also a source tree ismuch lighter compared to a routing table



bull In STAR the topology of a network is modelledas a directed graph G=(VE) where V is the setof nodes and E is the set of edges connectingthe nodes

bull A link level protocol is assumed that keeps trackof neighbourhood information through exchangeof hello messages



bull Each router maintains a source tree that is a treeconnecting the router to all destinations that areknown to the router

bull A router knows its adjacent links ie the next-

hop neighbours in its source treebull A router also knows the source trees reported by

its neighbours

bull The collection of a routeracutes own source tree andthe source trees reported by its neighboursforms a partial topology graph for the router

M i t i i t



Maintaining source trees

bull A router computes its source tree by runningDijkstraacutes shortest path algorithm on its partialtopology graph

bull A router updates its source tree whenever there

are significant changes in the partial topologygraph when a neighbour moves away (linkfailure) or a neighbour communicates a newsource tree

bull The updates are done according to the order thecommunications are received

Wh t N d t b C i t d



What Needs to be Communicated

bull Link deletions need not be communicated as thedeletion of a link to reach a given destination isimplicit with the addition of a new link to reachthe same destination

bull The only case a router needs to explicitly informits neighbours about link deletion is when adeletion causes the router to lose paths to oneor more destinations

bull The basic update unit used to communicatechanges to source trees is the link state update(LSU)

S N b



Sequence Numbers

bull When a router receives an LSU it can determinewhether the LSU contains more recent link-stateinformation by comparing the sequence numberof the new LSU with the sequence number ofthe link stored locally

bull Each router erases a link from its partialtopology graph if the link is not adjacent to the

router and is not present in the source treesreported by any of its neighbours

Exchanging Update Messages




bull We only discuss how STAR protocol can beimplemented for supporting the LeastOverhead Routing Approach (LORA) It is

possible to implement STAR to supportOptimal Routing Approach (ORA)

bull The LORA approach is more important

since it reduces overheads considerablybull The ORA approach can be supported

simply by exchanging source treeswhenever a router detects a change in its

When to Exchange Update



e to c a ge UpdateMessages

bull A router running STAR protocol to supportLORA reports updates to its source tree inthe event of

ndash Unreachable destinations ndash New destinations

ndash The possiblity of permanent routing loops

ndash Cost of paths exceeding a given threshold

N D ti ti



New Destination

bull Router i sends a source-tree update to itsneighbours when it finds a new destinationor any of its neighbours reports a new

destinationbull A router can learn about a new neighbour

through link level support and this triggers

a source-tree updatebull This update message is also necessary

when a node joins the network for the first

time



bull STAR performs ORA table driven basedrouting to construct source trees

bull LORA table driven routing can be used to

selectively perform updates



By

P Victer Paul

Dear

We planned to share our eBooks and projectseminar contentsfor free to all needed friends like u To get to know about morefree computerscience ebooks and technology advancements incomputer science Please visit

httpfree-computerscience-ebooksblogspotcom

httprecent-computer-technologyblogspotcom

httpcomputertechnologiesebooksblogspotcom

Please to keep provide many eBooks and technology news forFREE Encourage us by Clicking on the advertisement in theseBlog



Contents










Ad-hoc Networks
















PDA

Pen computer

Radio tower

Laptop computer

Radio tower


Desktop computer

Laptop computer

Ad-hoc Networks




Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA





nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Contents










Ad-hoc Networks
















PDA

Pen computer

Radio tower

Laptop computer

Radio tower


Desktop computer

Laptop computer

Ad-hoc Networks




Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA





nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Ad-hoc Networks
















PDA

Pen computer

Radio tower

Laptop computer

Radio tower


Desktop computer

Laptop computer

Ad-hoc Networks




Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA





nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









PDA

Pen computer

Radio tower

Laptop computer

Radio tower


Desktop computer

Laptop computer

Ad-hoc Networks




Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA





nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









Ad-hoc Networks

PDA

Pen computer

Laptop computer

Laptop computer

PDA





nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time










nodes





temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









temporary network




network interface


1000

Ad-hoc Networks










Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time















Ad-hoc Networks



Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Ad-hoc Networks





terrain




Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Ad-hoc Networks


PhysicalLink Layer

Network Layer

Transport Layer

Application Layer





Application




















systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time

























systemapplications















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time


















longer desired






RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









RouteLatency

Lower


Higher


RoutingOverhead











bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time










bull DSDV STAR WRP


bull AODV DSR TORA













DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time














DSDV














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time














DSDV




C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









C


A A 1B B 0C C 2


A A 0B B 1C B 3

1 2


A B 3B B 2C C 0

BA

DSDV



(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(A 1)(B 0)(C 1)

(A 1)(B 0)(C 1)


C



1 1


BA



DSDV



(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D 0)

(A 2)(B 1)(C 0)(D 1)

(A 1)(B 0)(C 1)(D 2)

Distance


network

C1 1

BA D1





DSDV




C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









C1 1

BA D1

Destc

Next Metric hellip




D B 3



D B 1



D D

DSDV



(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D 2)(D 2)


C1 1

BA D1







DSDV



(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D2)

(D4)

(D3)

(D5)

(D2)

(D4)


C1 1

BA D1





Destc

Next Metric hellip


DSDV




ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time









ndash Loops




changes


sequence numbers

DSDV






Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time











Number




DSDV







Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time












Destination


Stable Data

A A 0 A-550 001000 Ptr_A

B B 1 B-102 001200 Ptr_B

C B 3 C-588 001200 Ptr_C

D B 4 D-312 001200 Ptr_D

DSDV


















DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time























DSDV Tables

C


A A 1 A-550B B 0 B-100C C 2 C-588


A A 0 A-550B B 1 B-100C B 2 C-588


A B 1 A-550B B 2 B-100C C 0 C-588

BA

DSDV



(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(A 1 A-550)(B 0 B-102)(C 1 C-588)

(A 1 A-550)(B 0 B-102)(C 1 C-588)


CBA




A A 0 A-550B B 1 B-102C B 2 C-588


A A 1 A-550B B 0 B-102C C 1 C-588


A B 2 A-550B B 1 B-102C C 0 C-588

DSDV










packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time















packet)

DSDV



(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D 0 D-000)


CBA D






DSDV



(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(A 2 A-550)

(B 1 B-102)(C 0 C-592)(D 1 D-000)

(New node (cont)

CBA D







DSDV



(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D 2 D-100)(D 2 D-100)


CBA D

1

Destc

Next Metric Seq


D C 2 D-100



D B 3 D-100



D D D-101





DSDV



(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








(D D-101)(D D-101)


CBA D

Destc

Next Metric Seq


D C 3 D-100







D D 1 D-100

D D D-101





Destc

Next Metric Seq


D C 2 D-100

D C D-101



D B 3 D-100

D B D-101

DSDV






bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time











bull Disadvantages




DSDV



CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








CGSR






CGSR





















faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time


























faster


detected




The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








The Algorithm































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time































WRP Example



DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








DSR




the routes it knows


DSR








the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time













the source node





Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Source

DSRRREQ (Route

request)

4

3

6

5

1

2

RREQ(15124)

Route cache

(35) gt 365

Route cache

Route cache

RREQ(151)

RREQ(1512)

RREQ(1512)

Route cache

Route cache

(source destination

path)

Destination



DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








DSR








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








DSR

4

3

6

5

1

2

Route cache

(31) gt 321 (32) gt 32 (35) gt 365

Route cache

Route cache

(51) gt 5421 (52) gt 542 (54) gt 54

Route cache


(15) gt 1245 12365

RREP(5112 4 5)

RREP(511 2 45)

RREP(51 1 245) RREP(311 2 365)

RREP (Route reply)


Sourc

e

Destination



DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








DSR







DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








DSR









AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV









AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV concepts





ndash Broadcast ID



AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV Route Request





dest_sequence_

source_addr

source_sequence_



AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV Route Request


source









AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV Route Request







bull Broadcast ID





AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV Example (1)

1

35

2

6

7

4


(related to Node 7)





ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time










ndash dest_addr = 7




1

4

35

2

6

7






14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time











14

35

2

6

7







14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time












14

35

2

6

7



AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








AODV Route Reply



dest_addr


dest_sequence_

source_addr

lifetime

prsz









RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time














RREP packet






ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time











ndash hop_cnt = 1

14

35

2

6

7





14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time










14

35

2

6

7





1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time










1

35

2

6

7

Dest Next Hops

7 4 3

4
















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time




















14

35

2

6

7

7

Z R i P l












ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time

















ZRP Example



























STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time
































STAR



STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time








STAR






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time






















its neighbours


M i t i i t















S N b



Sequence Numbers





















N D ti ti



New Destination






time




















S N b



Sequence Numbers





















N D ti ti



New Destination






time








Sequence Numbers





















N D ti ti



New Destination






time






















N D ti ti



New Destination






time








New Destination






time






28-routing in mobile ad-hoc networks

Documents