13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Evaluation of the AODV and DSR Rout<strong>in</strong>g Protocols 292.3 Earlier Comparisons of DSR and AODVSeveral attempts have been made to compare DSR and AODV with respect topath optimality among other measures. Broch et al. [2] use an <strong>in</strong>ternal mechanismof ns-2 to measure the path optimality for the rout<strong>in</strong>g protocols. Essentiallyan omniscient observer of the simulation stores the total number of mobilenodes and a table of shortest number of hops required to reach from one node toanother at a particular <strong>in</strong>stant of time. This <strong>in</strong>formation is used to compute thedifference between the length of the actual path used between the source anddest<strong>in</strong>ation at a particular <strong>in</strong>stant of time <strong>in</strong> the <strong>in</strong>stantaneous snapshot of thenetwork graph. The approach <strong>in</strong> MERIT is different from [2] <strong>in</strong> that it considersthe entire history of the network topology for the duration of the data flow andthe cost of updat<strong>in</strong>g the routes to the dest<strong>in</strong>ation.The studies <strong>in</strong> [2] show that DSR uses routes that are very close to optimalwhereas AODV f<strong>in</strong>ds a greater number of routes which are further apart fromthe optimal <strong>in</strong> the <strong>in</strong>stantaneous topology.In [5], the authors compare the protocols DSR and AODV us<strong>in</strong>g several quantitativemetrics. The general conclusion is that for application oriented metricssuch as delay and throughput, DSR outperforms AODV <strong>in</strong> less stressful conditions,i.e., for a smaller number of nodes and/or lower mobility.3 The MERIT ToolFigure 1 shows a high level block diagram of the MERIT tool. The tool takes, as<strong>in</strong>put, a mobile graph as well as actual route traces for the rout<strong>in</strong>g protocol underconsideration. Once there is sufficient confidence <strong>in</strong> the ratio for one parameter,runs for other parameters may beg<strong>in</strong>. From a sequence of MERIT ratios for agiven parameter, a spectrum is generated.manetRout<strong>in</strong>gProtocolMobile GraphActual PathsMERITToolMERITRatio/SpectrumMERITSpectrumVisualizationFig. 1. The MERIT tool.3.1 Simulation EnvironmentWe generate the <strong>in</strong>put for the MERIT tool us<strong>in</strong>g an extended version of ns-2[14] because it has the ability to simulate MANETs [3] and provides a referenceimplementation of the DSR and AODV rout<strong>in</strong>g protocols.We create mobility scenarios as <strong>in</strong> [2], which <strong>in</strong>clude 20 nodes <strong>in</strong> a 1500 ×300 m 2 area <strong>in</strong> order to force the use of longer routes. In our scenarios, everynode has an omni-directional transmission radius of 250 m and moves us<strong>in</strong>g the

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!