- : : 1385 . . . . . . . . TGRID . . . TGRID Glomosim TGRID . : TGRID

AODV Ad-hoc On-demand Distance Vector DLM Distributed Location ManagementDR Distance Routing DREAM Distance Routing Effect Algorithm for Mobility DSDV Destination-Sequenced Distance Vector routing DSR Dynamic Source RoutingETS Eliminate Then Select GHLS Geographic Hashing Location Service GLS Grid Location Service GPS Global Positioning System GPSR Gridy Perimeter Stateless Routing Protocol GRSS Geographic Region Summary Service HGRID Hierarchical Grid Location Management protocolLAR Location-Aided RoutingLOTAR LOcation Trace Aided Routing LP Local Services locations LSP Location Server Points MANET Mobile ad-hoc network MFR Most Forward Within NFP Nearest With Forward Progress OLSR Optimized Link State Routing protocol RLS Reactive Location Service SLALoM A scalable location management scheme for large mobile ad-hoc networks SLS Simple Location Service SLURP Scalable Update Based Routing ProtocolSTE Select Then Eliminate TBRPF Topology Broadcast based on Reverse-Path Forwarding routing protocol TORA Temporally-ordered routing algorithmUQS Uniform Quorum SystemZRP Zone Routing Protocol 1 . ................................ ................................ ................................ ................. 11 - 1 ................................ ................................ ........... 22 . ................................ ........................ 92 - 1 : ................................ ................................ ................................ .... 102 - 2 ................................ ................................ . 122 - 3 ................................ ................................ ...................... 132 - 4 ................................ ............................. 142 - 5 ................................ ................................ .......... 152 - 6 ................................ ................................ ................................ ... 213 . ................................ ............................. 223 - 1 ................................ ................................ ................................ ..... 233 - 2 ................................ ............................ 263 - 2 - 1 ................................ ................................ . 263 - 2 - 2 ................................ ................................ .. 283 - 3 ................................ ................................ .... 393 - 3 - 1 DREAM ................................ ................................ ...... 393 - 3 - 2 (SLS) ................................ ................................ .... 403 - 3 - 3 Ants ................................ ................................ .............................. 413 - 3 - 4 (GRSS) ................................ ............................ 413 - 3 - 5 : DR ................................ ................................ .... 423 - 4 ................................ ................................ ............... 443 - 4 - 1 (RLS) ................................ ................................ . 443 - 4 - 2 (RLS) ................................ ................................ . 453 - 4 - 3 (LOTAR) ................................ ............. 453 - 5 ................................ .................... 453 - 5 - 1 GLS ................................ ................................ .............................. 453 - 5 - 2 SLURP ................................ ................................ .......................... 463 - 5 - 3 SLALoM ................................ ................................ ........................ 473 - 5 - 4 DLM ................................ ................................ ............................ 483 - 5 - 5 HIGH-GRADE ................................ ................................ ................ 483 - 5 - 6 HGRID ................................ ................................ .................. 503 - 6 ................................ ................................ ................................ ... 544 . ................................ ................................ ......... 554 - 1 ................................ ................................ ................................ ..... 564 - 2 TGRID ................................ .............. 574 - 3 ................................ ................................ ......................... 574 - 4 ................................ ................................ ................................ 594 - 5 TGRID ................................ ................................ ................ 614 - 5 - 1 ................................ ............................. 624 - 5 - 2 ................................ ................................ ........................... 624 - 5 - 3 ................................ ................................ ......................... 634 - 5 - 4 ................................ ................................ ........... 654 - 6 ................................ ................................ ................................ ... 685 . ................................ ................................ .................. 695 - 1 ................................ ................................ ................................ ..... 705 - 2 ................................ ................................ ................ 705 - 3 ................................ ................................ ............ 725 - 4 ................................ ................................ ...................... 775 - 5 ................................ ................................ ................................ ... 816 . ................................ ................................ ................... 826 - 1 ................................ ................................ ............................... 83 ................................ ................................ ................................ ............... 87

2 - 1 ( ................................ ......... 13 2 - 2 ( ................................ ................................ .................... 14 2 - 3 ( ................................ ........................... 16 2 - 4 ( ................................ ................................ .... 17 2 - 5 ( ................................ ................................ ......... 18 2 - 6 ( ................................ ................................ ..... 19 3 - 1 ( ................................ ................. 28 3 - 2 ( - ................................ ................ 31 3 - 3 ( Hello ................................ ................................ .... 33 3 - 4 ( ................................ ................................ ............. 34 3 - 5 ( GLS ................................ ................................ ............ 35 3 - 6 ( ................................ ... 38 3 - 7 ( ................................ ................................ .................. 40 3 - 8 ( DRM ................................ ................................ .... 43 3 - 9 ( - ................................ ............................. 46 3 - 10 ( ................................ ................................ . 47 3 - 11 ( ................................ ................................ ... 47 3 - 12 ( HIGH-GRADE ..................... 49 3 - 13 ( HGRID ................................ ............................ 51 3 - 14 ( HGRID ................................ ..................... 52 3 - 15 ( HGRID ................................ ........... 53 4 - 1 ( TGRID ................................ ........................... 58 4 - 2( TGRID ................................ .............. 59 4 - 3 ( TGRID ................................ ............ 60 4 - 4( TGRID ................................ ................. 61 4 - 5 ( ................................ .............. 66 5 - 1 ( ) ( ......................... 73 5 - 2 ( ) ( ................................ .... 73 5 - 3 ( ) ( ................................ .......... 74 5 - 4 ( ) ( ............................ 74 5 - 5 ( ) / / ) ( ( ............... 75 5 - 6 ( ) / / ) ( ( ............. 75 5 - 7 ( ) / ) ( ( ............ 76 5 - 8 ( ) ) ( ( ........... 76 5 - 9 ( ) / / )( ( ................ 77 5 - 10 ( ) / / ) ( ( ............ 78 5 - 11 ( ) / ) ( ( ......... 79 5 - 12 ( ) / ) ( ( ........ 79 5 - 13 ( ) ) ( ( ..................... 80 5 - 14 ( ) ( ................................ . 80 5 - 15 ( ) ( ................................ ........... 81

3 - 1 ( ................................ ................................ ..................... 64 4 - 1 ( ................................ ................................ 71 6 - 1 ( ................... 85 1 1 :

1 .

1 2

1 - 1 . . MANET 1 ] 1 [ . . Bluetooth IEEE802.11 . MANET ] 3 [ . . ] 1 [ . . . . ) ( ] 1 [ . . : 2 : . : . ] 4 [ . 1 Mobile Ad-Hoc Network 2 Topology-Based 1 3 : 1 : . 2 : . 3 : . . . . MANET . . ] 6 [ . . . . DSR AODV . . ] 5 [ . . ) GPS ( : ) ( 1 Proactive 2 Reactive 3 Hybrid 1 4 " " . " " . . . : GPS(USA) GLONASS(Russia) GLO(Europe) . . 1 ] 6 [ . . . 2 . . . : . . . : . . 1 Self Positioning Algorithm 2 Forward 1 5 ] 7 [ . . . . ] 7 [ . 4 : " 1" " 2" " 3" " 4" . DREAM 5 . . ] 6 [ . : ) A ( A ) ( B A A . . . ] 8 [ . 1 All-for-All 2 All-for-Some 3 Some-for-All 4 Some-for-Some 5 Flooding 1 6 :1 - . .2 - .3 - . .4 - . . ] 23 [ . . . . ] 12 [ . : GLS ] 15 [ SLALoM ] 21 [ HGRID ] 24 [ HIGH-GRADE ] 20 [ . . SLALoM ) ( ] 21 [ GLS] 15 [ HGRID ] 24 [ . ) ( . / 1 7 . . . . . . . .. . HGRID . HGRID 2 r / )L0 ( r . HGRID ] 18 [ . . TGRID . TGRID . . . Glomosim ]25 [ . . 1 8 ] 19 [ . TGRID . . . . . TGRID . TGRID . 2 9 2 . 2 10 2 - 1 : 1 2 3 . 4 . . . rooftop ] 1 [ . . . . . : 5 6. . 7 8 . 9 ) DSDV ] 2 [ ( - 10)OLSR ] 3 [ TBRPF ] 2 [ ( . 1 Hand-Held Devices 2 Ad Hoc 3 Pre-Established 4 Autonomous 5 Topology-Based Routing 6 Position-Based Routing 7 Proactive 8 Reactive 9 Distance Vector 10 Link-State 2 11 ) ( . ) ( ] 5 [ . ) DSR ] 4 [ TORA ] 6 [ AODV ] 5 .([ . : . . ZRP ] 6 [ . . . . . GPS ] 1 3 .[ ] 3 [ . . . . . 2 12 . Geocasting ] 2 [ . .2 - 2 . . . . . :1 2 3 4] 7 .[ . 5. . . 6 . : 7 8 9 . ) ( ) ( . . 1 Some for Some 2 Some for All 3 All for Some 4 All for All 5 Header 6 Beacons 7 Greedy Forwarding 8 Restricted Directional Flooding 9 Hierarchical Approaches 2 13 . 1 ] 2 [ . . 2 . 2 - 1 ( ] 1 [

2 - 3 . . . ) ( . " " . ] 7 [ . 3 . : . 1 Recovery 2 Non-Position Based Approaches 3 Non Ad-Hoc 2 14 . 1 .2 - 4 2

DREAM " " . . ] 7 [ . : ) 3( ) 4( ) .( . . 5 ] 7 [ . 2 - 2 . 2 - 2 ( ] 7 [ 1 Dynamic 2 Distance Routing Effect Algorithm for Mobility 3 Temporal Resolution 4 Spatial Resolution 5 Distance Effect 2 15 A B C . A B C . .2 - 5 1 . . . . . 2 - 3 S D . r S . r D . C . MFR2] 3 [ . D .MFR . ] 1 [ MFR . NFP3 . 2 - 3 A . NFP . f(a,b) f(a,b) a b NFP MFR . 1 Forwarding 2 Most Forward Within r 3 Nearest With Forward Progress 2 16 2 - 3 ( ] 3 [ 1 ] 1 [ . B . . ] 1 [ . . . 2 - 4 . D S D S S . S D . S D . 2 . ] 3 [ . Face-2 ] 23 [ (GPSR) 3] 23 [ 4. 1 Directional Routing 2 Local Maxinmum 3 Gridy Perimeter Stateless Routing Protocol(GPSR) 4 Planar 2 17 . . . 2 - 4 ( ] 1 [ . . ) 2 - 5 ( . ] 1 [ : A B . 2 - 5 A C B D . . . 1 . 2 - 6 ] 1 [ 1 Face 2 18 S D 1 . : . . . . . 2 - 5 ( ] 1 [ . . . 1 Recovery 2 19 . . 2 - 6 ( ] 1 [ . . . a a a . : . . 2 20 . ] 7 [ . . GLS1 2 3 . . " " . ] 7 [ . : . . . . Terminodes Grid . . 3 . . . . 1 Grid Location Service 2 Home Zone 3 Hash Function 2 21 2 - 6 . . . . . . . .

3 22 3 . 3 23 3 - 1 . : 1 2. . ] 7 [ . : 34. . . . . . :1 - .2 - .3 - . 1. Proactive 2. Reactive 3. Location Database Systems 4. Location Dissemination Systems 3 24 4 - . :1 - ) ( .2 - ) ( . " "1 . " " . Mauve ] 7 [ . : : . . . . . . : . . : . . 1. Some For All 3 25 : . 1 2 3. Treewalk . Treewalk ] 7 [ . . . . . . - . . . : : . 4 ] 10 [ . : . ] 10 [ . : ] 10 [ . 1 Flooding 2 Unicast 3 Geocasting 4 3 26 .3 - 2 : 1 2. 4 3 . Mauve " " . ] 7 [ .3 - 2 - 1 Mobile IP . . . R . . . ] 7 [ . f . . . . 1. Home Region location Service 2. Quorum Based Location Service 3. Protocol 3 27 . 1. " "2 "3 " "4 . " " . " " . " " . ] 7 [ . 3 - 1 . R4 D D R3 R6 A B C . . . . . " "5 . . 6 1 Threshold2. Time Based 3. Distance Based 4. Predictive Distance Based 5. Flooding With Self Pruning 6 Cache 3 28 . . ) R2 ) 3 - 1 ( . 8 . 3 - 1 R6 R4 R4 R3 R1 R2 ] 7 [ . 3 - 1 ( ] 7 [

" 1" . . .3 - 2 - 2 . ) ( . 1. Hierarchical State Routing 3 29 . . . ] 11 [ . : i i j . 1 n n . . .3 - 2 - 2 - 1 (UQS) . . . . ] 9 [ . . : . Liang Haas :1 . : .2 . : . 3 3 0 3 . : .Liang Haas . . . Mauve " " " " " " ] 8 [ . " " ] 8 [ .3 - 2 - 2 - 2 - - . . . . . . . ] 17 [ . q . . . .

3 3 1 3 - 2 ( - ] 7 [ - 3 - 2 . N A . A S x-y - z N . A FACE .3 - 2 - 2 - 3 GLS . GLS . ) ( . . GLS . GLS 1 ] 14 [ . 1 Geographic-Based 3 3 2 . GLS . GLS . GLS . GLS . ] 15 [ . GLS 100 - 600 . . 1 . GLS ) 100 .( GLS . GLS ) ( ) ( .3 - 2 - 2 - 3 - 1 2GPS Hello . 3 - 3 Hello . 3 . Hello . Hello . 1 Throughput 2 Geographic Forwarding 3 Distance Vector 3 3 3 ID . ] 23 [ . 3 - 3 ( Hello ] 23 [ . . GPSR . GLS ] 14 [ .3 - 2 - 2 - 3 - 2 GLS . GLS : . . 1 . 4 1 2 4 2 3 . 3 - 4 ) ] 12 [ ( 5 1 3 2 3 4 . n 12 na 12 nb a , b . 3 - 4 ) 5 , 1 (. 2 2 2 a , b ) 5 , 1 ( ) 2 , 2 ( b a. 3 3 4 3 - 4 ( ] 14 [3 - 2 - 2 - 3 - 3 ID 1 . ID ID . 3 - 5 B . B ID 17 ID ID . B ID B . ID ID B . B . ID 17 . ID 2 ID 17 . B . 3 - 5 B 1 )2 23 63 ( 1 2 . B 2 )26 31 43 ( 2 3 . ID ID B ] 14 [ .3 - 2 - 2 - 3 - 4 . 1 1 Hash 3 3 5 2 . ID ID 2 . . . 3 - 5 ( GLS ] 15 [ 3 - 5 A B . A )ID76 ( ID21 A 21 ID B )ID17 ( 2 . ID 17 21 2 A . 21 ID 20 . 20 B B B . A B A ] 12 [ . ID 20 3 A B .

3 3 6 3 - 2 - 2 - 3 - 5 . . ID . 1 . 1 GLS 1 . . 2 . 2 d 3 2d . . . . GLS . Timeout ] 7 [ .3 - 2 - 2 - 3 - 6 . . 1 Cache 2 Threshold 3 3 7 . 1 2 . . . . 1 Hello . Hello Hello . . ] 15 [ .3 - 2 - 2 - 4 GLS . . i r i r+1 . A A r+1 ] 12 [ . 1 Forwarding Pointer 2 Departed 3 3 8 3 - 6 ( ] 7 [ . . . B A . C ] 7 [ .3 - 2 - 2 - 5 . . . . 3 :1 - 2 - 3 - . 3 3 9 " " . . ] 11 [ . . . . " "1 ETS . " "2 STE . ETS . . ETS . STE . STE ] 12 [ .3 - 3 . Mauve " " . .3 - 3 - 1 DREAM DREAM DREAM . (LP) 1. Eliminate Then Select (ETS) 2. Select Then Eliminate (STE) 3 4 0 . . . . 3 - 7 . " " ] 10 [ . DREAM LP LP . DLS LP :)1 ( range rangeTvT ,_

,_

1*

Y . Trange V . DLS LP ] 10 [ . 3 - 7 ( ] 10 [3 - 3 - 2 (SLS)1 . 1 Simple Location Service 3 4 1 . LP ] 17 [ .) 2 (vTrangevTrange ,_

,_

1*

Z . Trange v . Trange LP . LP . SLS LP E . E round-robin . LP . SLS . LP ] 17 [ .3 - 3 - 3 Ants ant GpsAl . ant . . ant ant ant ant ] 7 [ .3 - 3 - 4 (GRSS) GLS . . . 3 4 2 . . i " Summary " ). 4 i i+1 ( ] 13 [ . Summary . i I . . GRSS . . : . ] 13 [ .3 - 3 - 5 : DR DRM . . . (vy,vx) (x2,y2), (x1,x2) t2,t1 ] 10 [ :) 3 (1 21 21 21 2t ty yv andt tx xvy x

. DRM . : 3 4 3 ) 4 (( ) ( )el current x location predictt t V X Xelmodmod + ) 5 (( ) ( )el current y location predictt t V Y Yelmodmod + elyVmod elxVmod (xlocation,ylocation) tmodel DRM tcurrent . . :) 6 (2 2) ( ) (predicted current predicted currenty y X X +

DRM . DRM ] 10 [ . DRM . 3 - 8 . . 3 - 8 ( DRM ] 7 [ 3 4 4 3 - 4 . . Mauve " " . ] 26 [ .3 - 4 - 1 (RLS) . . . . ) ( . RLS . DSR LAR RLS . . RLS DSR LAR . RLS DSR ] 26 [ . 3 4 5 3 - 4 - 2 (RLS) (RLS) . RLS . RLS RLS :_ RLS RLS ._ RLS RLS ._ RLS RLS . ._ RLS . RLS ] 17 [ .3 - 4 - 3 (LOTAR) LOTAR LAR . ] 28 [ .

3 - 5 3 - 5 - 1 GLSGLS . , - H - H 4 - (H-1) - 0 quadtree . - i ) 0 > i ( A - (i-1) A . Gls 3 - 9 . 3 4 6 GLS . C A i A quadtree ] 32 [ .ID(a)} ID(x) , quadtree in the is x| min{ > node x CC quadtree A . . . A B A B A .

3 - 9 ( ]32 [3 - 5 - 2 SLURP SLURP ) ( . A A (x,y) . " "1 A . A . A . B A A A . A A . 3 - 10 ] 31 [ . 1 Home Zone 3 4 7

3 - 10 ( ]31 [3 - 5 - 3 SLALoM SLURP . B A B A . SLALoM . 1 SLURP . 2 2 1 . A 2 . A - 2 ) 3 - 11 .(

3 - 11 ( ]21 [ SLALoM . SLALoM " A " 1 A 2 A 2 . 2 A A A . A ] 21 [ . B A A 2 B . A B A 3 4 8 . - 2 . 2 A .3 - 5 - 4 DLMDLM GLS . H+1 . . - k k 1 H . SLALoM k . DLM ] 29 [ .DLM : . . . k i > A i A i-1 A . K . . B A A . B A . A A i-1 A . A ] 29 [ .3 - 5 - 5 HIGH-GRADEHIGH-GRADE GLS A i ) 0 ( H i 3 - 12 3 H 0 1 2 A . HIGH-GRADE A i . A H+1 HIGH-GRADE H+1 A . " 3 4 9 "1 ) 0 (,H i LSPi A . 3 - 12 LSP A . i ALSP, LSP .

3 - 12 ( HIGH-GRADE ]20 [ HIGH-GRADE . i i-1 A . 0 A . B A LSP i i A BpLSP, , A i B . 0 0 , , A BpLSP . B A - 0 0 , 0 , , A A BLSP pLSP B A 0 , ALSP . 0 , , A BpLSP A 1 , , A BpLSP i A i A BLSP pLSP, , , A . LSP 0 , 2 , 1 ,,...... ,A i A i ALSP LSP LSP A . 3 - 12 A B LSP pLSP . 1 Location Server Points(LSP) 3 5 0 LSP A j A i 1 j i ] 20 [ .3 - 5 - 6 HGRID HGRID 2 r / )L0 ( r L0 ] 18 [ . grid HGRID : i ) 1 1 k i ( ( i-1) i ( i-1) i ( i-1) i ( i-1) i . (L k) grid L ( k-1) ] 18 [ ) . 3 - 13 ( 3 5 1 3 - 13 ( HGRID ] 18 [3 - 5 - 6 - 1 HGRID

u Lo LOC _ UPDATE ) ( 1 )L1 ( ) Lo ( ) ( 1 ) Lo ( ] 18 [ . V LOC_UPDATE . V LOC_UPDATE . LOC_UPDATE V . LOC_UPDATE L( k-1) . 3 - 14 HGRID . D1 1 LOC_UPDATE L1(1,1) L1 Lo L1 ( 3 , 1) L1 . L1 (1 , 1) D1 (DB_DELETE) L1 (3 , 1) D1 (DB_INSERT) . L1 (1 , 1) L1 (1 , 1) L1(3,1) L2(3,3) 1 L2 (3 , 3) ] 24 [ . 3 5 2 3 - 14 ( HGRID ] 18 [3 - 5 - 6 - 2 D grid S D LOC_QUERY D 1 L1 S i D . . 3 - 15 S L1 (1 , 3 ) L2 (3 , 3) L1 (1 , 3 ) D L2 (3 , 3) S .

3 5 3 3 - 15 ( HGRID ] 18 [ S D 1 )L1 ( D S D . D S . V D . V D V D V D D V D . D Lo D ) D .( 3 - 15 L1 (3 , 1) LOC_RESPONSE L2 (3 , 3) L1 (3 , 1) D (2 , 0) (2,0) D ] 24 [ .

3 5 4

3 - 6 . . . . . . . . . GLS . . 4 5 5 : 4 . 4 5 6

4 - 1 . . . . . . TGRID . 4 5 7 . TGRID .4 - 2 TGRID TGRID GRID .TGRID i9 1 i H i 0 H . i ) 1 .( TGRID 4 - 1 . 4 - 3 u loc_ update ) ( . ) ( 1 . C A C i) A ( . . i i-1 1 . 1 . 1 . A B . ) ( . B A 1 Home Region 4 5 8 A A . B . TGRID . 3 . 8 .insert12updatedelete 4 - 1 ( TGRID

TGRID 4 - 3 .

4 5 9

Location updates H : The highest Level; i : The current Level; for each Level i nih = middleSquarePosition[node, i]; i=1; if(CurrentandLastpostionisinthesame level i) insert(nodePos, nih) else { insert(nodepos, nih) do{ insertid(nodeid, nih,nih1 +) i++; } until (nih = middlestZonePosition) } 4 - 2 ( TGRID4 - 4 S D D S D . S D D D D . D D grid D . D D . D . 4 6 0 4 - 3 . A B . . . . . TGRID 2H .QueryQueryAADataResponse 4 - 3 ( TGRID TGRID 4 - 4 . 4 6 1

Location Query A= nodes that sends query; B = queried node; i= level number that both node collocated; q = query packet; r= reply packet; j=1; //find Bs Relative Location while (r[j]B.Relative_Location && j i . Tgrid GLS .GLS . . Tgrid B A h1 . h1 A A B 4 6 2 A . . . Tgrid 2h h .4 - 5 - 1 TGRID . ] 19 [ .4 - 5 - 2 . : :mC / . :qC . :sC . . . . . . . ) / ( . 4 6 3 .4 - 5 - 3 4 - 1 . : A N . . ] , 0 [max . . . . )1(NO . N . . ] 19 [ .TGRID . . GLS . .

4 6 4

4 - 1 ( ] 19 [mC location maintenance costqC location query costCs storage cost node speedz average progress of each forwarding hopi level-i square boundary crossing rateuddistance traveled by an update packetqddistance traveled by a query packetunnumber of forwarding hops of an update packetqnnumber of forwarding hops of a query packet perimeter refreshing rate distance threshold in perimeter refreshuiP prob. querying nodes in level-i square (uniform traffic)liP prob. querying nodes in level-i square (localized traffic)1c constant of random distance within a square2c constant of random distance between squares3c another constant of random distance between squares . H i ,...., 0 , iP B ) ( A ) ( i . uiP liP iP ] 27 [ . i uiP :) 1 (;' 0411431i ifH i ifPhHui

4 6 5 liP i . H i for P Plili 1 ,211 10HliP :) 2 (H i for PHili +0 ,2111.2111 4 - 5 - 4 1 . A . : 1 ) : : ( A :) 3 (R 20 A R - 0 . iP i :) 4 (1 0 ,21.0 H i forii : ] 19 [ 0 R . 4 - 5 cos R . . :) 5 ( Rd R2cos2 20 :) 6 (RR220 . i i-1 ] 19 [ . : 1 Boundary Crossing Rate 4 6 6 ) 7 (1 1211 H i fori i 4 - 5 ( ] 19 [ : ) (mC E ) (qC E ) (sC E Tgrid :) 8 () (log ) () (log) () () log . ( ) (3333N O C Epattern traffic localized for N Opattern traffic uniform for N OC EN v O C Esqm'

: mC - i ) (uid E . :) 9 (R c d Ei ui3 . ) (3

Ri3 i 3C . :) 10 (H vzH vcn E C EHiui i m.3) ( . ) (301

4 6 7

) 11 ()3log . ( )1( ,3log , N v OmC E N H N A ) (2 mC E . 2k k . H+1 :) 12 ()3(log2. ). 1 ( )2( N OkHmC E +

) 13 () log . ( ) ( ) ( ) (32 1N v O C E C E C Em m m + qC . A B i :) 14 (zRczR czR ci jzujd E ijzujd Eqin Eiijj. ) 3 3 (. 3 .21 ) (0) () (32303 + + ) 15 () (. . 398. ). 3 3 (). ( ) (3310320N OzRczRcP n E C EHHii HiHiuiqi q ++

:) 16 () (log. . . 33111.38. ). 3 3 (). ( ) (31101 120N OHzRczRcP n E C EHHiiiHiliqi q ++

4 6 8 :) 17 ()3(log). 1 .() (2N ONkH NC Es+

.

4 - 6 TGRID . . . TGRID . TGRID . TGRID . TGRID . TGRID GLOMOSIM . 5 6 9 : 5 .

5 7 0

5 - 1 TGRID HGRID Glomosim . . TGRID .5 - 2 TGRID Glomosim ] 25 [ . 250 300 . TCP/IP IP . . . . . . . 5 7 1 . . 4 . MFR . . 5 6750 6750 . 2000 2000 320 . 4 - 1 . 5 - 1 ( 300 s300 s 6750X6750 m22250X2250 m2 grid 250 m/s250 m/s 720 - 2280320 350m350m 54 m/s54 m/s MAC IEEE 802.11IEEE 802.11 Random WaypointRandom Waypoint 10 m/s0-25 m/s 1 Packet/Con.2 Packet/s 00 RandomRandom CBRCBR

. 5 7 2 . . 150 . 1000 CBR . . . 50 UDP . 2 . 150 250 .5 - 3 . . HGRID . 5 . 5 - 1 . TGRID HGRID . 5 7 3 00.10.20.30.40.50.60.70.80.910 500 1000 1500 2000 2500 3000 TGRID, Query success ratioHGRID, Query success ratio

5 - 1 ( ) (

5 - 2 . TGRID .01020304050607080901000 500 1000 1500 2000 2500 3000 TGRID, Throughput (packets rcvd )HGRID, Throughput (packets rcvd )

5 - 2 ( ) ( 5 - 3 . TGRID HGRID .

5 7 4 020004000600080001000012000140001600018000200000 500 1000 1500 2000 2500 3000 TGRID, Data overhead HGRID, Data overhead

5 - 3 ( ) (

5 - 4 . TGRID HGRID .

01020304050607080901000 500 1000 1500 2000 2500 3000 TGRID, Avg. Location DB sizeHGRID, Avg. Location DB size

5 - 4 ( ) ( 5 - 5 5 - 6 . 5 7 5 HGRID TGRID . .

00.20.40.60.811.21.41.61.822.22.40 500 1000 1500 2000 2500 3000 TGRID, Control Overhead (packets/node/sec)HGRID, Control Overhead (packets/node/sec) 5 - 5 ( ) / / ( ) (

010203040506070800 500 1000 1500 2000 2500 3000 TGRID, Control Overhead (bytes/node/sec) HGRID, Control Overhead (bytes/node/sec)

5 - 6 ( ) / / ( ) ( 5 7 6 5 - 7 5 - 8 . TGRID HGRID .

020040060080010001200140016000 500 1000 1500 2000 2500 3000 3500 TGRID, Control Overhead (packets/data packet)HGRID, Control Overhead (packets/data packet)

5 - 7 ( ) / ( ) ( 01000020000300004000050000600000 500 1000 1500 2000 2500 3000 3500 TGRID, Control Overhead (bytes/data packet)HGRID, Control Overhead (bytes/data packet)

5 - 8 ( ) ( ) ( 5 7 7 5 - 4 . . . . . 5 - 9 5 - 10 . HGRID TGRID . 00.20.40.60.811.20 5 10 15 20 25 30 TGRID, Control Overhead (packets/node/sec)HGRID, Control Overhead (packets/node/sec)

5 - 9 ( ) / / ( ) ( 5 7 8 0102030405060700 5 10 15 20 25 30 TGRID, Control Overhead (bytes/node/sec)HGRID, Control Overhead (bytes/node/sec)

5 - 10 ( ) / / ( ) (

5 - 11 5 - 12 HGRID TGRID . . TGRID HGRID . HGRID H-1 . . . TGRID . .

5 7 9 00.511.522.533.540 5 10 15 20 25 30 TGRID, Control Overhead (packets/data packet)HGRID, Control Overhead (packets/data packet)

5 - 11 ( ) / ( ) (

0501001502002503000 5 10 15 20 25 30 TGRID, Control Overhead (bytes/data packet)HGRID, Control Overhead (bytes/data packet)

5 - 12 ( ) / ( ) ( 5 - 13 . . HGRID TGRID . 5 8 0 00.511.522.533.544.50 5 10 15 20 25 30 TGRID, Avg. delay(secs) for DataHGRID, Avg. delay(secs) for Data

5 - 13 ( ) ( ) ( 5 - 14 HGRID TGRID TGRID . TGRID HGRID . .00.20.40.60.810 5 10 15 20 25 30 TGRID, Query success ratioHGRID, Query success ratio

5 - 14 ( ) ( 5 - 15 . . TGRID HGRID . 5 8 1 TGRID . .01020304050607080901001100 5 10 15 20 25 30 TGRID, Throughput (packets rcvd )HGRID, Throughput (packets rcvd )

5 - 15 ( ) ( 5 - 5 TGRID TGRID HGRID . . TGRID . TGRID . 6 8 2 6 . 6 8 3

6 - 1 . . . 1 . : DSDV . . . DSR DSDV . . . LAR 1 Forwarding 6 8 4 DREAM . 1 Ad Hoc . . 2 . ) GLS GHLS HGRID SLURP SLALoM ( . . . . TGRID . HGRID ] 2 [ . TGRID HGRID . . 6 - 1 . HGRID GLS ] 18 [ .

1 Position-Based Routing 2 Location Services 6 8 5 6 - 1 ( ]30 [HGRID GLS TGrid ) log ( N O ) ( N O ) log . (3N v O ) ( N O(uniform)) (log N O(localized)) ( N O(uniform)) (log N O(localized)) (3N O(uniform)) (log3N O(localized) ) (log N O ) (log N O) (log3N O

TGRID HGRID . TGRID HGRID . TGRID . TGRID . . . . GLS . . " " . : . . . . 6 8 6 . . TGRID DROP . . . 8 7 [1]K.N.Amouris,S.Papavassiliou,andM.Li.,APosition-BasedMulti-Zone Routing Protocolfor WideArea MobileAd-hoc Networks, In Proceedings of the IEEE Vehicular Technology Conference (VTC), pp. 1365-1369, 1999. []M.Mauve,J.Widmer,andH.Hartenstein,ASurveyonPosition-Based RoutinginMobileAd-HocNetworks,IEEENetwork,vol.15,no6,pp.3039, December 2001. []I.Stojmenovic,PositionBasedRoutinginAdhocNetworks,IEEE Communications Magazine, vol. 40, no. 7, pp. 128134, July 2002. [] C. Perkins and E. Royer, Ad- hoc on- demand Distance Vector Routing, InProceedingsoftheSecondIEEEWorkshop.MobileComp.Sys.App.,pp.90 100, Feb. 1999. []D.JohnsonandD.Maltz,MobileComputing,KluwerAcademicPublishers, pp. 81-153, 1996. []S.C.WooandS.Singh,ScalableRoutingProtocolforAdhocNetworks, ACM Wireless Networks, vol. 7, no. 5,pp. 513-529, September 2001. []T.Camp,J.Boleng,L.Wilcox,LocationInformationServicesinMobileAd hocNetworks,InProceedingsoftheIEEEInternationalConferenceon Communications (ICC), pp. 33183324, 2002. []Z.J.HaasandB.Liang.AdhocMobilityManagementwithRandomized DatabaseGroups,InProceedingsoftheIEEEInternationalConferenceon Communications (ICC), pp. 1756-1762, 1999. [] Z.J. Haas and B. Liang, Adhoc mobility Management with Uniform Quorum Systems, IEEE/ACM Transactions on Networking, vol.7, no. 2, pp. 228-240, April 1999. []G.Karumanchi,S.Muralidharan,R.Prakash,InformationDisseminationin PartitionableMobileAdhocNetworks,InProceedingsoftheIEEESymposium on Reliable Distributed Systems, pp. 4-13, 1999. []B.Liang,Z.J.Haas,VirtualBackboneGenerationandMaintenanceinAd hocNetworkMobilityManagement,InProceedingsoftheAnnualJoint Conference of the IEEE Computer and Communications Societies(INFOCOM), pp. 1293-1302, 2000. 8 8 []I.Stojmenovic,AScalableQuorumBasedLocationUpdateSchemefor Routing in Ad hoc Wireless Networks, Technical Report TR-99-09, University of Ottawa, September 2002. []P.H.Hsiao,GeographicalRegionSummaryServiceforGeographical Routing,ACMSIGMOBILEMobileComputingandCommunicationsReview, vol.5, no. 4, pp. 25-39, October 2001. []J.Li,J.Jannotti,j.Karger,LocationServiceforGeographicAd-hoc Routing, In Proceedings of the Mobicom 2000, pp. 120130, August 2000. [] N. Guba, T. Camp, Recent Work on GLS: a Location Service for an Ad Hoc Network, In Proceedings of the Grace Hopper Celebration, 2002. [] M. Das, H. Pucha,Y. Charlie, Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing, IEEE INFOCOM, pp. 52-71, 2005. []I.Abraham,D.Dolev,D.Malkhi,LLS:aLocalityAwareLocationService forMobileAdhocNetworks,InProceedingsofthe2004jointworkshopon Foundations of mobile computing, , Philadelphia, PA, USA, October, 2004. []S.J.Philip,J.Ghosh,Ch.Qiao,PerformanceEvaluationofaMultilevel Hierarchical Location Management Protocolfor Adhoc Network, in Proceedings of the elsevier Mobile Ad-Hoc Systems, pp. 55-67, July 2004. []Y.Yu,G.H.Lu,Z.Li.Zhang,LocationServiceinAd-HocNetworks: ModelingandAnalysis,InProceedingsofNSFWorkshoponTheoreticaland Algorithm Aspect of Ad Hoc Wireless Networks, Chicago, June 2004. []Y.Yu,G.H.Lu,EnhancingLocationServiceScalabilitywith HIGH_GRADE, in Proceedings of the IEEE Mobile Ad-Hoc and Sensor Systems (MASS'04), pp. 164-173, Oct. 2004. []C.Cheng,H.Lemberg,S.Philip,E.Berg,T.Zhang,SLALoM:AScalableLocationManagementSchemeforLargeMobileAd-hocNetworks,in ProceedingsofIEEEWirelessCommunicationsandNetworkingConf.(WCNC), Atlanta, March 2002. []W.Kiess,HierarchicalLocationServiceforMobileAd-hocNetworks, Mastersthesis,DepartmentofMathematicsandComputerScience,Universityof Mannheim, 2003. []B.KarpandH.T.Kung.GPSR:GreedyPerimeterStatelessRoutingfor Wireless Networks, In Mobile Computing and Networking, pp. 243.254, 2000. []S.J.Philip,C.Qiao,HierarchicalGridLocationManagementforLarge Wireless Ad hoc Networks, In Proceedings of ACM MobiHoc 03, June 2003. 8 9 []GloMoSim:GlobalMobileInformationSystemsSimulationLibrary. http://pcl.cs.ucla.edu/projects/glomosim/. [] M. K. asemann, H. Hartenstein, M. Mauve. A Reactive Location Service for Mobile Ad hoc Networks, Technical report, Department of Science, University of Mannheim, November 2002. [] M. K. asemann, H. Hartenstein, M. Mauve. Analysis of a Location Service for Position-Based Routing in Mobile Ad hoc Networks, In Proceedings of the 1st German Workshop on Mobile Ad-Hoc Networks (WMAN), pp. 121-133, 2002. []V.Kumar,S.R.Das.PerformanceofDeadReckoning-BasedLocation ServiceforMobileAdhocNetworks,WirelessCommunicationsandMobile Computing, vol.7, no. 4, pp. 22-34, 2003. []G.Pei,M.Gerla.MobilityManagementforHierarchicalWireless Networks, Mobile Networks and Applications, vol. 6, no. 4, pp. 331-337, August 2001. []S.J.Philip,J.Ghosh,ScalabilityAnalysisofLocationManagementProtocols forMobileAdHocNetworks,inProceedingsoftheIEEEWCNC('04),Atlanta Georgia, USA, Mar. 2004. []SumeshJ.Philip,ScalableLocationManagementforGeographicRoutingin Mobile Ad hoc Networks, PhD Thesis, New York at Buffalo Univ., 2005. []Y.Xue,B.Li,K.Nahrstedt,AScalableLocationManagementinMobileAd-hocNetworks,inProceedingsoftheIEEEConf.onLocalComputer Networks(LCN'01), FL. USA., Nov. 2001. 90 ) (Ad Hoc All-for-All All-for-Some Autonomous Availability Beacons Boundary Crossing Rate Cache Departed Directional Routing Distance Based Distance Effect Distance Routing Effect Algorithm forMobility Distance Vector Dynamic Face Flooding with Self Pruning Forwarding Forwarding Pointer Geocasting Geographic Forwarding Geographic-Based Greedy Forwarding Gridy Perimeter Stateless Routing Protocol Hand-Held Devices Hash Function 91 Header Hierarchical Approaches Hierarchical State Routing Home Region Location Service Home Zone Hybrid Link-State Local Maximum Location Database Systems Location Dissemination Systems Location Server Points Location services Non Ad-Hoc Non-Position Based Approaches Planar Position-Based Routing Predictive Distance Based Pre-Established Proactive Protocol Quorum Based Location Service Reactive Recovery Restricted Directional Flooding Self Positioning Algorithm Simple Location Service Some-for-All 92 Some-for-Some Spatial Resolution Temporal Resolution ThresholdThroughput Time Based Topology-Based Unicast

93 ) (Distance Effect Pre-Established Forwarding Pointer Distance Routing Effect Algorithm for Mobility ReactiveThreshold RecoveryDistance Based Time Based Some-for-Some Some-for-All Distance Vectore Distance VectorGeocasting Protocol DynamicProactive Predictive Distance Based Hash Function Temporal Resolution Spatial Resolution HybridUnicast Forward ForwardingGreedy Forwarding 94 Cache Link-State Departed Autonomous AvailabilityHand-Held Devices Hierarchical Approaches Non-Position Based Approaches Geographic Forwarding BeaconsHeaderQuorum Based Location Service Simple Location Service Home Region location Service location services Location Database Systems Location Dissemination Systems Flooding With Self Pruning Restricted Directional Flooding Non Ad-Hoc Home Zone Throughput Local Maxinmum Topology-Based Geographic-Based Self Positioning Algorithm Planar 95 Gridy Perimeter Stateless Routing Protocol Directional Routing Hierarchical State Routing Position-Based Routing Ad HocHome Zone Boundary Crossing Rate Location Server Points All-for-Some All-for-All Face 96 Abstract Networks which dont have any pre-established organization and the nodesinthemchangetheirpositionfrequentlyarecalledMobileAd-Hoc Networks.Duetohighlydynamicbehaviorofthenodes,routingisoneof the most challenging tasks in these networks. By now, the routing strategies whicharebasedongeographicpositionofnodesaremoreacclaimed.For establishing routes between nodes in these strategies, the sender node must be aware of the geographic position of the receiver. To do so, nodes should distributeinformationabouttheirlocationinthenetwork.Theyalsoneed informationaboutothernodespositions.Forthispurposelocation managementmechanismsareinnovatedwhichuselocationservices. Locationserviceskeepinformationaboutgeographicalpositionsofthe nodesandanswertothelocationqueriesfromothernodes.Oneofthe challengesindesignoflocationservicesismakingthemscalableand reducingdataoverheadsgeneratedduetosendinggeographicaldatainthe network.Inthisthesisobstaclesandproblemsinscalabilityoflocation managementmethodsarediscussedandnewmethodnamedTGRIDis proposedwhichusesthefeaturesofthegeographicalroutingmethodsto makescalability.Thismethodcanbecategorizedasagrid-basedlocation servicemethodsinceitusestheadvantagesofhierarchaldivisionofthe networkanddefinitionoflocationserverstoincreaseperformanceand scalabilityandtoreduceroutingoverheadwhennetworksizeanddensity ofnodesincrease.Designoptionscanaffectthescalabilityofthelocation serviceandsoaffectthewholescalabilityofthegeographicalrouting method.ResultsfromanalyticalstudyofTGRIDinatheoretical frameworkandevaluatingthemusingtheGloMoSimsimulationsoftware hasshownthatindifferentscenariosofnodecountsandnodespeeds, designoftheTGRIDcanimprovethethreecostfactorswhichare:query cost, update cost and storage cost. Keywords:MobileAd-HocNetwork,LocationService,Location Management,Grid,Geographic-BasedRouting,TheoreticalFramework, Analytic Study, TGRID