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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Evaluation of the AODV and DSR Rout<strong>in</strong>g Protocols 27The weight of a path P i <strong>in</strong> G i is denoted <strong>by</strong> w i (P i ). For additive path metrics,it is the sum of the l<strong>in</strong>k weights along the edges of the path. The weight of amobile path <strong>in</strong>cludes the <strong>in</strong>dividual weights of each path <strong>in</strong> the sequence, and atransition cost c trans that represents the overhead <strong>in</strong>curred <strong>by</strong> the protocol torespond to a topology change. Thus, the weight of a mobile path P <strong>in</strong> G, denoted<strong>by</strong> w(P), is def<strong>in</strong>ed asw(P) =T∑i=1T∑−1w i (P i )+ c trans (P i ,P i+1 ). (2)Given these def<strong>in</strong>itions and assum<strong>in</strong>g a given cost model, the shortest mobilepath (SMP) problem is def<strong>in</strong>ed with<strong>in</strong> the framework as follows.Problem 1. Given a mobile graph G = G 1 ...G T and a specified source-dest<strong>in</strong>ationpair (s, t), f<strong>in</strong>d a mobile path P = P 1 ...P T from s to t, such that theweightT∑T∑−1w(P) = w i (P i )+ c trans (P i ,P i+1 )i=1of the mobile path is m<strong>in</strong>imum.In [6], a simple 2-valued transition cost function was considered <strong>in</strong>itiallybecause the SMP problem is tractable <strong>in</strong> this case.i=1i=1MERIT Assessment Measures. Two assessment measures are proposedwith<strong>in</strong> the MERIT framework: the MERIT ratio and the MERIT spectrum.For a given mobile graph G and s-t pair, let P real be the actual mobilepath generated <strong>by</strong> the MANET rout<strong>in</strong>g protocol R. The weight w(P real ) of thismobile path is computed directly from the rout<strong>in</strong>g state trace for the s-t path <strong>in</strong>each G i . The paths generated <strong>in</strong> turn directly fix the transition costs. Similarly,let P ideal be the shortest mobile path for G. Both the path P ideal and its weightw(P ideal ) are computed <strong>by</strong> the Shortest Mobile Path algorithm [6] run onthis <strong>in</strong>stance G of the mobile graph for ) source-dest<strong>in</strong>ation pair s-t.The MERIT ratio = Eis the expected value of the cost ratio of(w(Preal )w(P ideal )the actual mobile path to the shortest mobile path. The ratio represents howfar the routes <strong>in</strong> protocol R deviate <strong>in</strong> cost from the theoretical optimum. Wecompute the mean of the ratio of a large enough sample size of randomly drawns-t sessions <strong>in</strong> order to obta<strong>in</strong> a 95% confidence <strong>in</strong>terval. The distribution of thesample is implicit from the simulation parameters.The value of the MERIT ratio becomes mean<strong>in</strong>gful when we understand howit changes as a function of a some parameter. The MERIT ratio expressed asthe function of some <strong>in</strong>dependent parameter def<strong>in</strong>es the MERIT spectrum ofthe protocol R. Some examples of such parameters <strong>in</strong>clude the node velocity,the average actual path length, the average node density, transmit power levelsand the related energy consumption, and even the transition cost.

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

Saved successfully!

Ooh no, something went wrong!