BMS College of Engineering

Bangalore-560019

SEMINAR REPORT ON

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
(In partial fulfillment for the degree of BACHELOR OF ENGINEERING in TELECOMMUNICATION ENGINEERING of VISVESWARAIAH TECHNOLOGICAL UNIVERSITY, BELGAUM)

SUBMITTED BY

CHINMAI (1BM08TE014)

DEPARTMENT OF TELECOMMUNICATION ENGINEERING

INTRODUCTION
Mobile ad hoc network (MANET) are a collection of wireless mobile nodes forming a temporary network, using as transmission medium radio waves. In ad hoc network there is no concept of centralized administration, to manage tasks as security, routing and others, mobile nodes must collaborate among themselves to accomplish these services. Thus any developed protocol for ad hoc networks must take into consideration all the aspects of ad hoc networks as mobility, energy and bandwidth constraints to develop an efficient and effective routing or security protocol.

ROUTING IN AD HOC NETWORKS

In ad hoc networks, to ensure the delivery of a packet from sender to destination, each node relay on its neighbouring nodes to forward packets to nodes which are not in its transmission range. Therefore any node in the network plays two roles the first one as an ordinary node and the second one as a router. resulting on a fast changing in routes which must be efficiently handled by the underlying routing protocol. Can classify them into the following categories: 1. Reactive protocols 2. Proactive protocols 3. Hybrid protocols

DYNAMIC SOURCE ROUTING PROTOCOL

The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop mobile ad hoc networks.

Assumptions

All nodes wishing to communicate with other nodes within the ad hoc network are willing to participate fully in the protocols of the network.

The minimum number of hops necessary for a packet to reach from any node located at one extreme edge of the ad hoc network to another node located at the opposite extreme, as the diameter of the ad hoc network.

Packets may be lost or corrupted in transmission on the wireless network. A node receiving a corrupted packet can detect the error and discard the packet.

Nodes within the ad hoc network may move at any time without notice, and may even move continuously. but we assume that the speed with which nodes move is moderate with respect to the packet transmission latency and wireless transmission range of the particular underlying network hardware in use.

Each node selects a single IP address by which it will be known in the ad hoc network.

A. Route discovery: This mechanism is launched whenever a node wishes to send or contact a destination node which isnt in its transmission range; therefore it must obtain a route to that node by launching the Route discovery mechanism. -It creates a route request packets containing its address and the address of the destination node; then it broadcast this packet to all its neighbours using flooding.

-Each neighbour when receiving this request consults its cache to find an eventual route to this destination to be returned back to the sender; otherwise it rebroadcast the same route request to all its neighbours after adding its address to the header of the route request and learns from this request information to be added to its cache. If the node has already treated this route request it ignores the new received request by verifying its sequence number since each route request is identified by a unique sequence number. The same procedure is executed by each neighbouring node until the route request arrives to destination which adds its address at the end of the header and sends a route reply.

B. Route reply This procedure is executed by a node after receiving a route request destined to him, thus this node executes the following actions: -Adds this new route to its cache for future use. -Adds it address at the end of the path contained in the header of DSR packets. -Replies to this request using unicast along the path contained in the header.

New entry

A
Route Reply message

E
A-B-C-D

Match

C. Route maintenance When forwarding a packet each intermediate node is responsible for confirming that the packet is correctly received by the next node, however due to the dynamic topology and the constraints of the wireless medium it may occur some situation where a node doesnt receive the acknowledgement of reception from link layer of a given packet, therefore it resends the same packet it until reaches a predefined value of attempts. Whenever this number of attempts was reached this node consider this link as broken than it deletes each route containing this link from its cache, than it generates a route error packet to inform the source node and all intermediate nodes about this link failure, in the same way each intermediate node deletes all routes containing this route until the route error packet arrives to its destination, which chooses to launch a new route request or to find a new route in its route cache.

B
Route error message C-D : is broken

D. Route cache The route cache in DSR is used to maintain frequently used routes in order to avoid new route discovery mechanism which consumes lot of network resources, in the way that each new discovered route is saved in the route cache of the corresponding node for future use, a node can also learn from route request to add new routes to its cache, it also learns from route error packets to update its cache.
Packet to E with source route

AB---C---D---E

C
New entry

D
5
D--E

E. Metric The metric used to evaluate (choose route) in DSR is usually the number of hops between a source node and a destination, which is the metric used for most of conventional routing protocol, however this mechanism isnt desired for ad hoc networks regarding their characteristics (mobility, devices constraints). Because it may exist a route with the minimum of hops however it contains some less powered or not stable nodes which may cause link failure and therefore route errors.

ADVANTAGES

The DSR provides excellent performance for routing in multi-hop wireless ad hoc networks. A key reason for this good performance is the fact that DSR operates entirely on demand, with no periodic activity of any kind required at any level within the network.

DSR has very low routing overhead and is able to correctly deliver almost all originated data packets, even with continuous, rapid motion of all nodes in the network.

LIMITATIONS OF DSR
Regarding the specifications of DSR we can conclude the following limitations: It doesnt take into consideration the capacity of each node as power computing, because nodes with less computing power may slow the forwarding of data flows.

It doesnt take into consideration the battery power of the intermediate nodes, because a node cant forward packets if it hasnt the sufficient energy power which causes link failures.

It doesnt include the aspect of stability of nodes in order to choose the most stable nodes as intermediate nodes, because unstable nodes causes topology changing which may launches lot of route errors and therefore new route requests.

Only the first discovered route is used, and the others are cached for future use.

No security mechanism is defined for DSR.

CONCLUSION
This protocol uses a reactive approach which eliminates the need to periodically flood the network with table update messages. The intermediate nodes also utilize the route cache information efficiently to reduce the control overhead. The disadvantage of this protocol is that the route maintenance mechanism does not locally repair a broken link. Stale route cache information could also result in inconsistencies during the route reconstruction phase. The routing overhead is directly proportional to the path length.