Computer Science Technical Report Archive

USC Computer Science Technical Reports, no. 730 (2000)

(USC DC Other)

USC Computer Science Technical Reports, no. 730 (2000)

PDF

Download a page range

Download transcript

Copy asset link

Request this asset

Transcript (if available)

Content Æ ! "#$% $ Æ & ’ # & ’ # ( )* + *$, " $,-$$ ( )* + *$, ! *$, - *$,% . ! "# Æ $ %! & ! ’ ( ) ! " ! * ! +, - . / $ +./ 0 ! ! ! ! 1 ! % & " ! ! ! * ! ! 1! ! ! ! %! ! & " ! 2 ! 0 ! 3 ! " ! ! Æ 2 * ! 4 5 2 6 2 %2*4522 +/& * 2*4522 + 7 8 / ! 91: %! # " ) %#")& 2 4 ) %24)& & ; 2*4522 ! %1 ; > +? /& ! 2*4522 24 1 ; > 2 4! # %24& +@/ * ! +, - / 24 1 ; > 2 2*4522 ! ! 24 ! ; 24 5! 24 %524& ,A $ 524 3 8A ! * 2*4522 Æ * !6 " 2 3 ! % 2*4522 !& ! ! ! 2*4522 ! 2*4522 " 2 8 24 " 2 7 2*4522 2 2 78 2 , 7 1 B ! ! % ! !& ! * ! ! Æ 1 ! 6 ! * ! Æ ! " ! 6 ! ! ! " ! ! ! ! ; ! * 1 * * ! ! !0 5 ! ! * ! ! % & * * ! ! ! , " ! 24 1 ; > ; ! ! ! )1 CD14#D4! < )1 C 4 *2DC*2 ! )1 C : ! 4 *2DC*2 24 4 *2DC*2 D 4 *2DC*2 ! ! ! * ! ! ! $ ! " ! ! ! " ! ! % & E %" ! ! ! D # ! & * ! ! ! %2 ! ! ! + 8 /& * ! Æ * F Æ * B ! Æ % Æ& . * ! Æ * 0 ! G Æ ! * ! Æ % & * ! 0 " !0 %& # %& < 0 ! ) ! ! - 0 5 10 15 20 25 30 35 39 40-49 50-59 60-69 70-79 80-99 100-149 150-199 200-249 250-299 300-400 Number of occurence Number of host Packets required to cause network bisection random scenarios with fixed destination and sources being random selected Random scenarios with both source and destination being randomly selected STRESS scenario ! 30 : 0 1 2 3 4 5 0.82 ~ 0.9 0.9 ~ 1.0 1.0 ~ 1.1 1.1 ~ 1.2 Number of occurence Consumed Energy random scenarios with fixed destination and sources being random selected Random scenarios with both source and destination being randomly selected STRESS scenario ! 80 * ! , , ! ! 3 % ! 3 ! - & 2*4522 8? ! 3HA H.?A 1 ! 8 2*4522 8?HA ! :0 2*4522 ! 6 ! $ 2*4522 ! 2*4522 ! ! random scenario STRESS generated worst case scenario 1 2 3 4 5 Row-ID 1 2 3 4 5 Column-ID 0 0.005 0.01 0.015 0.02 0.025 0.03 0.035 0.04 0.045 0.05 Remained Energy(J): (Initial Energy: 0.05 J) ! 70 5! 0 200 400 600 800 1000 1200 1400 1600 1800 2000 random-1 random-2 random-3 random-4 5x5 grid 6x6 grid 7x7 grid 8x8 grid 9x9 grid 10x10 grid Number of host packets required to cause network partition Scenarios Fig4: Number of packets required to cause network bisection STRESS scenario Random scenario 68% confidence interval of random scenarios minimum of random scenarios maximum of random scenarios ! ,0 ) 2*4522 ! ! 7 ! 1 ! 7 2*4522 ! 1 ! $ ! ! ! ; ! ! * ! " # $ % * ! ! ! ! ! , ! . - ! * ! ! ,- ,-- ,-- ! * ! 3,- %* +, - . /& * ! . ! 3 .. @@ HH ?? -- * ! 6 ! * 2*4522 ! 5 ! - - ! Æ ! % ! C<4 Æ ! ! Æ ! 3& 0 5 10 15 20 25 random-1 random-2 random-3 random-4 5x5 grid 6x6 grid 7x7 grid 8x8 grid 9x9 grid 10x10 grid Total energy consumed from the network Scenarios Fig5: STRESS worst case scenrio vs. random scenarios: consumed energy STRESS scenario Random scenario 68% confidence interval of random scenarios minimum of random scenarios maximum of random scenarios ! .0 9 ! 2*4522 0 10 20 30 40 50 60 70 80 90 50 nodes 50 nodes 50 nodes 50 nodes 5x5 grid 6x6 grid 7x7 grid 8x8 grid 9x9 grid 10x10 grid Normalized control packets per delivered host packet scenarios DSR AODV ! @0 # 0 :6 2*4522 24 1 ; > ! , ! . ! 2*4522 3HA ??A Æ ! 1 2*4522 ?.A ! ! 1 2*4522 ! " ! = %" ! ! & * 2*4522 ! 8 & ’ 3HA ??A Æ 2*4522 ! ! ! ! ! * 2*4522 ! 3 M ?.A ! 2*4522 ! ! ! 8 * 2*4522 1 2 83 ! ! ! ! 8. ! ! ! $ ! ! 8. " ! , 37 7, 2*4522 ! %! ! !& * ! ! ! * ! ! ! ! 1 ; > 240 %& 24 1 ; > %3& 24 5! 24 7 ( * 2*4522 1 ; > 24 % * & * ! 2*4522 ! 2 3 ! 6! * ! 1 ; > Æ 24 %8. 8?& 24 ! )1 C * 1 ; > ! * 0 2 2*4522 ,, ! 24 1 ; > 2*4522 2*4522 24 1 ; > * 8? 8. * ! %I& -H3-.-, -.?H.,7 :6 ! %I& --3877. --3837@ :6 ! 3?., 37 1 ; > ! ! ! * ! @ ! , % 8,& 1 ! @ 1 ; > 6 24 2*4522 0 3 7 * ! ! $ 24 1 ; >+, - . / 1 ; > * 24 !! 6 ! !! * , " Æ $ ! ! ! ! # " 2*4522 ! 24 ! " #$ * ! ! Æ +H/ ! +3 / ! ! ! * ! ! Æ ! ! ! 2*4522 ! ! ! ! " 2*4522 ! ! ! 24 ! * ! ! ! " ! 5! 24 %524& # " #$ %"#$& #$"## 1! 3 * 24 3 ! ! * ! 24 524 . 2*4522 * 3 1 * 3 524 ! 2*4522 ,A % 8, 7-& " ! 6 ! * 30 2 2*4522 ! 24 524 ,, ! 24 1 ; > 2*4522 2*4522 ! 24 524 : 8, 7- :6 ! --3877 --3,HH :6 3?., 883, # "#$ 7 38 2 !0 $ 524 * ,-- ,-- ,- Æ * 8 , D * ! ,- -- ,- 3-- * C<4Æ - , 3- * ,-A * ,-A !! ! ! ! * ’ ( * 9 91: 3,- ! 7383 2 @ * ?. ! 6 * 8 * ?. . . Æ * 80 ;! 24 5! 24 ;! 24 524 : ,?,? .-.@@ " 524 ! 24 3@HA :6 ! --8@8 --8., :6 387..? 33,,?7 1 * 8 ! 524 3 8A 1 * 8 524 ! %3,A & ! ! ! %8H.A & * ! 0 " ! Æ * ! ! * !! ! ! 7388 " 524 2*4522 * 2*4522 5! 24 ,A Æ $ 5! 24 3A 8A ! * 524 2*4522 ! ! # $ * 2*4522 ! Æ ! * ! 6! H $ !! ! ! ; ! ! 1 %! & ; ! $ 6 " ! ! !! * Æ !! ! = ! Æ 2*4522 %! & ) ! ! ! < ! ! ! ! * ! Æ M! 2) ! % Æ ! & < 2*4522 2! Æ 2*4522 ? ! 2*4522 * ! ! ! ! 1 ; > 24 2 2*4522 ! ! 24 524 %! 24& ! ! 2 524 ! % ,A & 2*4522 $ ! ! % ! 3A 8A & " 2*4522 ! * ! 1 $ 9 N C : 2 9 M2C +/ 1 $ G 5 2 O= ! 0 1 ! I ??H +3/ P P > %5& ??? ! 0DDL C2< 5MDD 3- +8/ CG I N G 2$ * ! # ! ! 0DD DD! D?.-Q +7/ 1 $ G 5G 2 N ! ! ! " # $ % & ’ & ! ( )*%’ !% : ??H +,/ I < G 1 )6G < IG RC $G IB I 1 ! ! *))) + ,-./ 0123 " 4 ; ??H +./ # I * 9 : $ <6 )6 4! 5 *))) + ,-. 0122 1! ??? +@/ < I 1 )6 " ( 6 7 ,-.8 + + 9 . 6. : 5 P 1 # ??. +H/ ) G 2 2!G C 2 4! # ! ; 123 +?/ C # G 56 4 1 ! < ))) 7. + ! ?-L-- ??? +-/ 2 G C # G 56 4 * ! 0DD!D D- ,! 1<=== ) 3--- +/ 9 * B 1 ! % - > % ! 8.0@@LH? 1 ?@? 3 +3/ I$ C!G 9 * 5! ! ! ,! 1<=== ) 3--- +8/ 1 $ G 2 NG 5G 1 CG R R # ! 0 1 ? ( ==@<@ 3--- +7/ 2 < B BG 9 <G 5G P G 2 G # $G ) $G 1 $ G I $G # $!G 2 PG 2 )CG 46 4BG # 2G P > G R SG $ R G Q " ! ( 22@=< ?A ) ??? 33

Linked assets

Computer Science Technical Report Archive

Conceptually similar

PDF

USC Computer Science Technical Reports, no. 726 (2000)

PDF

USC Computer Science Technical Reports, no. 690 (1998)

PDF

USC Computer Science Technical Reports, no. 727 (2000)

PDF

USC Computer Science Technical Reports, no. 860 (2005)

PDF

USC Computer Science Technical Reports, no. 673 (1998)

PDF

USC Computer Science Technical Reports, no. 809 (2003)

PDF

USC Computer Science Technical Reports, no. 696 (1999)

PDF

USC Computer Science Technical Reports, no. 674 (1998)

PDF

USC Computer Science Technical Reports, no. 816 (2004)

PDF

USC Computer Science Technical Reports, no. 657 (1997)

PDF

USC Computer Science Technical Reports, no. 775 (2002)

PDF

USC Computer Science Technical Reports, no. 731 (2000)

PDF

USC Computer Science Technical Reports, no. 672 (1998)

PDF

USC Computer Science Technical Reports, no. 698 (1999)

PDF

USC Computer Science Technical Reports, no. 704 (1999)

PDF

USC Computer Science Technical Reports, no. 613 (1995)

PDF

USC Computer Science Technical Reports, no. 603 (1995)

PDF

USC Computer Science Technical Reports, no. 755 (2002)

PDF

USC Computer Science Technical Reports, no. 631 (1996)

PDF

USC Computer Science Technical Reports, no. 745 (2001)

Description

Yan Yu, Deborah Estrin, Sandeep Gupta. "Worst case performance analysis of wireless ad-hoc routing protocols: Case studies." Computer Science Technical Reports (Los Angeles, California, USA: University of Southern California. Department of Computer Science) no. 730 (2000).

Asset Metadata

Creator Estrin, Deborah (author), Gupta, Sandeep (author), Yu, Yan (author)

Core Title USC Computer Science Technical Reports, no. 730 (2000)

Alternative Title Worst case performance analysis of wireless ad-hoc routing protocols: Case studies (title)

Publisher Department of Computer Science,USC Viterbi School of Engineering, University of Southern California, 3650 McClintock Avenue, Los Angeles, California, 90089, USA (publisher)

Tag OAI-PMH Harvest

Format 22 pages (extent), technical reports (aat)

Language English

Unique identifier UC16270855

Identifier 00-730 Worst Case Performance Analysis of Wireless Ad-hoc Routing Protocols Case Studies (filename)

Legacy Identifier usc-cstr-00-730

Format 22 pages (extent),technical reports (aat)

Rights Department of Computer Science (University of Southern California) and the author(s).

Internet Media Type application/pdf

Source 20180426-rozan-cstechreports-shoaf (batch), Computer Science Technical Report Archive (collection), University of Southern California. Department of Computer Science. Technical Reports (series)

Access Conditions The author(s) retain rights to their work according to U.S. copyright law. Electronic access is being provided by the USC Libraries, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright.

Repository Name USC Viterbi School of Engineering Department of Computer Science

Repository Location Department of Computer Science. USC Viterbi School of Engineering. Los Angeles\, CA\, 90089

Repository Email csdept@usc.edu

Inherited Values

Title Computer Science Technical Report Archive

Description Archive of computer science technical reports published by the USC Department of Computer Science from 1991 - 2017.

Coverage Temporal 1991/2017

Repository Email csdept@usc.edu

Repository Name USC Viterbi School of Engineering Department of Computer Science

Repository Location Department of Computer Science. USC Viterbi School of Engineering. Los Angeles\, CA\, 90089

Publisher Department of Computer Science,USC Viterbi School of Engineering, University of Southern California, 3650 McClintock Avenue, Los Angeles, California, 90089, USA (publisher)