International Journal of Advances in Science and Technology, Vol. 3, No.

4, 2011

Analysis and Enhancement of a DSR Protocol with Self Healing Optimizing Technique
Akpado K.A1, Idigo V.E1 , Oguejiofor O.S1 and Adewale Abe2
1 2

Department of Electronics and Computer Engineering, Nnamdi Azikiwe University, Awka Department of Electrical/Electronics Engineering, Ekiti State University, Ekiti Email: {kenakpado,vicugoo,obynola,abe4best}@yahoo.com

Abstract
Over the recent years , one of the most important problems in adhoc networks is the inability of the on-demand protocols to provide scalable and cost effective solutions for packet routing in wireless adhoc networks. In this paper we propose an optimised DSR(Dynamic Source Routing) protocol with self healing technique which discover shorter and flexible routes with less error reported .

Key words: Adhoc networks, dynamic source routing, protocols 1.0. Introduction
The ability for nodes to form adhoc networks in the absence of communication infrastructure is a critical area of current research. There are existing communication needs which ad hoc networks can meet such as disaster relief, commercial applications, military operations; and the development of ad hoc network technology will enable new classes of applications. In the real time ad hoc network, mobile nodes come together for a period of time to exchange information. While exchanging information, the nodes may continue to move so the network must be prepared to adapt continually. On analyzing the on-demand protocols, which provide scalable and cost-effective solutions for packet routing in wireless ad hoc networks, it is found out that some challenges are still begging for enhancements. The paths generated by the protocols sometimes deviate from the optimal paths due to lack of knowledge of the global network topology, packet transmission is deferred which cause delays or loss of packets while the network performs tasks needed to deliver them. Longer routes consume more bandwidth, power and prone to disconnections while routing optimality affects network performance especially when the load is high. As the Internet Engineering Task Force (IETF) still surveys and encourages open research enhancement of DSR protocol before adoption as a standard, this paper tends towards enhancing DSR implementation further than its conventional state. It seeks to enhance some of the lapses observed in the simulation and implementation of the current DSR protocol and goes a long way to adopt an algorithm to enhance the route discovery mechanism of the DSR by considering link failure probabilities using a mathematical model to set up an Optimizing Routing technique that monitors routes and shortens them if possible through reduction of flying route information packets. Simulation of the current DSR is made and compared with simulations of the enhanced protocol in terms of performance. The enhanced-DSR simulation was found to have better performance. Some deductions are drawn; finally, a real ad hoc network test bed is designed and suggested for future research. 2.0. Related Works First, Dynamic Source Routing( DSR) is a Reactive routing protocol that always maintain route to only those nodes that are needed[1].Proactive routing on the other hand maintains route to every other node in the network. Both Reactive and proactive routing are used in Mobile Adhoc Networks(MANET);which are self organizing wireless networks. DSR has already had a significant impact on the development of routing protocols for ad hoc networks. Many of the other ad hoc network routing protocols proposed after DSR incorporate DSR itself, are based on the DSR framework of Route Discovery and Route Maintenance, or include DSRs component mechanisms.

Special Issue

Page 165 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011 Furthermore, DSR has recently been used as a basis for further enhancement of On-demand protocols by other researchers. For example, Ko and Vaidya [16] have proposed an optimization to DSR Route Discovery, known as Location-Aided Routing (LAR), that uses knowledge of the physical (geographical) location of the target node of the Route Discovery (e.g., from GPS, the Global Positioning System) to narrow the area of the network over which the Route Request packets must be propagated. Casta-neda and Das [13] have proposed a similar Route Discovery optimization that uses only logical (topological) location information, not physical location information, and thus does not require access to GPS. Above the routing layer, Holland and Vaidya [10] have recently studied the behaviour of TCP in ad hoc networks, using DSR as a routing protocol; their work added explicit interaction between TCP and the Route Discovery and Route Maintenance mechanisms to allow TCP to correctly react to a route failure rather than treating it as network congestion, and to allow TCP to restart sending as soon as a new route to the destination is discovered. Researchers have exploited the use of fuzzy logic concepts to set up a self- healing technique in route shortening for mobile Ad-hoc networks. This proposed technique shows an improvement over the conventional technique DSR. The basic idea is to modify the entries of the neighbor table and the time-stamp of the entry each based on the fuzzy system [2, 4,9]. The fuzzy system can be a two or more input system. The performance may be improved, if one considers more than two metrics and have more rules to make a perfect decision. Finally, secure ad hoc network protocol enhancements are been made on DSR as seen in the evaluation of Ariadne; a new secure protocol which provides security against one compromised node and arbitrary active attackers. 3.0. Analysis of DSR Protocol Operations The focus of this paper is the analysis and operation of the on-demand DSR protocol which provides more scalable and cost-effective solutions for packet routing and performance on ad hoc networks than the table-driven protocols. The limitations and issues about the conventional protocol are outlined to create an avenue for protocol enhancement if possible especially in the areas of shortest path routing, higher efficiency at high mobility rates and at high load capacity. The conventional DSR and the optimized-DSR algorithms are considered. A model for the optimized-DSR draws its source from Triangle Mesh Theory with consideration of link failure probability of various mobility models. The evaluation of the protocol is handled using industry-based network simulators GloMoSim (Global Mobile Simulator) [12] and QualNet [14]. Glomosim communicates directly with a Java-written Visualization Tool (VT) to perform simulations on significant metrics like Mobility rates, Traffic load and number of nodes. However, being a free simulator, it is less detailed than the commercial QualNet network simulator manufactured by the same company. QualNet has more real-time model parameters than the former and can generate values as close as those from a network test bed. For further analysis and simulation of the implemented model, Matlab analytical software is used to simulate an ad hoc network alongside generate graph plots on the optimized-DSR which are compared with those generated by QualNet for the conventional DSR protocol. The challenge in creating a routing protocol for ad hoc networks is to design a single protocol that can adapt to the wide variety of conditions that can be present in any ad hoc network over time. The Dynamic Source Routing protocol (DSR) completely avoids periodic behaviour, and uses source routing to solve the routing information consistency problem. DSR uses source routes to control the forwarding of packets through the network. The key advantage of a source routing design is that intermediate nodes do not need to maintain consistent global routing information, since the packets themselves already contain all the routing decisions. Beyond this, every packet that carries a source route carries a description of a path through the network. Therefore, with a cost of no additional packets, every node overhearing a source route learns a way to reach all nodes listed on the route [7]. Although DSR uses source routes, and each packet is routed based on a discovered source route, recent improvements to DSR have made it so that most packets do not need to incur the overhead of carrying an explicit source route header [8]. This is achieved with the introduction of path-state to the protocol. Path-state enables DSR to create hop-by-hop routing state in intermediate nodes when needed on-demand, thereby eliminating the need for most source-routes and vastly reducing the byte-overhead of the DSR protocol. This allows DSR to achieve the benefits of information aggregation, loop-freedom, and source routing without the significant overhead cost in terms of bytes

Special Issue

Page 166 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011

Figure 1: Basic operation of the DSR protocol Figure1 shows the building of a source route during the propagation of a Route Request, the source routes return in a Route Reply, its use in forwarding data, and the sending of a Route Error upon forwarding failure. The next hop is indicated by the address in parentheses. 3.1. DSR Route Mechanism The DSR protocol consists of two basic mechanisms: Route Discovery and Route Maintenance [5,6]. Route Discovery is the mechanism by which a node S wishing to send a packet to a destination D obtains a source route to D. To reduce the cost of Route Discovery, each node maintains a Route Cache of source routes it has learned or overheard. Route Maintenance is the mechanism by which a packets originator S detects if the network topology has changed such that it can no longer use its route to the destination D because some of the nodes listed on the route have moved out of range of each other. Figure 2 shows the basic operation of the DSR protocol. 3.2. Route Discovery Route Discovery works by flooding a request through the network in a controlled manner, seeking a route to some target destination. In its simplest form, a source node A attempting to discover a route to a destination node D broadcasts a Route Request packet that is re-broadcast by intermediate nodes until it reaches D, which then answers by returning a Route Reply packet to A.

Figure 2: Basic operation of Route Discovery. Figure 2 illustrates a simple Route Discovery. Before originating the Route Request, node A chooses a request id to place into the Request such that the pair <originating address, request id> is globally unique As the Request propagates, each host adds its own address to a route being recorded in the packet, before broadcasting the Request on to its neighbors (any host within range of its wireless transmission). When receiving a Request, if a host has recently seen this request id or if it finds its own address already recorded in the route, it discards that copy of the Request and does not propagate that copy further. As a result of the duplicate check in the recorded source route, the algorithm for Route Discovery explicitly prohibits Route Requests from looping in the network. This is an important correctness property and is responsible for the loop-free property of DSR. The use of request ids represents a simple optimization that results in the Route Requests primarily spreading outwards from the originator, as shown in Figure 3, and curtails the number of Request packets that circle around the originator. As an optimization, the protocol will still function correctly if the request ids are either not used or not cached long enough to prevent lateral movement of an outward propagating Route Request, though the overhead will be higher. While propagating a Route Request, nodes obey the normal rules for processing the Hop-Count or Time-to-Live field in the IP header of the packet carrying the Route Request. This mechanism can be used to implement a wide variety of expanding ring search strategies for the target, in which the hop limit is gradually increased in subsequent retransmissions of the Route Request for the target.

Special Issue

Page 167 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011

Figure 3: The use of request ids constrains the propagation of ROUTE REQUESTs into an organized outwardmoving wave-front. When sending or forwarding a packet to some destination D, Route Maintenance is used to detect if the network topology has changed such that the route used by this packet has broken. Each node along the route, when transmitting the packet to the next hop, is responsible for detecting if its link to the next hop has broken. In many wireless MAC protocols, such as IEEE 802.11 [11], the MAC protocol retransmits each packet until a link-layer acknowledgment is received, or until a maximum number of transmission attempts have been made. Alternatively, DSR may make use of a passive acknowledgement or may request an explicit network-layer acknowledgment. When the retransmission and acknowledgment mechanism detects that the next link is broken, the detecting node returns a Route Error packet to the original sender A of the packet. The sender A can then attempt to use any other route to D that is already in its route cache, or can invoke Route Discovery again to find a new route for subsequent packets.

3.3. Limitation of Existing Protocols While the on-demand mechanisms built into DSR are intended to improve the networks performance, they also have potentially significant liabilities. For example, by deferring work until it must be performed in order to complete some desired action, the time taken to complete the desired action will increase as none of the work has been recomputed. In the network, this means that packets may be delayed or lost while the network performs the tasks needed to deliver those [7]. Other Challenges to MANETs as regards DSR protocol include changing network topology, a limited transmission range, low availability of bandwidth due to wireless environment and consumption of higher control packets for establishing and maintaining. Overhead for establishing a route generated by the route search procedure decreases the overall network performance and increases power consumption of mobile devices [4]. 4.0. Model Design In this thesis, the DSR protocol is analyzed using various mobility models to generate various scenarios that would aid in the performance analysis of the protocol in different environments. This is significantly necessary in the analysis since the protocol is meant to thrive in wireless mobile scenarios that can possess extreme features. The models are implemented considering mobility scenario generations that would simulate visual nodes to represent the source nodes, intermediate nodes and the destination nodes. There exist standard parameters that are used to generate metrics and values necessary for scenario generation. [3] Table 1 below shows thus;

Special Issue

Page 168 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011 Table1: Scenario Parameters and their Formulas

Using the above scenario parameters, one can obtain the following values; Table2: Parameters usable for Simulation analysis

4.1 Random Waypoint (RWP) Mobility Model This is an entity mobility mobile nodes whose movements are independent of each other. In this model, the mobile nodes can move freely within the simulation field without any restriction. The Implementation of the mobility model is as follows; as the simulation starts, each node randomly selects one location in the simulation field as the destination. It travels towards the destination with constant velocity chosen uniformly and randomly from[0,vmax],where vmax is the maximum allowable velocity for every mobile node. 4.2. The Manhattan Grid Model The Manhattan Grid model is introduced in [15]. In this model, nodes move only on predefined paths.

4.3. The Reference Point Group Mobility Model The implementation of this model [15] includes the possibility to have "dynamic" groups: When a node comes into the area of another group, it changes to this new group with a probability that can be set with "-c <probability>". 4.4. Disaster Area Model This model is specifically set up in Bonnmotion software creates scenarios according to [17]. Tactical areas can be defined with the "-b" parameter following a list of coordinates for the area (separated by ","). 4.5. Performance Analysis of Optimized DSR The performance of optimized DSR protocol model can also be analyzed using Matlab analytical tool. The analysis is performed by considering the model operational in three different mobility models as described in the Bonn simulator. The mobility models analyzed are Random Waypoint model, Manhattan Grid and the Disaster Area models. They are analyzed by considering their various average Link Failure probabilities in the event of utilizing route request, route reply and route error packets effectively within the ad hoc network.

Special Issue

Page 169 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011

RWP model Expectations at Link Failure Probabiility Pf = 0.05 4.5 4
Overhead Packets over Enhanced DSR

Unicast DSR Broadcast DSR

3.5 3 2.5 2 1.5 1 0.5 0

4 5 6 7 8 9 10 Number of Participating Nodes for Source Routing

11

12

F ig ure 4 : Exp ec ta tions of p a cke t tra ns mis s ion u sing Pf = 0.05

Manhattan model Expectations at Link Failure Probabiility Pm = 0.01 0.18 0.16
Overhead Packets over Enhanced DSR

Unicast DSR Broadcast DSR

0.14 0.12 0.1 0.08 0.06 0.04 0.02 0

4 5 6 7 8 9 10 Number of Participating Nodes for Source Routing

11

12

F ig ure 5: Expectations of packet transmission using Pm = 0.01

Disaster Area model Expectations at Link Failure Probabiility Pd = 0.3 150 Unicast DSR Broadcast DSR

Overhead Packets over Enhanced DSR

100

50

4 5 6 7 8 9 10 Number of Participating Nodes for Source Routing

11

12

F ig ure 6 : Exp ec ta tions of p a cke t tra ns mis s ion u sing P m = 0.3 5.0. Deductions From Performance Analysis First, the optimized DSR significantly has reduced routing overhead in low mobility (small probability) and smallscale network (small N) situation. This implies that DSR scales better in less random movement scenarios and

Special Issue

Page 170 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011 likewise in a smaller network size. However, its optimal performance reduces when the situation gets stressful i.e. increase in link failure probability and number of participating nodes. Secondly, More broadcast packets are sent than the unicasts in all the scenarios. This can be said to be positively enhancing since it implies that there exists less route errors than route requests. This makes sense if it can be recalled that route errors are sent as unicasts while route requests are made as broadcasts. This can also deduce that the optimized DSR model tries to seek shorter route discoveries, yet with less route errors reported. Hence, a self healing optimizing route technique is followed. 6.0. Conclusion/Future works The entire work on this paper has been on the analysis, optimization and the implementation of the Dynamic Source Routing Protocol for an ad hoc network. Some deductions have been made about the optimized DSR protocol model; Hence, the end to all the different means of implementing this protocol lies with its high performance optimality in an advanced ad hoc network test bed. The future works should look at setting up a practical test bed would totally complement the efforts of simulated analyses since the network test bed does not implement any assumption in its operations hence creating and testing DSR within a real world scenario.

References:
[1] A. Nagaraju and Dr S. Ramachandram,(2008) On Reducing Broadcast Redundancy Using Equivalent Sets in Mobile Ad hoc Networks Research India Publications on Advances in Wireless and Mobile Communications, pp 69-78,. [2] A. Nagaraju and Dr S. Ramachandram. (2008) Fuzzy Cost Based Multipath Routing for Mobile Network. Journal of theoretical and Applied Information Technology,. [3] Amit Kumar Saha and David B. Johnson,(2004) Modeling Mobility for Vehicular Ad hoc Netwoorks. Department of Computer Science, Rice University, Houston, Texas,. [4] C.Venkatesh, N.Yadaiah and A.M.Natarajan. (2005) Dynamic Source Routing protocol using Fuzzy Logic Concepts for Ad hoc Networks. Academic Open Internet Journal. Volume 15,. http://www.acadjournal.com . [5] D. B. Johnson and D. A. Maltz, (1996) Dynamic Source Routing in Ad-Hoc Wireless Networks, Mobile dbj@cs.cmu.edu Computing, T. Imielinski and H. Korth, Eds., Kluwer, pp.153-81,. [6] D. B. Johnson, David Maltz and Josh Broch. (2000) DSR: Dynamic Source Routing Protocol for Multi-Hop Wireless Ad hoc Networks. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213 www.monarch.cs.cmu.edu/ 3891,. http:// [7] David A. Maltz. (2001) On-demand Routing in Multi-hop Wireless Mobile Ad hoc Networks. CMU-CS-01130, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA. May, [8] David A.Maltz. (1999) Resource Management in Multi-hop Ad Hoc Networks. Technical Report CMU CS TR00-150, School of Computer http://www.monarch.cs.cmu.edu/papers.html Science,CarnegieMellonUniversity,. [9] Gaim Alandjani and Eric E. Johnson.(2003) Fuzzy Routing in Ad hoc Networks, New Mexico State University, In the Proceedings of IEEE 2003conference.

Special Issue

Page 171 of 172

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 3, No.4, 2011 [10] Galvin Holland and Nitin Vaidya.(1999) Analysis of TCP Performance over Mobile Ad Hoc Networks In Proceedings of the Fifth International Conference on Mobile Computing and Networking (MobiCom99), pages 219230. [11] Lassaad Gannoune, Stephan Robert and Daniele Rodellar. (2003) Survey of QoS Techniques and Enhancements for IEEE 802.11 Wireless LANs. SwissCom Innovation Conference. [12] Lokesh Bajay, Mineo Takai et al. (2000) GloMoSim: A Scalable Network Simulation Environment. Computer Science Department, UniversityofCalifornia,LosAngeles,.http://pcl.cd.ucla.edu/domain/glomosim.html [13] Robert Castaneda and Samir R. Das. (1999) Query Localization Techniques for On-demand Routing Protocols in Ad Hoc Networks, In the Proceedings of the Fifth International Conference on Mobile Computing and Networking (MobiCom99).ACM. [14] Scalable Networks Inc. QualNet 4.5.1 User Guide Scalable Networks Technologies Publications, July, 2008. http://www.qualnet.com Available @ [15] University of Bonn. Bonn Motion(2009) A Mobility Scenario Generation and Analysis Tool University of Bonn Publications, Germany. [16] Young-Bae Ko and Nitin Vaidya.(1999) Location-Aided Routing (LAR) in Mobile Ad Hoc Networks, In Proceedings of the Fourth International Conference on Mobile Computing and Networking (MobiCom98), pages 6675. ACM. [17] Z. Aschenbruck et al,(2007) Modelling Mobility in Disaster Area Scenarios. In Proceeding of the 10th ACMIEEE Int. Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp 4-12

Special Issue

Page 172 of 172

ISSN 2229 5216