PERFORMANCE OF MOBILE AD HOC NETWORKING ROUTING PROTOCOLS IN REALISTIC SCENARIOS



Similar documents
CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS

Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols

Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks

NetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks

Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols

SIMULATION STUDY OF BLACKHOLE ATTACK IN THE MOBILE AD HOC NETWORKS

International Journal of Wireless & Mobile Networks (IJWMN) Vol. 4, No. 2, April 2012

LIST OF FIGURES. Figure No. Caption Page No.

PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET USING DIRECTIONAL ANTENNA

EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL

Abstract. 1 Introduction. Aleksandr Huhtonen Helsinki University of Technology Telecommunication Software and Multimedia Laboratory ahuhtone@cc.hut.

Implementation of a Lightweight Service Advertisement and Discovery Protocol for Mobile Ad hoc Networks

Energy Efficiency of Load Balancing in MANET Routing Protocols

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK

A Link-state QoS Routing Protocol for Ad Hoc Networks

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK

An Efficient AODV-Based Algorithm for Small Area MANETS

Study of Different Types of Attacks on Multicast in Mobile Ad Hoc Networks

A NOVEL RESOURCE EFFICIENT DMMS APPROACH

LAN Switching Computer Networking. Switched Network Advantages. Hubs (more) Hubs. Bridges/Switches, , PPP. Interconnecting LANs

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization

Influence of Load Balancing on Quality of Real Time Data Transmission*

Intelligent Agents for Routing on Mobile Ad-Hoc Networks

Achieving Energy Efficiency in MANETs by Using Load Balancing Approach

Performance Comparison of AODV, DSDV, DSR and TORA Routing Protocols in MANETs

Security Threats in Mobile Ad Hoc Networks

An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks *

Simulation Based Analysis of VOIP over MANET

Network Lifetime Analysis of AODV, DSR and ZRP at Different Network Parameters

Path Selection Methods for Localized Quality of Service Routing

SECURE DATA TRANSMISSION USING INDISCRIMINATE DATA PATHS FOR STAGNANT DESTINATION IN MANET

Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1

Virtual PortChannels: Building Networks without Spanning Tree Protocol

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS

Study of Network Characteristics Incorporating Different Routing Protocols

VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs

IRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks

Investigating the Performance of Routing Protocols Using Quantitative Metrics in Mobile Ad Hoc Networks

A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2

Securing MANET Using Diffie Hellman Digital Signature Scheme

Optimized Load Balancing Mechanism Using Carry Forward Distance

Dynamic Source Routing in Ad Hoc Wireless Networks

Assignment #3 Routing and Network Analysis. CIS3210 Computer Networks. University of Guelph

Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks

IJMIE Volume 2, Issue 7 ISSN:

Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach

Introduction, Rate and Latency

Location Information Services in Mobile Ad Hoc Networks

International Journal of Advanced Research in Computer Science and Software Engineering

Quality of Service Routing in Ad-Hoc Networks Using OLSR

H.323 Traffic Characterization Test Plan Draft Paul Schopis,

A Catechistic Method for Traffic Pattern Discovery in MANET

Customer Specific Wireless Network Solutions Based on Standard IEEE

Quality of Service Support in Mobile ad-hoc IP Networks *

ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK

VMDC 3.0 Design Overview

Analysis of QoS Routing Approach and the starvation`s evaluation in LAN

AntHocNet: an Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks

Performance Evaluation and Investigation of Energy in AODV, OLSR Protocols through Simulation

Fast and Secure Data Transmission by Using Hybrid Protocols in Mobile Ad Hoc Network

Security Scheme for Distributed DoS in Mobile Ad Hoc Networks

Internet Firewall CSIS Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS net15 1. Routers can implement packet filtering

Keywords- manet, routing protocols, aodv, olsr, grp,data drop parameter.

Ad hoc On Demand Distance Vector (AODV) Routing Protocol

Performance comparison and analysis of routing strategies in Mobile ad hoc networks

Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR

Step by Step Procedural Comparison of DSR, AODV and DSDV Routing protocol

A Performance Comparison of Routing Protocols for Large-Scale Wireless Mobile Ad Hoc Networks

OPNET Network Simulator

Level 2 Routing: LAN Bridges and Switches

Internet Connectivity for Ad hoc Mobile Networks

Objectives. The Role of Redundancy in a Switched Network. Layer 2 Loops. Broadcast Storms. More problems with Layer 2 loops

MPLS Layer 2 VPNs Functional and Performance Testing Sample Test Plans

Tranzeo s EnRoute500 Performance Analysis and Prediction

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

Performance of networks containing both MaxNet and SumNet links

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES

Comparative Study of Performance Evaluation for Mobile Ad hoc networks using a proxy node

EQ-BGP: an efficient inter-domain QoS routing protocol

ISSN: (Online) Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies

CS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012

Improving End-to-End Delay through Load Balancing with Multipath Routing in Ad Hoc Wireless Networks using Directional Antenna

Delay aware Reactive Routing Protocols for QoS in MANETs: a Review

CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs

Transcription:

PERFORMANCE OF MOBILE AD HOC NETWORKING ROUTING PROTOCOLS IN REALISTIC SCENARIOS Julian Hsu, Sameer Bhatia, Mineo Takai, Rajive Bagrodia, Scalable Network Technologies, Inc., Culver City, CA, and Michael J. Acriche, U.S. Army CECOM RDEC ABSTRACT This paper presents a comprehensive study on the performance of common MANET (mobile ad hoc network) routing protocols under realistic network scenarios. The routing protocols used in this study include,,, v2 and, which comprise a good mix of reactive, proactive and hybrid protocols. The paper evaluates these protocols under simulation scenarios based on an actual exercise carried out under the DARPA FCS Communications Program. Mobility of the nodes was simulated using GPS logs from the field exercise. Traffic is simulated using a model of the traffic generation tool that drove traffic in the live exercise, and reads the same script files. The simulation results produced by QualNet are first validated against the corresponding measurements taken from the exercise, and several network configuration parameters are then varied to examine the performance of these protocols under "what-if" scenarios. This simulation study together with its post analysis shows the performance of each protocol under specific conditions both quantitatively and qualitatively. INTRODUCTION The first part of this paper provides a simulator validation via throughput comparisons between the live exercise s reported results and those produced by QualNet simulation runs. The validation base scenario is a four hour simulation that involves live exercises with 19 mobile nodes and a base station. The nodes follow a dual counter rotating ring mobility pattern comprising of an inner loop and an outer loop. There are 5 inner loop nodes and 14 outer loop nodes. The outer loop nodes rotate clockwise whereas the inner loop nodes rotate counter-clockwise. The second part of the paper utilizes QualNet simulation runs to conduct a protocol comparison of,,, v2, and, on the identical network scenario. We provide analytical results that allow us to compare the relative performance of these MANET routing protocols in delivering the five traffic types that were present in the live exercise. QualNet's analysis capabilities allow the modeler to analyze the quantitative performance of protocols in terms of control overhead, route acquisition delay, and route acquisition success rate. Qualitative protocol performance can be measured in terms of packet delivery ratio, latency, and jitter of data packets. It can also provide statistical data on protocol performance when subject to increasing network size, increasing number of hops between sources and destinations, node density, network load, number of source and destination pairs, and increasing mobility. ROUTING ALGORITHMS Open Shortest Path First () 1 routing represents a traditional wired routing protocol. It is a link state algorithm that distributes the state of links in the network between the routers. These routers use the link state information to construct a shortest path tree to all destinations, installing the destinations, associated cost and the next hop to reach those destinations in the IP forwarding table. On demand routing protocols such, as Ad hoc On-demand Distance Vector () 2 routing and Dynamic Source Routing () 3, are more suited for ad hoc environments than traditional wired routing protocols, because they 1 The intra-domain routing protocol version 2 as described in the latest RFC 2328 2 Implementation according to IETF Internet Draft 9 of (draftietf-manet-aodv-9.txt) 3 Implementation according to IETF Internet Draft 7 of (draft-ietfmanet-dsr-7.txt) Page 1 of 6

dynamically find routes when necessary, thereby greatly reducing route storage. Since on demand routing protocols only save route information as needed, they should be more adaptable to large network populations and ever changing network topologies. However, such adaptability comes at a cost: namely the introduction of latency in searching for routes, increased routing control overhead for increased network load, and the loss of control over path quality. Optimized Link State Routing () 4 protocol is a link state protocol designed for the challenges of the ad hoc network. The protocol utilizes multipoint relays (MPRs) which are a subset of the total number of nodes, which forward broadcast messages during the flooding process. Link state information is generated only by nodes elected as MPRs, and the link state updates need not include total link state information. The Zone Routing Protocol () 5 is a hybrid framework composed of a proactive link state routing protocol, which manages routes within the configured radius (zone), and a reactive routing protocol that requests routes for destinations outside the zone. This configurable radius needs to be tailored to the target network scenario, but blends the advantages of each routing style. Our definition of performance is the level to which a routing protocol provides applications with high throughput and low end-to-end delay, relative to the network scenario. Furthermore, the routing protocol itself must use minimal routing control overhead and exhibit high packet delivery ratio (which correlates to high application throughput). In this scenario, the routing protocols must be robust with respect to channel noise interference, multiple paths between sources and destinations, number of hops between the source and destination, and a high amount of mobility related link changes. The routing protocol must handle the large network load in addition to its own control packet overheads. REALISTIC SCENARIOS The base scenario is a 4 hour simulation based on live exercises with 19 mobile nodes and a base station. We used IEEE 82.11b WaveLAN radios with omni 4 Port of INRIA implementation of IETF Internet Draft 3 (draft-ietfmanet-olsr-3.txt) of in C for Linux. 5 Implementation according to IETF Internet Draft 4 of (draft-ietfmanet-zone-zrp-4.txt), Draft 1 of IARP (draft-ietf-manet-zone-iarp- 1.txt), Draft 2 of IERP (draft-ietf-manet-zone-ierp-2.txt), and Draft 2 of BRP (draft-ietf-manet-zone-brp-2.txt) directional antennas, mobility from the GPS logs of the live exercises, and a port of the traffic generator from the exercise to drive traffic generation in the QualNet model. The nodes follow a dual counter rotating ring mobility pattern comprising of an inner loop and an outer loop. There are 5 inner loop nodes and 14 outer loop nodes. The outer loop nodes rotate clockwise whereas the inner loop nodes rotate counter-clockwise. The traffic generated falls into five categories. The first is High Rate traffic, either 12 kbps or 2 kbps of 1 KB packets, depending on the source/destination pair throughout the entire simulation. The second is High Rate Report traffic, from four of the mobile nodes to the base station, with an average of 4 kbps of 1 KB packets, beginning at 9 seconds into the simulation and continuing to simulation end. The third is Bidirectional traffic, averaging 4 kbps between randomly selected node pairs, for 3 seconds each flow. There are 69 such flows throughout the course of the exercise. Finally, there are 15 Low Rate Report traffic sessions, with mobile nodes sending 1 byte packets to the fixed base station at an average of.8 kbps throughout the simulation run. SIMULATOR VALIDATION The traffic generator produces a log of the received throughput over time in kbps. We present an example of the generated graphs that are indicative of the level of conformance between the field measurements and the QualNet runs for each category of traffic. The first is an example of High Rate traffic between nodes 14 and 13. 14 12 1 8 6 4 2 Field Results: Node14-Node13: Fcs11-9-1 8-38 Xabcd-node14-node13..rate.gp 2 4 6 8 1 12 14 16 Figure 1. Field Results of Node14-Node13 Throughput using Page 2 of 6

14 12 1 8 6 4 2 QualNet: Node14-Node13 :(Field Timers) Fcs11-9-1 8-38 Xabcd-node13-node14..rate.gp 2 4 6 8 1 12 14 16 QualNet: Node 15-Xcom :(Field Timers) 5 4 3 2 1 2 4 6 8 1 12 14 16 Figure 2. QualNet Simulated Results of Node14-Node13 Throughput using The QualNet run shows somewhat less variability in this flow than the field exercise, but tracks reasonably closely in maximum throughput and the times during which reduced throughput are noted. The next set of graphs shows the reported throughput for High Rate Report traffic between node 15 and the base station: Figure 4. QualNet Simulated Results of Node15-XCom Node Throughput using Again, the QualNet run is showing less variability, but tracking at a similar level on the timing of lowered throughputs. Even though the traffic generators produce packets at the same rate in QualNet and during the field exercise, we do not expect a perfect match because of differences due to propagation modeling, and differences in the random number streams used by QualNet and the live exercise for MAC backoff timers, etc. 5 Field Results: Node 15-Xcom : The third set shows throughput at node 16 for the Bidirectional traffic class. 4 3 2 1 2 4 6 8 1 12 14 16 Figure 3. Field Results of Node15-XCom Node Throughput using 41 4 39 38 37 36 35 34 33 32 31 Field Results: Node 9-Node16 : 5 1 15 2 25 3 35 Figure 5. Field Results of Node9-Node16 Throughput using Page 3 of 6

Rate (Kb p s) QualNet: Node 9-Node16 :(Field Timers) 41 4 39 38 37 36 35 34 33 32 31 5 1 15 2 25 3 35 Figure 6. QualNet Simulated Results of Node9-Node16 Throughput using This set of data shows the closest match between QualNet and the live exercise, as these were two nodes within one hop of each other, sending for a relatively small amount of time. The final set shows Low Rate Report traffic received by the base station from node 13. As with the first two types of traffic, we are seeing correlation between the QualNet and field experimental results, with reduced variability on the QualNet side. Another potential contributor to this reduced variability is the absence of fading effects, and interference from sources other than the radios themselves (vehicles, power lines, buildings, etc.). PROTOCOL COMPARISON The QualNet network simulator was used to generate the following graphs, which illustrate the comparison between the Field measurements (using ), and the QualNet simulated runs using,, v2, and, with their default parameter settings. These are aggregate percentages of packet receptions for each node pair that participated in the traffic type. The first graph shows the results for High Rate traffic. These connections are either 12 kbps or 2 kbps flows of 1 KB packets, depending on the source/destination pair, transmitting throughout the entire simulation. Field Results: Node 13-Xcom : 2 1.5 1.5 2 4 6 8 1 12 14 16 1.% 9.% 8.% 7.% 6.% 5.% 4.% 3.% 2.% 1.% Figure 7. Field Results of Node13-XCom Node Throughput using 2 1.5 1.5 QualNet: Node 13-Xcom :(Field Timers) 2 4 6 8 1 12 14 16 Figure 8. QualNet Simulated Results of Node13-XCom Node Throughput using.% Node1-19 Node 13-14 Node 2-18 Node 14-13 Node 18-2 Node 19-1 Figure 9. QualNet Simulated High Rate Flow Throughputs The graph demonstrates that has an edge over the other protocols in successfully delivering data to receivers. However, this graph does not depict the control overhead comparison between protocols, or the latency experienced by these flows.,, and are close behind, and v2, as a traditional wired protocol, trails slightly on all flows. However, none of the protocols are dramatically worse than on delivering high traffic flows. This set of traffic results is important because they represent the highest bandwidth flows in the scenario. The second graph shows a subset of the 69 bidirectional flows. These flows 4 kbps between randomly selected node pairs, for 3 seconds each flow. Page 4 of 6

1.% 9.% measurably behind. However, as a proactive link state protocol, does not demonstrate the convergence difficulties of v2, and may be a suitable alternative if low route acquisition latencies are important. 8.% 7.% 6.% 5.% 4.% 3.% 2.% The next graph shows the results for the 15 Low Rate Report traffic sessions, with mobile nodes sending 1 byte packets to the base station at an average of.8 kbps throughout the simulation run. 1.% 1.% 9.%.% Node8-3 Node8-4 Node8-5 Node8-6 Node8-7 Node9-7 Node9-12(35) Node9-12(36) Node9-12(37) Node 9-16 Figure 1. QualNet Simulated Bidirectional Flow Throughputs This graph highlights the fact that on-demand routing, represented by and was the clear victor in the packet delivery statistic. and were the only routing protocols able to deliver packets in all flows (albeit very few between nodes 9 and 12, flow #37), and delivered more packets for all pairs except one in this sample. appears to be the next most successful, which further suggests that on-demand routing is most suited to these particular flows. v2 was unsuccessful in delivering any packets between three of the node pairs, and is a distant last place. The next graph shows the packet reception percentages for High Rate Report traffic, averaging 4 Kbps between four nodes and the base station. 1.% 9.% 8.% 7.% 6.% 5.% 4.% 3.% 2.% 8.% 7.% 6.% 5.% 4.% 3.% 2.% 1.%.% Node1 Node2 Node3 Node5 Node6 Node7 Node9 Node1 Node12 Node13 Node14 Node16 Node17 Node18 Node19 Figure 12. QualNet Simulated Low Rate Report Flow Throughputs This graph indicates that was more successful than at delivering low data rate report flows (with many source, destination pairs), and that on-demand routing, represented by these two protocols, was the most successful in this scenario. v2, even with these small data rate flows, lags painfully behind, sometimes delivering less than half the packets of. performed better than, making the race for second place difficult to call. The final graph below illustrates the latency differences between the protocols. It graphs the Packet Delivery Ratio (PDR) on the Y-axis, and the delay in seconds, logarithmically, on the X-axis. Protocols that have similar PDRs may take more or less time, on average, to deliver those packets, and in this comparison, they did. 1.%.% Node4-xcom1 Node8-xcom1 Node11-xcom1 Node15-xcom1 Figure 11. QualNet Simulated High Rate Report Flow Throughputs This graph continues to demonstrate that v2, in an unmodified form, is not suited to the realistic scenario we used. and lead the pack, with and Page 5 of 6

Packet Delivery Ratio 1.9.8.7.6.5.4.3.2.1.1.1.1 1 1 Delay (seconds) Figure 13. Delay vs. PDR, logarithmic scale While previous graphs indicated that,, and were similarly successful, this graph shows that s packets incurred a significantly larger delay. Only after 7 seconds or so, did catch up and surpass and on the PDR. link state situation, where routes are constantly changing as the nodes move in counter-rotating circles and the network picture never permanently converges. incurs some additional delay in its algorithm, but its PDR curve suggests that as the delays in the network grow and the network size scales, it may prove able to deliver larger percentages of traffic. ACKNOWLEDGEMENTS This work is supported in part by the Defense Advanced Research Projects Agency through the FCS Communications project under contract number DAAD19-1-9-5, and the US Army Communications-Electronics Command (CECOM) through a Small Business Innovation Research (SBIR) project under contract number DAAB7-2-C-P63. CONCLUSION QualNet simulations can be configured to accurately model realistic scenarios in the field with good correlation on the end to end statistics. These simulations can then be extended, or re-run with different parameters, to provide the modeler with the ability to answer additional questions about network performance and optimization, without resorting to costly and time-consuming field exercises. This paper demonstrates this capability by conducting a performance comparison of several MANET routing protocols using the network and traffic configuration from the live exercise. This comparison shows that the protocol performed the best in this type of scenario, with a slight edge in overall throughput, and a lower overall delay-pdr curve. It is important to note that these results are specific to the particular network scenario we ran, without parameter tuning. It provides a good indicator of how suited each protocol is, by default, to this type of live exercise, and a good starting point for analysis and parameter experimentation. We would expect this type of experimentation to yield parameters that would allow its performance to approach that of, and perhaps scale to larger versions of this scenario with a gentler increase in control overhead, given the hybrid proactive and reactive algorithm. showed good resilience to a suboptimal Page 6 of 6