International Journal of Computer Networking, Wireless and Mobile Communications (IJCNWMC) ISSN 2250-1568 Vol.

3, Issue 1, Mar 2013, 117-122 TJPRC Pvt. Ltd.

PERFORMANCE ANALYSIS OF A ROUTED ADHOC NETWORKS USING DIFFERENT ROUTING ALGORITHMS

PARAMJIT SINGH1, AJAY K SHARMA2 & T S KAMAL3
1 2 3

Punjab Technical University Jalandhar, Punjab, India

National Institute of Technology, Jalandhar, Punjab, India

Doaba Institute of Engineering & Technology, Kharar, Punjab, India

ABSTRACT
This paper evaluates the performance in terms of average routing delay, routing traffic transmit and received, route discovery time, throughput parameters of a routed adhoc-network in area of 5 Km consist of 50 mobile nodes with each node of random waypoint mobility from 0 to 500 m, for VoIP telephony application by means of different proactiveand reactive- routing algorithms such as Adhoc On-demand Distance-Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) routing algorithms.

KEYWORDS: MANET Network, Routing Algorithms, Adhoc On-demand Distance-Vector (AODV) Algorithm,
Dynamic Source Routing (DSR) Algorithm, OLSR (Optimized Link State Routing) Algorithms

INTRODUCTION
A wireless adhoc network is the collection of autonomous nodes that communicate in multi-hop manner to maintain connectivity without incorporating a server or base station and also associated with dynamic topology changes, bandwidth-constrained, energy constrained operation, limited physical security, mobility-induced packet losses, limited wireless transmission range, broadcast nature of the wireless medium, hidden terminal problem, packet losses due to transmission errors [1-3]. In recent years, a variety of new routing protocols have been developed to overcome these problems in adhoc networks and known as source- initiated on demand driven routing protocols. In source initiated ondemand routing, routes are only created when desired by the source node using route discovery to find all possible routes. After a route is established, it is maintained by a maintenance procedure until the route is no longer desired or the destination can no longer be reached using this route. Many different source-initiated on-demand routing protocols have been proposed [4-7]. DSR (Dynamic Source Routing), a reactive protocol that doesnt use periodic advertisements thereby reducing network bandwidth overhead, computes the routes when necessary and then maintains them [4] using Route discovery and Route maintenance stages. A host initiating a route discovery broadcasts a route request packet which may be received by those hosts within wireless transmission range of it. The route request packet identifies the host, referred to as the target of the route discovery, for which the route is requested. DSR provides a unique advantage by virtue of source routing. As the route is part of the packet itself, routing loops, either short-lived or long-lived, cannot be formed as they can be immediately detected and eliminated. An alternate algorithm named as AODV (Ad Hoc On-demand Distance-Vector Protocol) [5] offers low network utilization and uses destination sequence number to ensure loop freedom. It is a reactive protocol that requests a route when needed and does not maintain routes for those nodes that do not actively participate in a communication. An important feature of AODV is that it uses a destination sequence number, which corresponds to a destination node that was requested by a routing sender node. The destination itself provides the number along with the

118

Paramjit Singh, Ajay K Sharm & T S Kamal

route it has to take to reach from the request sender node up to the destination. If there are multiple routes from a request sender to a destination, the sender takes the route with a higher sequence number. This ensures that the ad hoc network protocol remains loop-free. In, the IETF MANET Working Group introduces the Optimized Link State Routing (OLSR) protocol for mobile Ad-Hoc networks [7] which is an optimization of the pure link state algorithm. The key concept used in this protocol is Multi-Point Relays (MPRs) which are selected nodes that forward broadcast messages during the flooding process [6]. This technique substantially reduces the message overhead as compared to a pure flooding mechanism where every node retransmits messages throughout the network. By doing so, contents of the control messages flooded in the network are also minimized. So contrary to the classic link state algorithm, instead of all links, only small subsets of links are declared. The smaller the MPR set, the less overhead the protocol introduces. In this work, The QoS parameters of an adhoc- and routed adhoc-network are observed with source initiated on-demand routing algorithms such as AODV, DSR and OLSR routing algorithms. Matrices used to evaluate average routing delay, routing traffic transmit and received, route discovery time, throughput parameters of a routed adhoc-network in area of 5 Km consist of 50 mobile nodes with each node of random waypoint mobility from 0 to 500 m for VoIP telephony application.

SIMULATION SETUP
Using OPNET simulator, a wireless adhoc network with simulation area 5 Km incorporating VoIP traffic. The simulation scenario consists of 50 voice-applications based mobile workstations with each node of random waypoint mobility from 0 to 500 m in an IBSS adhoc network as shown in Figure 1. The performance of the mobile wireless system is evaluated by implementing various routing protocol schemes that are ADOV-, OLSR-, DSR- adhoc routing techniques. The buffer size of data is set to 2024 Kbps of each immobile workstation at data rate of 11Mbps with 802.11b PHY layer implementation. The traffic flows randomly between different voices applications workstations placed at different distances as shown in Figure 1.

Figure 1: Adhoc Network Scenario Consist of 50 Mobile Nodes

Performance Analysis of a Routed Adhoc Networks using Different Routing Algorithms

119

RESULTS AND DISCUSSIONS

Figure 2 calculates the Route discovery Time of each transmitted packet during the simulation for our proposed Adhoc network shown in Figure 1 consist of 50 mobile nodes with each node of random waypoint mobility from 0 to 500 m for VoIP telephony application. It is observed from the graph that at the beginning AODV takes more time for route discovery as compare to DSR but decreases and further, becomes equal to the route discovery time of DSR. Further, we have calculated the total traffic packets transmitted by the mobile nodes in our proposed adhoc network using different routing protocols as shown in Figure 3 and 4. From our results, it is reported that the AODV transmit the less number of packets as compare to the others protocols while the transmission rate of DSR is maximum and OSLR transmit packets in between the two. Also, the percentage of packet drop of transmitted traffic by the mobile nodes in Adhoc network is maximum with AODV and minimum with DSR routing protocols as shown in Figure 3.

Figure 2: Calculation of Route Discovery Time for 50 Nodes using Reactive on Demand Protocols

Figure 3: Calculation of Total Packet Dropped for 50 Nodes using Reactive on Demand Protocols

120

Paramjit Singh, Ajay K Sharm & T S Kamal

Figure 4: Calculation of Routing Traffic sent using Different Routing Protocols

Figure 5: Calculation of Routing Received using Different Routing Protocols

Figure 6: Calculation of Average Routing Delay using Different Routing Protocols

Performance Analysis of a Routed Adhoc Networks using Different Routing Algorithms

121

Figure 7: Calculation of throughput using Different Routing Protocols Further, the traffic packets recieved is maximum in case of OSLR and minimum in case of AODV routing protocols while traffic packets receiving in case of DSR lies in between the two as shown in Figure 5. The throughput of OLSR enabled Adhoc network is high as compare to the DSR- and AODV- enabled Adhoc network as shown in Figure 7. But, in terms of the average routing delay, OLSR- and AODV- enabled Adhoc network performs better as compare to DSR enabled Adhoc network as shown in Figure 6.

CONCLUSIONS
This paper evaluates the performance in terms of QoS parameters of a routed adhoc-network for video- and voicedata by means of different source-initiated on-demand routing algorithms such as Adhoc On-demand Distance-Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) routing algorithms. Our results discussed in above section reveals that DSR enabled Adhoc network performs better than OLSR- and AODV- enabled Adhoc network but at the cost of high average routing delay.

REFERENCES
1. The NS Manual, the VINT Project, a Collaboration between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC, December 13, 2003 2. Lars Michael Kristensen, An Introduction to Ad Hoc Networking Department of Computer Science University of Aarhus. 3. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks Georgia Institute of Technology. 4. Arun Kumar B. R , Lokanatha C. Reddy , Prakash S. Hiremath, Performance Comparison of Wireless Mobile Ad-Hoc Network Routing Protocols , IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6, June 2008.

122

Paramjit Singh, Ajay K Sharm & T S Kamal

5.

David B. Johnson, David A. Maltz, and Yih-Chun Hu, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), <draft-ietf-manet-dsr-10.txt> Internet-draft, 19 July 2004.

6.

Qayyum, L. Viennot, and A. Laouiti, .Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks., INRIA Research Report RR- 3898, February 2000

7.

P. Jacquet, P. Muhlethaler, A. Qayyum, A. Laouiti, L. Viennot, and T. Clauseen, Optimized Link State Routing Protocol, Internet Draft, Mobile Ad-Hoc Networking Working Group, March 2002