Professional Documents
Culture Documents
Ad Hoc Networks Routing Protocols: Presented By: Karthik Samudram Jayaraman
Ad Hoc Networks Routing Protocols: Presented By: Karthik Samudram Jayaraman
Introduction
What is Ad Hoc Network?
In Latin, ad hoc means "for this," further
DSDV
contd
node
An update list of updates or ACKs to update
message
A response list of nodes that should send an
ACK to the update message
DSDV
DSDV is based on idea of classical Bellman-Ford
Routing Algorithm
Each node maintains a routing table listing all available destinations.
The attributes of each destination are the next hop, the number of hops
to reach to the destination, and a sequence number, which is originated
by the destination node.
DSDV
How DSDV addresses the problems?
Tagging of distance information:
The destination issues increasing sequence number
Other nodes can discard old/duplicate updates
What is on-demand
The routes are created when required
The source has to discover a route to the
destination.
The source and intermediate nodes have to
maintain a route as long as it is used.
Routes have to be repaired in case of
topology changes.
Routing
Dynamic Source Routing Protocol
Temporally Ordered Routing Algorithm
Associativity Based Routing
Signal Stability Routing
maintenance.
AODV minimizes the number of broadcasts
by creating routes on-demand
AODV uses only symmetric links because
the route reply packet follows the reverse
path of route request packet.
AODV uses hello messages to know its
neighbors and to ensure symmetic links.
destination
RREP
Reply packet follows the reverse path of route
request packet recorded in broadcast packet
The node discards the packets having been seen
Route Maintenance
If the source node moves, it reinitiates the
route discovery.
If intermediate node moves, its upstream
node sends a RREP to the source. The
source restarts the route discovery.
Route discovery
The source sends a broadcast packet which
contains source address, destination address, request
id and path.
If a host saw the packet before, discards it.
Otherwise, the route looks up its route caches to
look for a route to destination, If not find, appends
its address into the packet, rebroadcast,
If finds a route in its route cache, sends a route
reply packet, which is sent to the source by route
cache or the route discovery.
source
(1,4)
(1,3)
3
(1,2)
destination
(1,4,7)
The node discards the packets having been seen
5
(1,3,5)
(1,3,5,6)
The route looks up its route caches to look for a route to destination
If not find, appends its address into the packet
Route maintenance
Whenever a node transmits a data packet, a
route reply, or a route error, it must verify
that the next hop correctly receives the
packet.
If not, the node must send a route error to
the node responsible for generating this
route header
The source restart the route discovery
Erasing Routes
CLR packet is floodthrough network to erase
invalid routes
The source broadcasts a QRY packet with height(D)=0, all others NULL
(0,0,0,3,a)
(-,-,-,-,a)
source
(-,-,-,-,d)
(0,0,0,2,d)
QRY
QRY
(-,-,-,-,c)
(0,0,0,4,c)
UPD
Dest.
(0,0,0,0,h)
(-,-,-,-,g)
(0,0,0,1,g)
(-,-,-,-,b)
(0,0,0,4,b)
e
(-,,-,-,-e)
(0,0,0,3,e)
(0,0,0,2,f)
(-,-,-,-,f)
A node receiving a UPD sets its height to one more than UPD
Source receives a UPD with less height
(0,0,0,2,d)
h
c
Dest.
(0,0,0,0,h)
(0,0,0,4,c)
g
(0,0,0,1,g)
(0,0,0,4,b)
e
(0,0,0,3,e)
(0,0,0,2,f)
UDP
h
c
Dest.
(0,0,0,0,h)
(0,0,0,4,c)
g
(0,0,0,1,g)
(0,0,0,4,b)
e
(0,0,0,3,e)
(0,0,0,2,f)
Associativity table
All nodes generate periodic beacons
When a neighbor node receives a beacon, it
increases its associativity tick with respect
to the sending node in associativity table
Associativity ticks are reset when the
neighbors of a node or the node itself move
out of proximity
Route Discovery
The source broadcast a QRY message
Each intermediate node appends its address
and associativity ticks to QRY,
The destination can examine the
associativity ticks to select route. If the
multiple paths have the same overall degree
of stability, select the minimum number of
hops
Route Erasing
If the the route is no longer desired, the
source may not be aware of any route node
changes because partial reconstruction.
Conclusion
Overview
On-Demand
Overall
complexity
Overhead
Loop-free
Beaconing
requirements
Multiple
route support
Routes
maintained in
Route
reconfigurati
on
methodology
Routing
metric
AODV
Medium
DSR
Medium
TORA
High
ABR
High
SSR
High
Low
Yes
No
Medium
Yes
No
Medium
Yes
No
High
Yes
Yes
High
Yes
Yes
No
Yes
Yes
No
No
Route table
Route cache
Route table
Route table
Route table
Erase route;
notify source
Erase route;
notify source
Link reversal;
route repair
Localized
broadcast
query
Erase route;
notify source
Freshest and
shortest path
Shortest path
Shortest path
Associativity
and shortest
path and
others
Associativity
and stability
Reference
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Reference (cont.)
7.
8.
9.
10.
11.
12.
13.
14.