International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856

Performance Comparison of Efficient DSDV with DSDV

Rutuja Rajan More 1, Dr. S.V.Sankpal2
1

PG Student at E&TC dept, D.Y. Patil COE & tech., Kolhapur, India
2

Professor at E&TC dept, D.Y. Patil COE & tech., Kolhapur, India

Abstract The volume of research performed in the domain

of Ad Hoc Networks has increased substantially in recent years. This is due to the advancement of fabrication technology of low-power devices containing various sensors along with a wireless interface, allowing costs to be reduced.. In ad hoc networks, routing protocols are expected to implement three main functions: determining and detecting network topology changes (e.g., breakdown of nodes and link failures); maintaining network connectivity and calculating and finding proper routes. In Adhoc networks, up-to-date, less effort has been given to routing protocols, even though it is clear that ad hoc routing protocols (such as temporallyordered routing algorithm (TORA), dynamic source routing (DSR), and ad hoc on-demand distance vector(AODV) are not suited well for Adhoc networks. This paper focuses on Eff-DSDV type of routing protocol which overcomes the problem and thereby improves the performance of regular DSDV. Then comparison of two routing protocols for different network parameters is done using the simulator NS2 and studied the efficient protocol under a particular scenario on the basis of metrics such as Packet delivery ratio, End to end delay and Routing Overhead.

a random, multihop graph or "Ad Hoc" network exists between the nodes. This Ad Hoc topology may change with time as the nodes move or adjust their transmission and reception parameters. 1.1 MANETs characteristics 1.1.1 Dynamic topologies: Nodes are free to move arbitrarily; thus, the network topology which is typically multihop may change randomly and rapidly at unpredictable times, and may consist of both bidirectional and unidirectional links. 1.1.2. Bandwidth-constrained, variable capacity links: Wireless links will continue to have significantly lower capacity than their hardwired counterparts. In addition, the realized throughput of wireless communications after accounting for the effects of multiple access, fading, noise, and interference conditions, etc. is often much less than a radio's maximum transmission rate. One effect of the relatively low to moderate link capacities is that congestion is typically the norm rather than the exception, i.e. aggregate application demand will likely approach or exceed network capacity frequently. As the mobile network is often simply an extension of the fixed network infrastructure, mobile Ad Hoc users will demand similar services. These demands will continue to increase as multimedia computing and collaborative networking applications rise. 1.1.3. Energy-constrained operation: Some or all of the nodes in a MANET may rely on batteries or other exhaustible means for their energy. For these nodes, the most important system design criteria for optimization may be energy conservation. Lack of energy in MANET mobile nodes causes a serious problem in the network. A node in MANET acts as both a router and host. So, died node leads to network partition besides itself out of the network. This thesis focuses on these challenges. 1.1.4. Limited physical security: Mobile wireless networks are generally more prone to physical security threats than are fixed- cable nets. The increased possibility of eavesdropping, spoofing, and denial-ofservice attacks should be carefully considered. Existing link security techniques are often applied within wireless networks to reduce security threats. As a benefit, the decentralized nature of network control in MANETs provides additional robustness against the single points of failure of more centralized approaches [1].

KeywordsAd-hoc network, DSDV, Eff-DSDV, Mobile ad hoc Network (MANET)

1. INTRODUCTION
A MANET consists of mobile platforms (e.g., a router with multiple hosts and wireless communications devices) herein simply referred to as "nodes" which are free to move about arbitrarily. The nodes may be located in or on airplanes, ships, trucks, cars, perhaps even on people or very small devices, and there may be multiple hosts per router. A MANET is an autonomous system of mobile nodes. The system may operate in isolation, or may have gateways to and interface with a fixed network. In the latter operational mode, it is typically envisioned to operate as a "stub" network connecting to a fixed internetwork. Stub networks carry traffic originating at and/or destined for internal nodes, but do not permit exogenous traffic to "transit" through the stub network. MANET nodes are equipped with wireless transmitters and receivers using antennas which may be omnidirectional (broadcast), highly- directional (point-topoint), possibly steer able, or some combination thereof. At a given point in time, depending on the nodes' positions and their transmitter and receiver coverage patterns, transmission power levels and co-channel interference levels, a wireless connectivity in the form of Volume 2, Issue 3 May June 2013

Page 279

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
In addition, some envisioned networks (e.g. mobile military networks or highway networks) may be relatively large (e.g. tens or hundreds of nodes per routing area). The need for scalability is not unique to MANETS [2]. These characteristics create a set of underlying assumptions and performance concerns for protocol design which extend beyond those guiding the design of routing within the higher-speed, semi-static topology of the fixed Internet. The rest of the paper is organized as follows. Section 2 discusses the Routing protocol in mobile ADHOC networks. Section 3 gives the DSDV protocol Section 4 highlights the EffDSDV protocol. Section 4 describes the Simulation Environment and discusses the experimental results. Section 5 concludes the paper. network[4]. The two kinds of table updating in proactive protocols are the periodic update and the triggered update .In periodic update, each node periodically broadcasts its table in the network. Each node just arriving in the network receives that table. In triggered update, as soon as a node detects a change in its neighbourhood, it broadcasts entries in its routing table that have changed as a result. Examples of this class of Ad Hoc routing protocols are the Destination-Sequenced Distance-Vector (DSDV) [5] and the Wireless Routing Protocol (WRP) .Proactive routing tends to waste bandwidth and power in the network because of the need to broadcast the routing tables/updates. Furthermore, as the number of nodes in the MANET increases, the size of the table will increase; this can become a problem in and of itself. In addition, it needs control traffic for continually update stale route entries. Unlike the Internet, an Ad Hoc network may contain mobile nodes and therefore links are continuously broken and re-established.

2. ROUTING PROTOCOL IN MOBILE AD HOC

NETWORKS

A mobile Ad Hoc network is a co-operative network of mobile nodes that communicate over a wireless medium. Ad Hoc networks differ significantly from other existing networks. First, the topology of the nodes in the network is dynamic. Second, these networks are self-configuring in nature and require de-centralized control and administration. Such networks do not assume all the nodes to be in the direct transmission range of each other. Hence these networks require specialized routing protocols that provide self-starting behaviour. Energy constrained nodes; low channel bandwidth, node mobility, high channel error rates, and channel variability are some of the limitations in an Ad Hoc network. Under these conditions, existing wired network routing protocols would fail or perform poorly. Thus, Ad Hoc networks demand special routing protocols. Ad Hoc routing protocols are classified based on the manner in which route tables are constructed, maintained, and updated [3]. Figure 1.2 shows the broad classification of MANET routing protocols.

2.2 Reactive (on-demand) routing protocols Reactive routing protocols take a lazy approach to routing. They do not maintain or constantly update their route tables with the latest route topology. Instead, when a source node wants to transmit a message, it floods a query into the network to discover the route to the destination. This discovery packet is called the Route Request (RREQ) packet and the mechanism is called Route Discovery. The destination replies with a Route Reply (RREP) packet. As a result, the source dynamically finds the route to the destination. The discovered route is maintained until the destination node becomes inaccessible or until the route is no longer desired. The protocols in this class differ in handling cache routes and in the way route discoveries and route replies are handled. Reactive protocols are generally considered efficient when the route discovery is employed rather infrequently in comparison to the data transfer. Although the network topology changes dynamically, the network traffic caused by the route discovery step is low compared to the total communication bandwidth. Examples of Reactive routing protocols are the Dynamic Source Routing (DSR) ,the Ad Hoc on-demand Distance Vector Routing (AODV)[6] and the Temporally-Ordered Routing Algorithm (TORA) .Since the route to destination will have to be acquired just before communication can begin, the latency period for most applications is likely to increase drastically.

2.1 Proactive (Table-Driven) routing protocols: These routing protocols are similar to and come as a natural extension of those for the wired networks. In proactive routing, each node has one or more tables that contain the latest information of the routes to any node in the network. Each node has the next hop for reaching to a node/subnet and the cost of this route. Various tabledriven protocols differ in the way the information about change in topology is propagated through all nodes in the Volume 2, Issue 3 May June 2013

3. DSDV PROTOCOL
The DSDV is enhanced version of the distributed Bellman-Ford Algorithm, wherein each node maintains a table that contains the minimum distance and the first node on the shortest path to every destination node in the network. The Table updates are done with increasing sequence number tags in order to prevent loops, to deal Page 280

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
with count-to-infinity problem, and for faster convergence [5]. Routes to all destinations are available at every node at all times. The tables are exchanged at regular intervals of time so that an up-to-date view of the network topology is maintained. The Tables are also forwarded if a node observes a significant change in local topology. The table updates are initiated by the destinations with a new sequence number which is always greater than the previous one. Upon receiving the table a node may either update its table or may wait for another table from its next neighbor. Based on the sequence number of the table update, it may forward or reject the table. The reconfiguration of a path used by an on-going data transfer session is handled as follows: The end node of the broken link initiates a table update message with the broken link weight assigned to infinity and with a sequence number greater than the stored sequence number for that destination. Each node, upon receiving an update with weight infinity, disseminates it to its neighbours in order to propagate link information to the whole network. Thus a single link break leads to the propagation of table update information to the whole network. One of the drawbacks of this protocol is, the updates due to broken links lead to high control overhead during high mobility. Another drawback is the stale routes: In order to obtain information about a particular destination node, a node has to wait for a table update message initiated by the same destination node shown in Figure 1 and Figure 2 respectively. It can be observed that the hop count field in the packet format can be set to two or one. The host S when finding that the next hop link is broken broadcasts a two-hop routerequest packet to all its neighbors. In return, the neighbors returns the route-ack if it has a valid route to the destination and the host S is not the next hop on the route from the neighbor to the destination [7].

Figure.1 Route-Request Packet Format

4. PROPOSED EFFICIENT DSDV PROTOCOL

The low packet delivery in DSDV especially with more number of nodes and increased mobility speed is due to outdated/stale routes in case of broken links. The existence of stale route does not imply that there is no valid route to the destination. The packets can be forwarded through other neighbors who may have routes to the destination. When an immediate link from the host S to the destination T breaks, the proposed protocol creates a provisional link through a neighbor which has a valid route to the desired destination. The provisional link is created by sending twohop route-request and route-ack messages. The hop count field of the route-request packet can be set to either to one or two. In the proposed strategy it is set to two. Setting the hop count field to two will increase the probability of finding the alternate route than with one. However there will be certain amount of increase in the routing overhead due to the route-request and route-reply packets. Route request packet has host ID, and the destination. If a neighbor has a route leading to the destination in its routing table and the route does not make use of S as the next hop, then the neighbor responds by sending a route ack message. Route ack as shown in the figure has host ID, the destination, the hop count metric for the destination, and the latest updated time for this path to destination. The message formats of the route-request and route-acknowledgement packets are Volume 2, Issue 3 May June 2013 Figure.2 Route-Reply Packet Format Each node maintains its routing table. The routing table entry includes an additional entry for update time of the route. This update time is embedded in the route-ack packet and is used in selecting the provisional route. In the case of receiving multiple route-ack with the same number of minimum hops, ad hoc host A chooses that route which has the latest update time. Therefore, it may be surmised that the proposed Eff-DSDV follows the conventional DSDV but reduces the packet loss due to broken links[8][9]. The details of Eff-DSDV working are given below: 1. If the next hop link of host of required destination is active, then it uses the conventional DSDV Protocol. 2. In case if any outgoing link breaks, the packet is buffered using dynamic buffer management technique for later transmission. The alternate route discovery process starts. The packets (buffered with dynamic buffer management technique) are then forwarded using the latest found route Page 281

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
till, the routing table of host S is updated by the conventional DSDV routing protocol. Thereby it avoids sending the packets using stale routes and hence achieves efficiency Packet delivery ratio of the setup is shown in Figure.3, where the Eff-DSDV protocol excels the regular DSDV protocol.

5. SIMULATION ENVIRONMENT
To evaluate the performance and energy-efficiency of existing routing protocols, we used the event driven simulator ns-2.31 for our simulations[10]. The setup consists of a test bed of 50 nodes confined in a 800mX 800m in rectangular area. Maximum range of each node is assumed to be 250 m and the initial energy of each 1J. We use TwoRayGround because it is more liked realistic. The length of each simulation time is 400sec.The parameters that are considered to perform the simulation are shown in Table I. Table I.Parameters Parameter Network size Number of nodes Node initial Energy Average speed of nodes Pause time Source transmission rate Packet size Simulation Time The propagation Model Value 800x800 m 10 to 50 1J 5m/s 5 sec 4 packet/sec 512 bytes 400sec TwoRayGround Figure.4 End-to-End Delay for Eff-DSDV and regular DSDV as a function of number of nodes Number of control packets produced per mobile node i.e the Routing overhead is seen in Figure. 5

Figure.3 Packet Delivery Ratio for Eff-DSDV and regular DSDV as a function of number of nodes End-to-End Delay between the nodes is seen in Figure. 4 where when the nodes are 30 in number the delay is least.

5.1 Evaluation Metrics In order to evaluate the performance of ad hoc network routing protocols, the following metrics were considered Packet delivery ratio: The ratio of the number of packets originated by the application layer to the number of packets received by the destination. End-to-End Delay: The delay experienced by a packet from the time it was sent by a source till the time it was received at the destination. Routing overhead: The number of control packets produced per mobile node. Control packets include route requests, replies and error messages The detail graphs extracted after the simulation in NS2 are as follows: Volume 2, Issue 3 May June 2013

Figure.5. Routing Overhead for Eff-DSDV and regular DSDV as a function of number of nodes

6. CONCLUSION
In this paper we have implemented the proposed EffDSDV protocol using NS2 simulator. The performance of the proposed protocol is measured with respect to metrics Packet Delivery Ratio and Dropped Packets, End-to-End Delay and Routing Overhead. As the results of simulation Page 282

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
clearly indicates that performance of the Eff-DSDV protocol is very good than normal DSDV protocol. This shows that the Eff- DSDV protocol can deliver more packets with fewer packets dropped or lose of packets when compared to normal DSDV. When the number of nodes increases beyond 35 the performance of both protocols degenerates due to the fact that a lot of control packets are exchanged and traffic increase in the scenario.

References
[1] Hongobo Zhou, A Survey on Routing Protocols in MANETs, Technical Report MI 48824-1027, MSUCSE 03-8 (2003). [2] S. Corson, J. Macker, Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations, RFC 2501 (1999). [3] C.E. Perkins and E.M. Royer, Ad-Hoc on-Demand Distance Vector Routing, Proc. Workshop Mobile Computing Systems and Applications (WMCSA 99), Feb. 1999, pages 90-100 [4] U. Lee, S.F. Midkiff and J.S. Park, A proactive routing protocol for multichannel wireless ad-hoc networks (DSDV-MC),International Conference on Information Technology: Coding and Computing (ITCC05), vol. 2, pp. 710-715 (2005) [5] Khushboo Tripathi, Tulika Agarwal and S. D. Dixit, Performance of DSDV Protocol over Sensor Networks, 2010 [6] Arun Kumar B. R., Lokanatha C. Reddy, Prakash.S.Hiremath, A Survey of Mobile Ad Hoc Network Routing Protocols Journal of Intelligent System Research, January-June 2008; pp. 49-64, Serials Publications, New Delhi, 2008 [7] Khaleel Ur Rahman Khan, Rafi U Zaman and A. Venugopal Reddy. The Performance of the Extended DSDV (eDSDV) MANET Routing Protocol and its Suitability in Integrated Internet-MANET, IJSSST, Vol. 10, No. 2 ISSN:1473-804x [8] X. Lin and S. Rasool, A Distributed Joint ChannelAssignment, Scheduling and Routing Algorithm for Multi-Channel Ad hoc Wireless Networks, IEEE INFOCOM 2007, the 26th Conference on Computer Communications, Issue , 6-12 May 2007 Page(s):1118-1126 [9] Trung-Tuan Luong, Bu-Sung Lee, Chai Kiat Yeo, Channel Allocation for Multiple Channels Multiple Interfaces Communication in Wireless Ad Hoc Networks, 7th International IFIP-TC6 Networking Conference, Singapore, May 5-9, 2008 [10] Kevin Fall and Kannan Varadhan, The ns Manual, UC Berkeley, November 2011.

Volume 2, Issue 3 May June 2013

Page 283