\nDept. of CSE, Suresh Gyan Vihar University,\u00a0Jaipur, Rajasthan, India<\/p>\n
Abstract\u2014 DSDV and DSR are routing protocols of mobile ad hoc networks. DSDV is a proactive type routing protocol whereas DSR is a reactive type of routing protocol. Both DSDV and DSR are very well known MANET protocols. A Mobile Ad hoc network is a collection of mobile nodes connecting in decentralized mode. This type of network has no need of any central administration support and don\u2019t have any physical links. They do not follow any particular topology due to the mobility nature of nodes. This network consists of various protocol suites which are specifically designed for mobile nodes. This paper presents a simulation analysis of end to end node delay in DSDV (proactive) and DSR (reactive protocols) using the NS-2 simulator as a simulation environment.
\nKeywords- DSDV, DSR, Routing, Node Delay, Protocols, MANET Protocols, NS-2, Simulation.<\/p>\n
INTRODUCTION<\/strong> MANET ROUTING<\/strong> ROUTING PROTOCOLS<\/strong><\/p>\n A. DSDV Protocol (Proactive Protocol)<\/p>\n DSDV is a Proactive protocol so, each and every node should maintain a routing table on regular basis specify updated route for packet transfer. In DSDV protocol the routes of the data transmission generally maintained on the basis of the constant control traffic. These routes are available all the time during transmission. Nodes frequently have to update the tables to provide fresh view of whole network. Updates are so frequent so that the broadcast must be made on regular basis to make sure that every node can almost always find every other node in the network. B. DSR Protocol (Reactive protocol)<\/p>\n The DSR Protocol discovered route whenever transmission is needed, no need for frequent updating of routes in table for every node in this type of protocol. DSR use source routing technique in which a data packet originating node and all node header address requires traversing arrives at the destination [2]. The DSR contains useful and necessary components like route discovery and route maintenance. SIMULATION AND EVALUATION<\/strong> END TO END DELAY Figure 3 End to End Delay comparisons on network size<\/span><\/p>\n Figures 1, 2 and 3 shows the average delay of end-to-end traversal of packets in protocols DSDV and DSR f the number of nodes 50, 75 and 100. It is clear that DSDV has less delay than DSR end-to-end in the fewest number of hops, because DSDV is a proactive protocol which already all information is stored guidance in the table. Thus, it consumes less time so the end-to-end delay is a measure of the extent of adaptation is directed to various restrictions in the network protocol, and is relying on a routing protocol [10] [11].<\/p>\n CONCLUSION<\/strong> FUTURE WORK<\/strong> pp 1\u20103 Rakhi Purohit Dept. of CSE, Suresh Gyan Vihar University,\u00a0Jaipur, Rajasthan, India Abstract\u2014 DSDV and DSR are routing protocols of mobile ad hoc networks. DSDV is a proactive type routing protocol whereas DSR is a reactive type of routing protocol. Both DSDV and DSR are very well known MANET protocols. A Mobile Ad hoc […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[50],"tags":[],"class_list":["post-487","post","type-post","status-publish","format-standard","hentry","category-volume-3-issue-1-2017-journal-of-engineering-and-technology"],"yoast_head":"\n
\nAn MANET is a wireless network made by peer to peer networking of devices using wireless communication within nodes. It does not need any device to working as Wireless Access Point [3]. It is a convention, or standard, that controls the way how a node can decide the way to transmit packets in network between computing devices. The actual and true goal of any mobile ad-hoc network routing protocol is to overcome from challenges of the dynamically changing topology and maintain an efficient route between any two nodes with minimum routing overhead and bandwidth consumption.\u00a0In Mobile ad-hoc networks, nodes have to discover the topology. In this type of network the topology is not predetermined or established at network start-up. The main goal is that a new node may advertise its presence in network and each node should listen for broadcast by its neighbor\u2019s nodes. Each node should aware about nodes nearby and how to reach them, and may announce that it, too, can reach them.<\/p>\n
\nDetermining optimal routing paths and, transferring the information between the various sets have two process which involves in the process of routing through an internet work in simulation. As the network topology constantly changing, so the issue of routing packets between the source and destination pairs of nodes. Becomes a challenging task [1], mostly protocols based on reactive technique of routing instead of proactive routing technique. The multi cast type of routing is a typical task because of multi cast tree which is not static due to the nodes move randomly in the network of simulated scenario [5]. The\u00a0Routes that are in between various nodes could be consisting of multiple network nodes, which are much more complex from a single hop communication.<\/p>\n
\nThis technique is good performer but time consuming. The routing overhead of this technique is more due to routes has to be defined before packet transferring, also this protocols have less latency due to all the routes should be maintain frequently basis[5].
\nThis protocol attempts to maintain routing table details and up-to-date routing details from all the network nodes. Route details are stored in various tables for utilize to forward a packet when needed. The routing tables frequently updated as the network topology changes.<\/p>\n
\nIt is an On-demand routing protocol that is due to the data packet follow the routes which is not predefined or regular updated or in other word created on demand when needed\u00a0When routing needed source node make request to discover or prepare route for a new route for transmission, this step performs only when a transmission is has to perform. This technique is utilizing flooding algorithm. This is based on the technique in which a node performs broadcasting of the transferring packet to all of the neighbors and they also forward that packet to respective near nodes.
\nRepeat this technique in the way of final destination, and have a higher delay less routing overhead.\u00a0On Demand routing protocol does not maintain routes all the time, but to create a route, only when the transmission must be implemented. The agreement to perform two different operations to find and prepare the route, the first route is found and the second holding route. When it first started in the transmission network discovery route, when all routes are found, review and begin the transfer process as long as it finds topology due to mobility, a change of route maintenance process response.<\/p>\n
\nInstruction and NS2 statement can define the topology of the network and node movement, and to configure the service source and receiver to create a trace file statistics.\u00a0NS-2 is a discrete event simulation for network research. It provides routing and multicast protocols to simulate the strong support of wired and wireless networks. It includes two simulation tools. Network Simulator (NS) contains all the commonly used IP protocol. Web animation (NAM) is the use of visual simulation.
\nThe mobility model is used as random mobility model [10] The purpose of the 500-meter field structure point \u00afx500 field for 50, 75 and 100 nodes variable node count. Transfer from the position of the packet to its destination, to use a particular speed. After a transfer is complete, another transport after a certain pause time starts. The mobile node also affects the dwell time, the relative speed which can be changed. In order to get a fair result many traffic programs and protocols liquidity should not be much the same as we are accustomed.\u00a0The simulation environment taken in this analysis is Network Simulator NS2 [7], which is a powerful and simple event driven simulation tool. NS2 is very useful in examination and implementation of networks logically to save the cost and time of physical simulation and implementation. This simulator provides facility for simulation of wired and wireless networks with support of various protocols. The simulation we done is to evaluate the performance of MANET routing protocols DSDV and DSR depends on node delay Analysis.<\/p>\n![\"\"](\"http:\/\/www.gyanvihar.org\/journals\/wp-content\/uploads\/2018\/12\/aa-22.jpg\")
<\/p>\n
\nIt is an average delay of data packets from the source to the destination. It is also called latency data. And measured the time it takes between the generation of data packets and the last part of his arrival to the destination, the packet end-to-end delay is the average time it takes to pass the packet network. It is the time for generation in the package sent to the receipt in the application layer destination and is measured in seconds. Therefore it includes all delays in the network, such as buffer queues, the transmission time of the delay caused by directing activities and exchange control MAC. Different require different levels of packet delay. Featuring the network from intruders by node mobility, re-send the package because of poor signal strength between the nodes, and tear the contact-making, and this caused a delay in the network to increase.<\/p>\n![\"\"](\"http:\/\/www.gyanvihar.org\/journals\/wp-content\/uploads\/2018\/12\/aa-23.jpg\")
<\/p>\n
\nAfter performing these tasks, it is found that characteristics of these two types of protocols are different. In this paper, some of the results calculated from the actual comparison in DSDV and DSR. Proactive and reactive performance DSDV and DSR protocols were simulated and analyzed with the NS-2 simulator. Behind this observation the main motto is to simulate the network and theoretical obtained results by comparison of facts. We found, DSR better than DSDV pattern shown in figure. DSR flow rate and speed better, due to the high mobility of nodes. DSDV is better than DSR. Thus, DSR is better implementing protocol, then DSDV<\/p>\n
\nI would like to add some new tasks to perform some complex simulation performance found in mobile Ad-hoc network routing protocols deeper analysis. Some new protocols like analog plug-ins. I not only for the comparison, but also for more new areas in the networking and communications are so many important concepts of routing protocol for such simulation. In the future try to pay more attention to all kinds of security issues of these types of networks.
\n.
\nREFERENCES<\/strong>
\n[1] Xi Hu , Jinkuan Wang, Cuirong Wang \u201c Mobility-adaptive Routing for Stable Transmission in Mobile Ad Hoc Networks \u201c JOURNAL OF\u00a0COMMUNICATIONS, VOL. 6, NO. 1, February 2011
\n[2] Rakesh Poonia, Amit Kumar Sanghi, Dr. Dharm Singh \u201cDSR Routing Protocol in Wireless Ad-hoc Networks: Drop Analysis \u201d International Journal of\u00a0Computer Applications (0975 \u2013 8887) Volume 14\u2013 No.7, February 2011
\n[3] Asma Ahmed, A. Hanan, Shukor A. R., Izzeldin M. \u201cRouting in Mobile Ad hoc Network \u201d IJCSNS International Journal of Computer Science and Network Security, VOL.11 No.8, August 2011
\n[4] Beigh Bilal Maqbool Prof.M.A.Peer \u201cClassification of Current Routing Protocols for Ad Hoc Networks – A Review \u201d International Journal of\u00a0Computer Applications (0975 \u2013 8887) Volume 7\u2013 No.8, October 2010
\n[5] Sunil Taneja , Ashwani Kush \u201cA Survey of Routing Protocols in Mobile Ad Hoc Networks\u201d International Journal of Innovation, Management and\u00a0Technology(2010 – 0248) Vol. 1, No. 3,August 2010
\n[6] Md. Anisur Rahman, Md. Shohidul Islam, Alex Talevski \u201cPerformance Measurement of Various Routing Protocols in Ad-hoc Network \u201c Proceedings of the International MultiConference of Engineers and Computer Scientists 2009 Vol I ,IMECS 2009, March 2009
\n[7] Samyak Shah, Amit Khandre, Mahesh Shirole, Girish Bhole \u201c Performance Evaluation of Ad Hoc Routing Protocols Using NS2 Simulation\u00a0\u201c Mobile and Pervasive Computing (CoMPC\u20132008)
\n[8] Padmini Misra \u201c Routing Protocols for Ad Hoc Mobile Wireless Networks\u201d http:\/\/www.cis.ohio-state.edu\/~misra
\n[9] Furqan Haq and Thomas Kunz \u201cSimulation vs. Emulation: Evaluating Mobile Ad Hoc Network Routing Protocols \u201cSystems and\u00a0Computer Engineering Carleton University\u00a0Ottawa, Ont., Canada K1S 5B
\n[10] Gianni A. Di Caro ,\u201d Analysis of simulation environments for mobile ad hoc networks \u201c Technical Report No. IDSIA-24-03 IDSIA \/ USI-SUPSI , Dalle Molle Institute for Artificial Intelligence Galleria, Switzerland , December 2003
\n[11] Karthik sadasivam \u201c Tutorial for Simulation-based Performance Analysis of MANET Routing Protocols in ns-2″
\n[12] KAPANG LEGO , PRANAV KUMAR SINGH, DIPANKAR SUTRADHAR \u201cComparative Study of Adhoc Routing Protocol AODV , DSR and DSDV in Mobile Adhoc Network\u201d Indian Journal of Computer\u00a0Science and Engineering,Vol. 1 No. 4 364-371<\/p>\n","protected":false},"excerpt":{"rendered":"