DSR

The Dynamic Source Routing Protocol

Name: Vikram Kr. Singh EC-09-01 Reg.no-0901230028

Introduction
DSR is designed for MANETs DSR doesnt need any network infrastructures

Loop free routing No routing information in the intermediate nodes

Nodes may easily cache this routing information for future use
D F Cs cache

C
A C

DSR Header packet

AC---D---F

Assumption for the simulation

All nodes in the MANETs are willing to partecipate fully in the DSR protocol. The diameter of the MANET will often be small (5 to 10 hops). The speed with which node moves, is moderate with respect to the packet transmission latency. Nodes may be able to enable promiscuous receive mode on their wireless network interface. DSR operate with uni-directional link. DSR protocol Each node selects a single IP address.
Application layer Transport layer Network layer Data link layer Phisical layer

MAC

DSR Mechanisms
Route discovery Route maintenance Mechanisms on-demand

No periodic routing advertisement No link status sensing No neighbor detection packets

Routes caching

Basic DSR Route Discovery

Before Route discovery starts
Sender cache

S
No match

AC-D

Basic DSR Route Discovery

Route reply message

Piggyback The node must limit the Route Discoverys rate until a New route request route reply message message with route is received A E Match reply sent over the limit should be The additional data packetmessage New A E Route Reply entry Partitoned MANET buffered message
A-B-C-D
Subset 1
ROUTE DISCOVERY

Exponential back-off

New entry

I
Copy

No Match
E

Subset 2

A-B-C-D
ROUTE DISCOVERY

Send Buffer

Basic DSR Route Maintenance

Each node transmitting the packet is responsible for confirming that the packet has been received by next hop. Acknowledgement

By lower layer protocol MAC By DSR-specific software ack

Route errore message

A B C D E

Route error message: C-D is broken

Additional Route Discovery features

Caching overheard routing information

In presence of uni-directional link In presence of bi-directional link

Packet Z with Packet toto E with source route source route AB---C---D---E V---W---X---Y---Z

X-Y-Z

New entry

Overhearing on bi-directional link

C
New entry

X
D--E

Additional Route Discovery features

Replying to Route Request using cached routes The intermediate node must verify that the resulting route being returned contains no duplicate nodes listed Intermediate in the route record ? Initiator
X ROUTE REQUEST Route to X

node

Route to X

Route reply message

Additional Route Discovery features

Preventing Route Reply storms

Node C may infer that the initiator has already received a Route Reply giving a better route because the data packet received from B contains a value of h less than its hs value

Many Route Reply message could be send to A from the As neighbors To avoid a possible local congestion, each nodes must wait a variable period before sending the reply. Delay period d = H(h - 1 + r) Each node network interfaces works into promiscuous receive mode.
h=2 C

B h=1

E h=3

Additional Route Discovery features

Route request Hop limits

Nonpropagating Route Request Propagating Route Request Expanding ring

2 Hop limit 1 Hop limit Non Propagating Route Request

The expanding ring search approach can carry to the average latency increasing

Support for Heterogeneous networks & mobile IP

Heteregenous network :
Different kind of devices with different interfaces. Possibly , multiple interfaces( short range & long range)

Support for Heterogeneous networks & mobile IP

Heteregenous network :
Different kind of devices with different interfaces. Possibly , multiple interfaces( short range & long range)

Source route A/1B/1C/4D/1 Reverse route D/1C/4B/2A/1

Internet Interconnection and MIP

DSR evaluation

Simulation

To analyse the behavior and performance of DSR. To Compare with other routing protocols Ad hoc of 50 mobiles nodes 15 minutes ( 900 seconds) simulation time. CBR data traffic 20 mobile nodes traffic sources; 4 packets/sec. Random waypoint mobility model ( pause time)

Set Up:

Results

Results

Results

Results

Conclusion
Excellent performance for routing in multi-hop ad hoc. Very low routing overhead. Able to deliver almost all originated data packets, even with rapid motion of all nodes.