National Congress on Communications and Computer Aided Electronic Systems (CCAES 2012)

Performance evaluation of routing protocols in MANETs

B BRAMHAREDDY$

Vignana Bharathi Institute of Technology*#$ Ghatkesar (M), R.R.Dist-501301 HYDERABAD [email protected] [email protected] [email protected]

Abstract- A mobile ad hoc network is multi hop wireless network it does not rely on any preexisting infrastructure. Mobile ad hoc networks are characterized by dynamic topologies due to uncontrolled node mobility and wireless devices constrained by battery power. One of the key challenges in such networks is to design dynamic routing protocols that are efficient and consume less overhead. AODV and most of the on demand routing protocols uses single route reply in reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages which increases the communication delay and decreases the packet delivery ratio. To avoid these problems Reverse AODV is used. In Reverse AODV route reply is not unicast but it has multiple route replies. In this paper the performance of Reverse AODV is evaluated and compared with AODV and DSDV in terms of packet delivery ratio and control packet overhead using NS 2 simulator. KEYWORDS- QOS, MANET, R AODV, AODV, DSDV 1. Introduction

network. Only interaction among them is used to provide such functions in a network. According to the wireless nodes movement, ad hoc network is classified in two major categories: Static ad-hoc network and Mobile ad-hoc network. In static ad-hoc network, location of mobile node is not frequently changed once network is deployed. In mobile ad-hoc network, all nodes are free to move without any restriction and topology of network is changing dynamically without any prior notice. This kind of network is abbreviated as MANET. A mobile ad-hoc network (MANET) is an autonomous system of mobile routers connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the networks wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger internet. 2. AODV routing protocol

The mobile ad-hoc network is a collection of two or more wireless nodes which might be mobile and able to communicate with each other either directly within radio range or by multi hop data forwarding operation if they are not directly within radio range. The wireless ad-hoc network is formed by any wireless devices which have networking capability and they are within radio range without any support of central administration and infrastructure. In such a way, ad-hoc network has been created, organized and administered by wireless node itself on the fly. None of the wireless node has right of administration and control to support the

The Ad hoc On-Demand Distance Vector (AODV) algorithm enables dynamic, self-starting, multi hop routing between participating mobile nodes wishing to establish and maintain an ad hoc network. AODV is designed for networks with tens to thousands of mobile nodes. One feature of AODV is the use of a destination sequence number for each routing table entry. The sequence number is created by the destination node. The sequence number included in a route request or route reply is sent to requesting nodes. Sequence number are very important because they ensures loop freedom and is simple to program. Sequence numbers are used by other nodes to determine the freshness of routing information. If a node has the choice between two routes to a destination, a node is required to select the one with the greatest sequence number.

Performance evaluation of routing protocols in MANETs

AODV deals with routing table. Every node has a routing table. When a node knows a route to the destination, it sends a route reply to the source node. Its entries are Destination IP Address, Prefix Size, Destination Sequence Number, Next Hop IP Address, Lifetime (expiration or deletion time of the route), Hop Count (number of hops to reach the destination), Network Interface and Other state and routing flags (e.g., valid, invalid) 2.1 AODV 1. The node broadcasts a RREQ to find a route to the destination. S generates a Route Request with destination address, Sequence number and Broadcast ID and sent it to his neighbor nodes. 2. Each node receiving the route request sends a route back (Forward Path) to the node. 3. A route can be determined when the RREQ reaches a node that offers accessibility to the destination, e.g., the destination itself). 4. The route is made available by unicasting a RREP back to D and is written in the routing table from S. After receiving the route reply every node has to update its routing table if the sequence number is more recent. 5. Now node S can communicate with node D. 6. When a link break in an active route is detected, the broken link is invalid and a RERR message is sent to other nodes. If the nodes have a route in their routing table with this link, the route will be erased. Node S sends once again a route request to his neighbor nodes. Or a node on the way to the destination can try to find a route to D. That mechanism is called Local Route Repair.

simple logic of nodes discarding non better packets for same broadcast-id. Coping up with dynamic topology and broken links: When the nodes in the network move from their places and the topology is changed or the links in the active path are broken, the intermediate node that discovers this link breakage propagates an RERR packet. And the source node re-initializes the path discovery if it still desires the route. This ensures quick response to broken links. It is highly scalable because of the minimum space complexity and broadcasts avoided when it compared with DSDV. 3. Reverse AODV (R-AODV) routing protocol

Most of the on demand routing protocols (AODV) uses single route reply in reverse path to establish routing path. But in high mobility, pre decided reverse paths can be disconnected and route reply message from destination to source is missed. Hence source node needs to retransmit the route request message. The modified AODV (R-AODV) protocol discovers routes on demand using a reverse discovery procedure. During route discovery procedure source node and destination node plays same role in sending control messages like AODV. The source node sends a RREQ message to destination. Thus after receiving RREQ message, the destination node floods a reverse request (R-RREQ) to find source node. When source node receives R-RREQ message, then data packet transmission will then starts. In this manner, R-AODV prevents a large number of retransmissions of route request messages, and hence reduces the congestion in the network. Hence, R-AODV will improve the routing performance such as packet delivery ratio and end-toend delay. The RREQ message contains following information: message type, source address, destination address, broadcast ID, hop count, source sequence number, destination sequence number, request time (timestamp). Whenever the source node issues a new RREQ, the broadcast ID is incremented by one. Thus, the source and destination addresses, together with the broadcast ID, uniquely identify this RREQ packet. The source node broadcasts the RREQ to all nodes within its transmission range. These neighboring nodes will then pass on the RREQ to other nodes in the same manner. As the RREQ is broadcasted in the whole network, some nodes may receive several copies of the same RREQ. When an intermediate node receives a RREQ, the node checks if already received a RREQ with the same broadcast id and source address. The node cashes

Figure 1: Routing in AODV protocol

AODV has is Minimal space complexity, the nodes that are not in the active path do not maintain information about this route. After a node receives the RREQ and sets a reverse path in its routing table and propagates the RREQ to its neighbors, if it does not receive any RREP from its neighbors for this request, it deletes the routing info that it has recorded. This algorithm maintains loop free routes by using the

National Congress on Communications and Computer Aided Electronic Systems (CCAES 2012)

broadcast id and source address for first time and drops redundant RREQ messages.

When the destination node receives first route request message, it generates so called reverse request (R-RREQ) message and broadcasts it to neighbor nodes within transmission range like the RREQ of source node does. R-RREQ message contains following information: reply source id, reply destination id, reply broadcast id, hop count, destination sequence number, reply time (timestamp). 4. Destination sequenced distance routing protocol (DSDV) vector

The broadcasting of the information in the DSDV protocol is of two types namely: full dump and incremental dump. Full dump broadcasting will carry all the routing information while the incremental dump will carry only information that has changed since last full dump. Irrespective of the two types, broadcasting is done in network protocol data units (NPDU). Full dump requires multiple NPDUs while incremental requires only one NPDU to fit in all the information. When an information packet is received from another node, it compares the sequence number with the available sequence number for that entry. If the sequence number is larger, then it will update the routing information with the new sequence number else if the information arrives with the same sequence number it looks for the metric entry and if the number of hops is less than the previous entry the new information is updated (if information is same or metric is more then it will discard the information).While the nodes information is being updated the metric is increased by 1 and the sequence number is also increased by 2. During broadcasting, the mobile hosts will transmit their routing tables periodically but due to the frequent movements by the hosts in the networks, this will lead to continuous burst of new routes transmissions upon every new sequence number from that destination. DSDV protocol has guarantees loop free path, we can avoid extra traffic with incremental updates instead of full dump updates. DSDV maintains only the best path instead of maintaining multiple paths to every destination. With this, the amount of space in routing table is reduced. DSDV is requires a regular update of its routing tables, which uses up battery power and a small amount of bandwidth even when the network is idle. Whenever the topology of the network changes, a new sequence number is necessary before the network reconverges; thus, DSDV is not suitable for highly dynamic networks. DSDV doesnt support Multi path Routing. 5. Simulation Results

The destination sequenced distance vector routing protocol is a proactive routing protocol .This protocol adds sequence number, to each route table entry at each node. Routing table is maintained at each node and with this table; node transmits the packets to other nodes in the network. Routing information is advertised by broadcasting or multicasting the packets which are transmitted periodically as when the nodes move within the network. The DSDV protocol requires that each mobile station in the network must constantly; advertise to each of its neighbors, its own routing table. Since, the entries in the table my change very quickly, the advertisement should be made frequently to ensure that every node can locate its neighbors in the network. This agreement is placed, to ensure the shortest number of hops for a route to a destination; in this way the node can exchange its data even if there is no direct communication link. The data broadcast by each node will contain its new sequence number and the following information for each new route are destination address, number of hops required to reach the destination and new sequence number, originally stamped by the destination. The transmitted routing tables will also contain the hardware address, network address of the mobile host transmitting them. The routing tables will contain the sequence number created by the transmitter and hence the most new destination sequence number is preferred as the basis for making forwarding decisions. This new sequence number is also updated to all the hosts in the network which may decide on how to maintain the routing entry for that originating mobile host. After receiving the route information, receiving node increments the metric and transmits information by broadcasting. Incrementing metric is done before transmission because, incoming packet will have to travel one more hop to reach its destination.

The protocols AODV, R-AODV, DSDV are simulated by using network simulator for the parameters Packet Delivery Ratio, Average-end-to-end Delay and Control packet overhead.

Performance evaluation of routing protocols in MANETs

Table 1: Simulation scenario

Routing protocols Number of nodes Simulator Simulation Time Pause Time Mobile speed Area Transmission range Parameters

AODV, RAODV,DSDV 10,20,30,40,50 NS2 100secs 0-100secs maxspeed (2,5,10,25,50,75m/s) 1000m*1000m 250m Packet Delivery Ratio, Average-endto-end Delay and Control, packet overhead

Figure 4 Packet Delivery Ratio when number of nodes varies (Pause time 100)

Packet Delivery Ratio: It is defined as the ratio of packets reaching the destination node to the total packets generated at the source node.

Figure 5 Packet Delivery Ratio when node speed varies (Pause time 0) Figure 2 Packet Delivery Ratio when number of nodes varies (Pause time 0)

Figure 6 Packet Delivery Ratio when node speed varies (Pause time 50) Figure 3 Packet Delivery Ratio when number of nodes varies (Pause time 50)

National Congress on Communications and Computer Aided Electronic Systems (CCAES 2012)

Figure 7 Packet Delivery Ratio when node speed varies (Pause time 100) From the above figure 7 it is clear that the packet delivery ratio is high for both AODV and RAODV. But packet delivery ratio is less for DSDV. Control Packet Overhead: It is defined as the sum of all route request messages, route reply messages and route error messages.

Figure 9 Control packets overhead when number of nodes varies (pause time 100) From the figure 8 control packet overhead is less for DSDV. It is more for RAODV as compared to AODV. The reason is that R AODV floods route reply message, but route reply message is unicast along reverse path. Half of these are R RREQ. Conclusion In this paper the performance of DSDV, AODV and RAODV routing protocols are compared in terms of their performance parameters such as packet delivery ratio and control packet overhead using Network Simulator(NS2) for different number of nodes(10,20,30,40,50) and different number of node speed (2,5,10,25,50,75 ) for different pause times (0,50,100). From the results it is clear that at low mobility rate AODV performs better in case of packet delivery ratio but it performs poorly in terms of control packet overhead. At high network load and mobility RAODV performs well with respect to packet delivery ratio. However it is clear that when mobility is low, AODV performs well among the three and when mobility is high RAODV performs well. DSDV performs poorly in terms of packet delivery ratio due to its wide range of flooding in route discovery. But DSDV performs well in terms of control packet overhead due to less route discovery time in intermediate node. Acknowledgment: This work is supported by Major Research project funded by University Grants Commission, New Delhi, India. References [1] S. Kent, C. Lynn, J. Mikkelson, K. Seo, Secure Border Gateway Protocol (S-BGP) real world performance and deployment issues, in: Symposium on Network and Distributed Systems Security (NDSS_00), February 2000, pp. 103116.

Figure 8 Control packet overhead when number of nodes varies (pause time 0)

Figure 6.8 Control packet overhead when number of nodes varies (pause time 50)

Performance evaluation of routing protocols in MANETs

[2] A. Perrig, R. Canetti, D. Song, J.D. Tygar Efficient and secure source authentication for multicast, in: Network and Distributed System Security Symposium (NDSS_01), February 2001. [3] K. Sanzgiri, B. Dahill, B.N. Levine, E. Royer, C. Shields, A secure routing protocol for Ad hoc networks, Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP_02), November 2002. [4] Y. C. Hu, A. Perrig, D.B. Johnson, Ariadne: A secure on demand routing protocol for wireless ad hoc networks, Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom 2002), September 2002, pp. 1223. [5] Y. C. Hu, A. Perrig, D. B. Johnson, Packet leashes: a defense against wormhole attacks in wireless ad hoc networks, Proceedings of IEEE Infocomm 2003, April 2003. [6] Y. Kim, J. Jung, S. Lee and C. Kim, A Method for Decreasing Control Messages in Ad Hoc Networks, ICCSA 2006, LNCS 3982, PP 64-72, 2006.