CHAPTER 5 IMPLEMENTATION OF ROUTING PROTOCOLS ON NETWORK SIMULATORS

Transcription

1 Implementation of Routing Protocols on Network Simulators 1 CHAPTER 5 IMPLEMENTATION OF ROUTING PROTOCOLS ON NETWORK SIMULATORS 5.1 Introduction This chapter primarily focuses on the implementation of the theoretical study & observations of both simulators and protocols under consideration in the target research. This chapter focuses on parameters based implementation presented in theoretical analysis and elaborate OMNET++ and NS3 which have been selected after survey. All these routing protocols and network simulators have both complementary merits and demerits enlisted in the chapter 3 & chapter 4. Finally we compared both OMNET++ and NS3 results based on selected parameters i.e. average end-to-end delay, packet delivery ratio, path optimality, routing overhead and throughput. Routing protocols utilized in the research study for simulation include Proactive Routing Protocols (DSDV, OLSR), Reactive Routing Protocols (AODV, DSR) and Hybrid Routing Protocols (ZRP, WARP). Here an exclusive comparison of the processed results from the chosen network simulators has been presented in a vivid manner. After a vigilant screening process we have weighed up among those which of the network simulators are most excellently suited for our research work on the basis of protocol comparison. We conducted a survey for routing protocols as well as network simulators for MANET routing is an important process and it can be simulated in various network simulators for better performance. 5.2 Motivation In the management of simulation, the prime difficulty arises with the quantity of subtle elements executed above its capacity in the models and conventions. Choice of the correct level of the subtle elements is the key; if the choice is less then or, there is a paucity of elements, the results can at best be beguiling even giving false results repeatedly. Conversely, the impact of excessive subtle elements can make the entire simulation process futile. In simulation two things are very important; firstly Implementation of protocols in detail and secondly the simulation

2 Implementation of Routing Protocols on Network Simulators 2 environment. This chapter also lists out the merits and demerits of all the discussed network simulators. This study covers not only the benefits and drawbacks of individual network simulation tools but also analyzes it and spotlights on the errors and benefits of network simulators. Also their specific features have been explained in an elaborate manner without leaving out any detail. The component diagrams of various network simulators have been dictated in. It is a well known fact that in large scale the network simulation tools make use of some network simulation techniques such as discrete event simulation, Parallel discrete event simulation and USSF. These techniques also have been explained in detail in this chapter. This section draws out the acknowledgment contrast between two simulators (NS3 and OMNET++) by looking at the consequences of one situation; executed painstakingly in each test systems with each other. Also, inquires about the diverse levels of subtle elements required in a reproduction keeping in mind the end goal to make it valuable. The parts of points of interest are critical when examinations between test systems are made in light of the fact that the reproduced calculation or conventions ought to be practically indistinguishable to make the correlations as reasonable as could be allowed. As a final motivation this chapter covers implementation and analysis of findings as a theoretical observation and analysis of simulation and protocols done in chapter 3 and chapter 4 for finding out the significant performance difference measured amongst simulators selected in this research i.e. OMNET++ and NS3 for parameters based performance analysis. 5.3 Selected Routing Protocols This research study used selected routing protocols for comparing their performance. The chosen routing protocols that are used in this study are as follows: Ad Hoc On-Demand Distance Vector (AODV) Dynamic Source Routing (DSR) Destination Sequenced Distance Vector (DSDV) Optimized Link State Routing Protocol (OLSR) Zone Routing Protocol (ZRP) Wireless Ad hoc Routing Protocol (WARP)

3 Implementation of Routing Protocols on Network Simulators Network Simulator Characteristics In our research paper a widespread search is performed by us for figuring out which simulator has the near features of the wireless networking and this involves especially in figuring out which specific mobile ad hoc network system and its components has close enough features to network simulators. After a profound analysis of all related simulator features, a list of its predominating characteristics are presented as follows: Basic Features of Network Simulators a) A test system has the assignment of permitting furthermore characterizing the peculiarity of the framework which the specialist centres in duplicating. The network simulator must oblige the universally useful, which is it ought to be adequate for having the capacity to enrich with the default practices of the framework. For example a correspondence network simulator ought to have the components that can demonstrate a little number of correspondence media that is the spread media, for example, air, fibre optics and some more. b) The system simulator ought to be sufficiently bendable to agree to the client and describe its destinations by making utilization of what the simulator offers, for example, again and again, in interchanges system research, clients develop more up to date conventions, or ways to deal with a particular test. They suspect the simulator to make accessible with pluggable elements which may encourage them to quickly actualize the segments which they themselves have outlined by making utilization of the other realistic elements. Elements of the simulator are worthy by method for a particular organization of the test system. This configuration is tranquil noteworthy with regards to the procedure of selecting a simulator. c) Information yield from the genuine framework. Another most unmistakable normal for network simulator is the arrangement of information and yield information from the framework. Information are exceptionally crucial for setting up the most vital parameters of the model, for example, transmission attributes, between landing rates of traffic,

4 Implementation of Routing Protocols on Network Simulators 4 channel loss and some more. Yield information is likewise similarly mandatory as they have the capacity of accepting, as well as deciding the essentialness of the accomplished results. In the comparable way it is likewise similarly huge about the organization of information that is utilized to show enter or to amass yield, given that creating information records or speaking to and examining the yield results ought not to wind up as its very own task Network Simulators Summary In this study, we after a thorough analysis picked out two completely varied types of the network simulators for a comparative study of their performance by means of routing protocols. The network simulators that are chosen for this comparative study are mentioned below: NS3 Network Simulator OMNET++ Network Simulator The above mentioned two network simulators are quite popular as nowadays they are widely used in almost every research and academic fields. It is due to this popularity we have chosen these two network simulators by making use of the MANET routing protocols and the comparative study of the performances are conducted. The prime motive of study begins with analyzing among these two network simulators which one network simulator is better suited for analysing the performance of MANET routing protocol. In the following table 5.1; we in detail discuss all about the description of NS3 and OMNET++ network simulators.

5 Implementation of Routing Protocols on Network Simulators 5 Table 5.1: Comparative Study of NS3 & OMNET++ Features NS3 OMNET++ License Type Language Operating System Open source ( for research and study) C++ and Optional Python Bindings C++ Windows XP, Windows Vista & Windows 7, GNU/Linux, FreeBSD, Mac OS X. GUI Support Yes Yes Document Available Excellent Good Usability Hard Easy Simulation Event Type Discrete event Discrete event Accessible Module Wired, Wireless, Ad hoc and Wireless Sensor Net-works Scalability Limited Enough Random Number Generator Protocols Module used in implementation Number of Node Supported Multiple-Recursive Generator- MRG32k3a AODV-RFC3561 DSR-RFC4728 DSDV-RFC4849 OLSR-RFC7181 ZRP-RFC2026 WARP-RFC2461 Average Open source (for study and research purposes), Commercial (for industrial purposes) Windows XP or Later, Linux, Mac OS X, and other Unix-like system. Wired, Wireless, Ad hoc and Wireless Sensor Net-works. C Mersenne Twister-cRNG AODV-RFC3561 DSR-RFC4728 DSDV-RFC4849 OLSR-RFC3626 ZRP-RFC2026 (Partially) WARP-RFC2461(Partially) Average Parallelism MPI/PVM Comment Targeted primarily for research and educational use and its performance is stable. It provides an extensible and component based analysis and discrete event powerful simulation in academic and research. Thus previous chapter proves as a thorough study of the network simulators and routing protocols. Table 5.1 lists out all the advantages and disadvantages of network simulators NS3 and OMNET++. This table 5.1 also serves as a comparative study among two network simulators namely NS3 and OMNET++ among which the superiority of the protocol should be figured out. 5.5 Simulation of Mobile Ad Hoc Networks

6 Implementation of Routing Protocols on Network Simulators Basic Components of A MANET Environment MANET behaviour while studying the routing protocols has a very important role to play. Therefore it is necessary first to define what we mean when we instance the Mobile Ad Hoc Network. Firstly, what we mean by abstract representation of a network making explicit all such components for consideration in the simulation model. The main components of MANET are as follows. a) NODES. A set of mobile devices with wireless transmission capabilities are called nodes. The number of nodes participates in the network; they can join and leave the network at any time. b) Protocol Stack. Protocol stack means some kind of physical layer which are regulated by OSI protocols layer for node to node communication. These are Application layer, Presentation layer, Session Layer, Transport Layer, Network layer, Data-link layer, Physical layer. c) Channel/Network. This kind of network is couched in environment well defined by the physical characteristics of the node, which affect both the propagation and mobility the pattern of radio signals. d) Mobility. Mobility depends on the characteristics of the user as well as the environments, because here each node travels independently in the environment. e) Data Traffic. It is possible to generate data traffic in term of open session between a pair or a group of users. Often they assume arbitrary forms but its importance lies in the facts that some nodes can open several traffic session at once Implementation Environment Setup The result of the parameter based comparisons amongst simulator has been explained in this chapter. It focuses on the implementation and experimentation of NS3 and OMNET++.

7 Implementation of Routing Protocols on Network Simulators Environment Selection Criteria Based on the research survey conducted in chapter 4 using popularity parameter the most popular open source simulators selected are NS3 and OMNET++ and therefore we selected these for our experimental analysis in this study. In order to make implementation somewhat easier, we provide simple algorithm flooding which perhaps increase the possibility to make the result error-free. Algorithm For a message broadcast through the network, Flooding (Tanenbaum, 2003) is one of the basic algorithms that send the message across to every other node in Mobile Ad Hoc Network. Though this mechanism, the sender message is received by all its neighbours that lie within its transmission range. After receiving each nodes again broadcast the message. In this way the message is transmitted throughout the entire network. Figure 5.1 shows the example of flooding process Part A Part B Part C Part D Figure 5.1 The Flooding Process In the figure 5.1 node m1 is broadcasts initiation as shown in part A. Node m2 receives the broadcast message within the transmission range, and it starts a new broadcast as shown in part b. Enabling m3 and m4 to be able to receive the message as shown in part d. The message is

8 Implementation of Routing Protocols on Network Simulators 8 received by node m1 (part b), since it was the initiator, it ignores the message. This is continues process until every node in the range gets the message. For the experimental observation and analysis of protocols, flooding is implemented carefully on both NS3 and OMNET++ to avoid errors caused by network congestion, packet loss etc. Layer 3 algorithm has to be taken from simulators, layer 1 and layer 2 thus its eliminates the need of protocols TCP or UDP. It is a incoming data, delivered directly to the flooding algorithm from MAC, it is a accessed by other protocols within the application layer to be broadcast. Mobility The mobility model is so designed as to be able to detect the movement pattern of mobile users, their location and also their acceleration changes over time. This detection assumes a prime importance in the analysis of the protocols performance. Mobility model configured with control parameters. For control mobility, set the speed of nodes as 20m/s. Node started movement after 50 sec after the simulation starts in the area of 600x600 meters. Pause time was not considered in this research. Mobility pattern set as Random Waypoint. This was proposed initially by(broch, Johnson, & Maltz, 1998) Johnson and Maltz. With in short time span, it becomes a benchmark to evaluate the MANET routing protocols. Mobility modelling was included in OMNET++ with the mobility framework. With the help of Mobility Helper class; we include mobility model in NS3. With the help of command mobility, Install (WifiStaNodes), include mobility in nodes Environment Setup/Framework Here we provided NS3 and OMNET++ simulation environments as shown in table 5.2. NS3 simulation tool used on Linux platform and OMNET++ used on windows platform. In this simulation we compared proactive, reactive and hybrid protocols with three different scenarios with varying number of nodes 15, 25 and 50 in this experiment. Random Waypoint is the mobility model chosen for the reason it moves directly with a random speed to reach a node randomly set on a destination point. Random Waypoint benefits in that, that it provides high flexibility while creating the network and to an extent also be controlled by the user through setting parameter minimum and maximum speed. These nodes move in the simulation area of 600m* 600m. We used Constant Bit Rate (CBR) for traffic management in mobile Ad hoc

9 Implementation of Routing Protocols on Network Simulators 9 network during packet transmission. The Traffic source used is CBR and packet sizes of 64 to 512 bytes. The metrics defined for interpreting the correct results from the simulation are as follows: Packet Delivery Ratio Throughput Average End-To-End Delay Path Optimality Routing Overhead Table 5.2: Selected Simulators Parameters in Experiment Parameter Values Numbers of Nodes 15,25,50 Communication Channel used Interface Type Wireless Wireless Phy / Phy MAC Type IEEE Movement Model Node Mobility speed Traffic Packet Size Simulators Simulation Area Measuring parameters Random 15m/s CBR bytes NS3, OMNET++ 600m *600 m Packet Delivery Ratio, Throughput, Average End- To- End Delay, Path Optimality, Routing Overhead

10 Implementation of Routing Protocols on Network Simulators Implementation Plan For OMNET Implementation Plan for Proactive Protocols DSDV Node formation is the first step. For this we start new project and select ini file configuration in OMNET++ as shown in fig. 5.2 Figure 5.2: Selecting DSDV Protocol Here, we set number of nodes as 15, 25 and 50s for framing the network, where all the nodes are mobile in nature. After that setting the DSDV protocol as per network's conditions as shown in fig.5.3.

11 Implementation of Routing Protocols on Network Simulators 11 Figure 5.3: Setup for DSDV Then by using the DSDV routing protocol the routing decisions were updated periodically throughout the network as shown in figure 5.4. Figure 5.4: Simulation of DSDV After that we proposed DSDV forward packet to all neighbour nodes by checking the sequence number which is used recently as shown in figure 5.5.

12 Implementation of Routing Protocols on Network Simulators 12 Figure 5.5: Flooding the Packets

13 Implementation of Routing Protocols on Network Simulators 13 If the selected route sequence number is same as the same as the one already in the table means choose route with smaller metric i.e. choose shortest path. And neighbours send the acknowledgement packets to the source and flood the received data packet to next neighbours as shown in figure 5.6. Figure 5.6: Receiving Acknowledgements from the Neighbour Performed packet transmission between source and destination. Finally drawn the graph for PDR, throughput, path optimality, average end to end delay and routing overhead as shown figure 5.25, 5.26 & OLSR Selected the Ini file configuration for setup the OLSR configuration based network, as shown in figure 5.7.

14 Implementation of Routing Protocols on Network Simulators 14 Figure 5.7: Select the OLSR Protocol Configuration File. Node formation is the first step. Here 50s nodes were used for forming the network where all the nodes were mobile in nature. As shown in figure 5.8. Figure 5.8: OLSR Based Ad Hoc Network Setup with 50 Nodes After that we selected source node S and destination node D. In this manner every node in the network exchanged its neighbour s information by broadcasting hello Messages as shown in figure 5.9.

15 Implementation of Routing Protocols on Network Simulators 15 Figure 5.9: Forwarding hello message to Neighbour Then all the nodes built the routing table. After that OLSR routing protocol selected shortest path between the source and destination. Figure 5.10: Flooding the Packet within the Network Performed packet transmission between source and destination as shown in figure 5.10.

16 Implementation of Routing Protocols on Network Simulators 16 Finally, we drawn the graph for PDR, throughput, path optimality, average end to end delay and routing overhead. As shown in figure 5.25, 5.26 and Implementation Plan for Reactive Protocols AODV For Reactive Protocols, we selected the Ini file configuration in order to setup the AODV configuration based network, as shown in figure Figure 5.11: Selecting AODV for Configuration In this experiment phase, Node formation was the first step. Here 50s nodes were used to create the network where all the nodes were mobile in nature as shown in figure After that we selected source node S and destination node D. Figure 5.12: AODV Based Ad Hoc Network Setup for 50 Nodes

17 Implementation of Routing Protocols on Network Simulators 17 After that we selected best path between source and destination by using AODV. After that source node S sent RREQ message to the intermediate nodes which broadcasted RREQ message to the corresponding destination D as shown in figure 5.13 Figure 5.13: Sending RREQ Message to First Neighbours Then Destination sent RREP message to the intermediate nodes which forwarded RREP message to the destination. Afterwards Performed packet transmission between Source S and Destination D as shown in figure 5.14.

18 Implementation of Routing Protocols on Network Simulators 18 Figure 5.14: Packet Transmission with AODV Based Network Finally drawn the graph for PDR, Average end to end delay, throughput, path optimality and routing overhead. As shown in figure 5.25, 5.26 and 5.27 DSR First we selected the Ini file configuration for setup the DSR configuration based network, as shown in figure Figure 5.15: Setting the DSR ini Configuration File In this phase Node formation was the first step. Here 50s nodes were used to form the network where all the nodes were mobile in nature as shown in figure After that we selected source node S and destination node D. Further we Selected best path between source and destination by using DSR. Figure 5.16: DSR Based Ad Hoc Network with 50 Nodes

19 Implementation of Routing Protocols on Network Simulators 19 Then DSR checked the selected path that whether it is expired or not? In such situation if the path is expired it can choose another path. Then source node S sent the route request to the intermediate nodes which forwarded it to the destination as shown in figure Then Destination sent Route reply message to the intermediate nodes which forwards route reply message to the destination. Figure 5.17: Packet Transmissions Through DSR Figure 5.18: Packet Transmissions through Random Source

20 Implementation of Routing Protocols on Network Simulators 20 Here it performed packet transmission between Source S and Destination D as shown in figure Finally drawn the graph for PDR, Average End to End Delay, Throughput, Path Optimality and routing overhead. As shown in figure 5.25, 5.26 and Implementation Plan for Hybrid Routing Protocols ZRP For Hybrid Protocols setup, first we selected the ini file configuration as Hybrid Protocols as shown in figure Figure 5.19: ZRP Configuration ini File Setup

21 Implementation of Routing Protocols on Network Simulators 21 In this again Node formation was the first step. Here 50s nodes were used to form the network where all the nodes were mobile in nature as shown in figure Figure 5.20: ZRP Based Ad Hoc Network Setup with 50 Nodes After that we selected source node S and destination node D. Then ZRP checked whether the destination is in same zone or in another zone. Figure 5.21: Packet Transmission with ZRP Protocols

22 Implementation of Routing Protocols on Network Simulators 22 Here if the destination is in another zone means the source node sends its route request packet to the peripheral node which broadcasts the route request packet to all the nodes in the zone as shown in figure If the destination receives any redundant route request packet means which one node having route to the destination is accepted and it discards the remaining unnecessary packets. Then destination send route reply packet to the source. Performed packet transmission between Source S and Destination D. Finally drawn the graph for PDR, Average end to end delay, throughput, path optimality and routing overhead. As shown in figure 5.25, 5.26 and 5.27 WARP Here we Select the Ini file configuration for setup the WARP configuration based network, as shown in figure Figure 5.22: Selecting WARP Configuration File for Setup

23 Implementation of Routing Protocols on Network Simulators 23 Again here Node formation was the first step. Here 50 nodes were used to form the network where all the nodes were mobile in nature as shown in figure After that we selected source node S and destination node D. Figure 5.23: WARP Based Ad Hoc Network with 50 Nodes. Then we select path between the source and destination by using the WARP which selects the route with the overall best QoS metric value. Further, the Source node sends Route request to the border node which broadcasts the route request packet to all the nodes in the zone.

24 Implementation of Routing Protocols on Network Simulators 24 Figure 5.24 Packet Transmissions in WARP Network Here If the destination receives any redundant route request packet means which one node having route to the destination was accepted and it discards the remaining unnecessary packets as shown as figure Then destination sends route reply packet to the source. Perform packet transmission between Source S and Destination D. Finally drawn the graph for PDR, Average end to end delay, throughput, path optimality and routing overhead. As shown in figure 5.25, 5.26 and Results Obtained with OMNET++ In this experimental phase each experiment was run for a simulation time of 200s and repeated 100 times with varying numbers (i.e. 15, 25, 50) of nodes. For taking these graphs we followed path i.e. go to results folder and then select general.anf file and then select the parameters and plot the graphs and finally save to folder. The average value for all the runs are calculated and plotted in the graphs discussed below.

25 Implementation of Routing Protocols on Network Simulators 25 Figure 5.25: End_To_End Delay Results Figure 5.26: Routing Overhead Results

26 Implementation of Routing Protocols on Network Simulators 26 Figure 5.27: Throughput Results

27 Implementation of Routing Protocols on Network Simulators Implementation Plan for NS Implementation Plan for Proactive Protocols For the implementation in NS3, we have taken version NS-3.23 on linux version ubuntu Then we wrote following commands to run the setup. ns-allinone location to build (./build.py) as shown in figure Figure 5.28 NS3 Building the Setup Step 2: copy the file in manet-routing-compare.cc folder paste into scratch folder Step 3: run this 2 files manet-routing-compare.cc and cpntest (for eg:./waf --run manet-routingcompare --vis) as shown in fig Figure 5.29 Running the MANET Setup File After this we set number of nodes for the ad hoc networks and run the protocol based program as shown in figure 5.30.

28 Implementation of Routing Protocols on Network Simulators 28 OLSR Figure 5.30: Running MANET Network for 50 Nodes After executing the above commands a graphically setup of OLSR based network for 50 nodes as shown in figure5.31. Figure 5.31: OLSR Graphical Network Setup for 50 Nodes in NS3. After that we run simulation for 200 sec as shown in figure 5.32.

29 Implementation of Routing Protocols on Network Simulators 29 Figure 5.32: Packet Transmissions in OLSR Protocol in NS3 Results were stored in trace file, through GNUPLOT we took graphs of these results. DSDV Setting DSDV protocol based network for 50 nodes as shown in fig Figure 5.33: DSDV Based Ad Hoc Network with 50 Nodes

30 Implementation of Routing Protocols on Network Simulators 30 Figure 5.34: Packet Transmission in DSDV Based Protocols in NS3 After that we run simulation for 200 sec as shown in figure Results were stored in trace file, through GNUPLOT we took graphs of these results Implementation Plan for Reactive Protocols AODV With the same code we run AODV protocol and set the network for 50 nodes as shown in figure 5.35.

31 Implementation of Routing Protocols on Network Simulators 31 Figure 5.35: AODV Network Setup for 50 Nodes in NS3 After that we simulated the network for 200 seconds as shown in fig Figure 5.36: Packet Transmission in AODV Protocol Based Network Results were stored in trace file, through GNUPLOT we took graphs of these results. DSR Setting DSR based network for 50 nodes as shown in figure 5.37.

32 Implementation of Routing Protocols on Network Simulators 32 Figure 5.37: DSR Based Ad Hoc Network with 50 Nodes After that we run simulation for 200 sec as shown in figure Figure 5.38 Packet Transmission in DSR Based Network in NS3 Results were stored in trace file, through GNUPLOT we took graphs of these results Implementation Plan for Hybrid Protocols WARP Setting WARP based network for 50 nodes as shown in figure 5.39

33 Implementation of Routing Protocols on Network Simulators 33 Figure 5.39: Hybrid WARP Based Network with 50 Nodes in NS3 After that we run simulation for 200 sec as shown in figure 5.40 Figure 5.40: Packet Transmission in WARP Based Network in NS3 Results were stored in trace file, through GNUPLOT we took graphs of these results. ZRP Setting ZRP protocol based network for 50 nodes as shown in figure 5.41.

34 Implementation of Routing Protocols on Network Simulators 34 Figure 5.41: ZRP Based Ad Hoc Network with 50 Nodes in NS3 After that we run simulation for 200 sec as shown in Figure 5.42 & Figure Figure 5.42: Packet Transmissions in Interzone Network in ZRP

35 Implementation of Routing Protocols on Network Simulators 35 Figure 5.43: Packet Transmission in Intrazone Network in ZRP Results were stored in trace file, through GNUPLOT we took graphs of these results Results Obtained with NS3 Experiment run for 200 seconds and results were stored in the trace file. Through GNUPLOT we plotted graphs. For that we wrote following command on the terminal as follows: C->Gnuplot- press Enter C-gnuplot> set terminal png size 640, 480 C-gnuplot> set output filedata.png C-gnuplot> plot filedata.dat using 1: 2 title Packet Delivery Ratio Vs No. of Nodes with linespoints C-gnuplot> exit After this we get a file with extension.png. Open that file and get the graphs as shown in figure 5.44, 5.45, 5.46, 5.47 & 5.48.

36 Implementation of Routing Protocols on Network Simulators 36 Figure 5.44: PDR Vs Number of Nodes in NS3

37 Implementation of Routing Protocols on Network Simulators 37 Figure 5.45: Path Optimality Vs Number of Nodes in NS3 Figure 5.46: Routing Overhead Vs Number of Nodes in NS3

38 Implementation of Routing Protocols on Network Simulators 38 Figure 5.47: Throughput vs Numbers of Nodes in NS3 Figure 5.48: Average End_To_End Delay Vs Numbers of Nodes in NS3

39 Implementation of Routing Protocols on Network Simulators Contribution of the Chapter In this chapter, the implementation of MANET is performed on network simulator OMNET++ and NS3. It presented the common simulation environment setup on both simulators and evaluated the implementation of different MANET routing protocols on open source network simulator. In order to examine the efficiency and performance of routing protocol on OMNET++ and NS3 with network parameters like average end-to-end delay, packet delivery ratio, path optimality, routing overhead and throughput. The details of the experiments conducted under the research work being presented in this thesis and the results obtained are the subject matter of the next chapter.