Integrated Intelligent Research (IIR) International Journal of Communication and Networking System Volume: 05, Issue: 01, June 2016, Pages: 90-95 ISSN: 2278-2427 90 Simulation Model Based Performance Analysis of DSR and TORA Routing Protocols in MANET S. Navitha 1 , T.Velmurugan 2 1 Assistant Professor, Department of Computer Science, A.V.C College, Mayiladudurai, India. 2 Associate Professor, PG and Research Dept. of Computer Science, D.G.Vaishnav College, Chennai-106, India. Email: saisaran162@gmail.com, velmurugan_dgvc@yahoo.co.in Abstract: Backgrounds/Objectives: Mobile Ad hoc Networks (MANETs) uses mobile nodes which exchange information dynamically over wireless links. Routing Protocols are the most vital element of MANETs, which are needed to handle dynamic communication and also find route. Performance of routing protocols is an important issue. In MANETs, due to mobility of nodes, the wireless links are highly error prone and can go down frequently, interference and less infrastructure. The nodes are usually mobiles in MANETs. Methods/Statistical Analysis: This research work is carried out to compares the efficiency of two of the on-demand routing protocols Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) based on its performance. Findings:The performance of these two protocols is measured by values the of performance matrix of PDR (Packet Delivery Ratio), Throughput, End to End Delay, Routing overhead and Energy Consumption. These metrics are measured by simulation time using mobile nodes. Based on the simulation time, the performance of both the protocols are analyzed and resulted via its simulation results.Applications/Improvements: The other protocols likeWRP for FTP, TELNET and CBR are analyzed and compared in future to find the performances. Also, some of the hierarchical routing protocols are considered to measure its performances. Keywords: Simulation Results, Routing Protocols, DSR protocol, TORA protocol. I. INTRODUCTION Wireless networks are an emerging new technology that will allow users to access information and services electronically, regardless of their geographic position. A wireless network is any type of computer network that uses wireless data connections for connecting network nodes. Based on when and how the routes are discovered. In table driven routing protocols, consistent and up-to-date routing information to all nodes is maintained at each node whereas in on-demand routing the routes are created only when desired by the source host. The routing protocols meant for wired networks cannot be used for mobile ad hoc networks because of the mobility of networks. An adhoc routing protocol is a convention,or standard, that controls how nodes decidewhich way to route packets between computing devices in a mobile ad hoc network. In ad hoc networks, nodes are not familiar with the topology of their networks. Instead, they have to discover it: typically, a new node announces its presence and listens for announcements broadcast by its neighbors. Each node learns about others nearby and how to reach them, and may announce that it too can reach them. The ad hoc routing protocols can be divided into two classes; table-driven and on-demand. In table- driven routing protocols each node maintains one or more tables containing routing information to every other node in the network. All nodes update these tables so as to maintain a consistent and up-to-date view of the network. In contrast to table-driven routing protocols all up-to-date routes are not maintained at every node, instead the routes are created as and when required. When a source wants to send to a destination, it invokes the route discovery mechanisms to find the path to the destination. The route remains valid till the destination is reachable or until the route is no longer needed. In on-demand routing protocol finds a route on demand by flooding the network with Route Request packets. We focus here on on-demand (or reactive) routing protocols for ad hoc networks, in which a node attempts to discover a route to some destination only when it has a packet to send to that destination. On-demand routing protocols have been demonstrated to perform better with significantly lower overheads than periodic (or proactive) routing protocols inmany situations. Since the protocol is able to react quickly to the many changes that may occur in node connectivity, yet is able to reduce (or eliminate) routing overhead in periods or areas of the network in which changes are less frequent. The organization of this paper is structured as follows. Section II summarizes the previous research works based on DSR and TORA protocols. The basic methodology of both DSR and TORA are discussed in section III. The simulation results of DSR and TORA are discussed in section IV. Finally, section V concludes the performance of both the protocols by its values of various parameters via its experimental results. II. RELATED WORKS The literature of MANET protocols identified several pieces of key related works in the field of MANET routing protocols which highlight existing protocols as well as the current thinking within the field and the directions researchers are moving in the future. A Performance Comparison of Routing Protocols (DSR and TORA) for Security Issue in MANET (Mobile Ad Hoc Networks) is carried out by Rakesh, S. et al. in [1]. In this paper, they study the threats an ad hoc network faces and the security goals to be achieved. Finally they present and examine analytical simulation results for the routing protocols DSR and TORA network performance, using the well-known network simulator OPNET 10. 0. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) discussed by David B.Johnsonet al. in [2]. This document specifies the operation of the DSR protocol for routing unicast IPv4 packets.Routing and Quality of Service in Mobile AdHoc Networks with TORA/INORA.is carried out by Dharmaraju, Dinesh in [3].They discuss the improvements in