Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Mobile Computing - Ad - hoc On - Demand Distance Vector Routing (AODV) -, Study notes of Mobile Computing

In this document topics covered which are Ad-hoc On-Demand Distance Vector Routing (AODV), Ad Hoc On-Demand Distance Vector Routing (AODV), Path Discovery, Route Requests in AODV, Reverse Path Setup in AODV, AODV.

Typology: Study notes

2010/2011

Uploaded on 09/04/2011

amit-mohta
amit-mohta 🇮🇳

4.2

(152)

89 documents

1 / 15

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Ad-hoc On-Demand Distance
Vector Routing (AODV)
Discovers routes on-demand.
Uses traditional routing tables, one entry per
destination that are dynamically established at each
intermediate node.
Use ‘hello’ messages for local connectivity
management.
Sequence numbers maintained at each destination to
determine freshness of routing information and to
prevent rooting loops.
Timer-based states in each node regarding utilization of
individual routing table entries.
Expanding ring search optimization.
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff

Partial preview of the text

Download Mobile Computing - Ad - hoc On - Demand Distance Vector Routing (AODV) - and more Study notes Mobile Computing in PDF only on Docsity!

Ad-hoc On-Demand Distance

Vector Routing (AODV)

  • (^) Discovers routes on-demand.
  • (^) Uses traditional routing tables, one entry per

destination that are dynamically established at each

intermediate node.

  • (^) Use ‘hello’ messages for local connectivity

management.

  • (^) Sequence numbers maintained at each destination to

determine freshness of routing information and to

prevent rooting loops.

  • (^) Timer-based states in each node regarding utilization of

individual routing table entries.

  • (^) Expanding ring search optimization.

Ad Hoc On-Demand Distance Vector Routing (AODV)

  • (^) DSR includes source routes in packet headers
  • (^) Resulting large headers can sometimes degrade performance
    • (^) particularly when data contents of a packet are small
  • (^) AODV attempts to improve on DSR by maintaining routing tables at the nodes, so that data packets do not have to contain routes
  • (^) AODV retains the desirable feature of DSR that routes are maintained only between nodes which need to communicate
  • (^) Route Requests (RREQ) are forwarded in a manner similar to DSR
  • (^) When a node re-broadcasts a Route Request, it sets up a reverse path pointing towards the source - (^) AODV assumes symmetric (bi-directional) links
  • (^) When the intended destination receives a Route Request, it replies by sending a Route Reply (RREP)
  • (^) Route Reply travels along the reverse path set-up when Route Request is forwarded

Route Requests in AODV

B

A

S

E

F

H

J

D

C

G

I

K

Z

Y

Represents a node that has received RREQ for D from S

M

N

L

Route Requests in AODV

B

A

S

E

F

H

J

D

C

G

I

K

Represents transmission of RREQ

Z

Y

Broadcast transmission M N

L

Reverse Path Setup in

AODV

B

A

S

E

F

H

J

D

C

G

I

K

  • (^) Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once

Z

Y

M

N

L

Reverse Path Setup in

AODV

B

A

S

E

F

H

J

D

C

G

I

K

Z

Y

M

N

L

Forward Path Setup in

AODV

B

A

S

E

F

H

J

D

C

G

I

K

Z

Y

M

N

L

Forward links are setup when RREP travels along the reverse path Represents a link on the forward path

Route Request and Route

Reply

  • (^) Route Request (RREQ) includes the last known sequence number for the destination
  • (^) An intermediate node may also send a Route Reply (RREP) provided that it knows a more recent path than the one previously known to sender
  • (^) Intermediate nodes that forward the RREP, also record the next hop to destination
  • (^) A routing table entry maintaining a reverse path is purged after a timeout interval
  • (^) A routing table entry maintaining a forward path is purged if not used for a active_route_timeout interval

Path Maintenance

• Detecting link failures

  • (^) Periodic ‘hello’ messages
  • (^) Link Layer acknowledgements (LLACKS)
  • (^) Attempts to forward packet to next hop fail

• RERR (Route Error packet)

  • (^) Created when next-hop link breaks.
  • (^) Propagated to all predecessors until all sources using the failed link are informed.
  • (^) Sources restart discovery process if they still need the route to destination.

AODV

• AODV Advantages :

  • (^) Low overhead and smaller routing tables in light load networks
  • (^) Fast expiration of unused routes

• AODV Disadvantages :

  • (^) On-demand feature brings a longer delay for the first packet
  • (^) Malicious nodes have more flexibility on conducting attacks