%PDF-1.4 % 4 0 obj << /S /GoTo /D (chapter.1) >> endobj 7 0 obj (Introduction) endobj 8 0 obj << /S /GoTo /D (section.1.1) >> endobj 11 0 obj (Compact Name-Independent Routing with Minimum Stretch) endobj 12 0 obj << /S /GoTo /D (section.1.2) >> endobj 15 0 obj (Name-Independent Routing with Improved Communication-Space Trade-Off) endobj 16 0 obj << /S /GoTo /D (section.1.3) >> endobj 19 0 obj (Name-Independent Routing for Growth Bounded Network) endobj 20 0 obj << /S /GoTo /D (section.1.4) >> endobj 23 0 obj (Scale-Free Name-Independent Routing) endobj 24 0 obj << /S /GoTo /D (section.1.5) >> endobj 27 0 obj (LLS : Name-Independent Routing for Mobile Ad Hoc Networks) endobj 28 0 obj << /S /GoTo /D (chapter.2) >> endobj 31 0 obj (Compact Name-Independent Routing with Minimum Stretch) endobj 32 0 obj << /S /GoTo /D (section.2.1) >> endobj 35 0 obj (Introduction) endobj 36 0 obj << /S /GoTo /D (subsection.2.1.1) >> endobj 39 0 obj (Our results) endobj 40 0 obj << /S /GoTo /D (section.2.2) >> endobj 43 0 obj (Preliminaries) endobj 44 0 obj << /S /GoTo /D (section.2.3) >> endobj 47 0 obj (The Stretch 3 Scheme) endobj 48 0 obj << /S /GoTo /D (subsection.2.3.1) >> endobj 51 0 obj (Vicinity balls) endobj 52 0 obj << /S /GoTo /D (subsection.2.3.2) >> endobj 55 0 obj (Coloring) endobj 56 0 obj << /S /GoTo /D (subsection.2.3.3) >> endobj 59 0 obj (Hashing names to colors) endobj 60 0 obj << /S /GoTo /D (subsection.2.3.4) >> endobj 63 0 obj (Stretch 3 for complete graphs) endobj 64 0 obj << /S /GoTo /D (subsection.2.3.5) >> endobj 67 0 obj (Routing on trees) endobj 68 0 obj << /S /GoTo /D (subsection.2.3.6) >> endobj 71 0 obj (Landmarks) endobj 72 0 obj << /S /GoTo /D (subsection.2.3.7) >> endobj 75 0 obj (Partial shortest path trees) endobj 76 0 obj << /S /GoTo /D (subsection.2.3.8) >> endobj 79 0 obj (The stretch 3 scheme) endobj 80 0 obj << /S /GoTo /D (subsection.2.3.9) >> endobj 83 0 obj (Analysis) endobj 84 0 obj << /S /GoTo /D (section.2.4) >> endobj 87 0 obj (On Polynomial Time Coloring) endobj 88 0 obj << /S /GoTo /D (section.2.5) >> endobj 91 0 obj (On Hashing in Constant Time) endobj 92 0 obj << /S /GoTo /D (section.2.6) >> endobj 95 0 obj (Combining the Ingredients) endobj 96 0 obj << /S /GoTo /D (section.2.7) >> endobj 99 0 obj (Conclusion) endobj 100 0 obj << /S /GoTo /D (chapter.3) >> endobj 103 0 obj (Name-Independent Routing with Improved Communication-Space Trade-Off) endobj 104 0 obj << /S /GoTo /D (section.3.1) >> endobj 107 0 obj (Introduction) endobj 108 0 obj << /S /GoTo /D (section.3.2) >> endobj 111 0 obj (Preliminaries) endobj 112 0 obj << /S /GoTo /D (section.3.3) >> endobj 115 0 obj (Linear Communication-Space Trade-Off) endobj 116 0 obj << /S /GoTo /D (subsection.3.3.1) >> endobj 119 0 obj (Tree cover based on Sparse Partitions) endobj 120 0 obj << /S /GoTo /D (subsection.3.3.2) >> endobj 123 0 obj (Bounded cost name-independent tree-routing) endobj 124 0 obj << /S /GoTo /D (subsection.3.3.3) >> endobj 127 0 obj (The name-independent routing scheme) endobj 128 0 obj << /S /GoTo /D (subsection.3.3.4) >> endobj 131 0 obj (Bounded-cost name-independent tree-routing) endobj 132 0 obj << /S /GoTo /D (subsection.3.3.5) >> endobj 135 0 obj (Analysis) endobj 136 0 obj << /S /GoTo /D (chapter.4) >> endobj 139 0 obj (Name-Independent Routing for Growth Bounded Networks) endobj 140 0 obj << /S /GoTo /D (section.4.1) >> endobj 143 0 obj (Introduction) endobj 144 0 obj << /S /GoTo /D (subsection.4.1.1) >> endobj 147 0 obj (Problem definition) endobj 148 0 obj << /S /GoTo /D (subsection.4.1.2) >> endobj 151 0 obj (Our results) endobj 152 0 obj << /S /GoTo /D (subsection.4.1.3) >> endobj 155 0 obj (Related work) endobj 156 0 obj << /S /GoTo /D (section.4.2) >> endobj 159 0 obj (Overview) endobj 160 0 obj << /S /GoTo /D (section.4.3) >> endobj 163 0 obj (Preliminaries) endobj 164 0 obj << /S /GoTo /D (section.4.4) >> endobj 167 0 obj (The Scheme) endobj 168 0 obj << /S /GoTo /D (subsection.4.4.1) >> endobj 171 0 obj (Identifiers and the zero-sets.) endobj 172 0 obj << /S /GoTo /D (subsection.4.4.2) >> endobj 175 0 obj (Zero-Assisted Routing) endobj 176 0 obj << /S /GoTo /D (subsection.4.4.3) >> endobj 179 0 obj (Prefix routing) endobj 180 0 obj << /S /GoTo /D (subsection.4.4.4) >> endobj 183 0 obj (The Directory) endobj 184 0 obj << /S /GoTo /D (subsection.4.4.5) >> endobj 187 0 obj (The Routing Algorithm) endobj 188 0 obj << /S /GoTo /D (subsection.4.4.6) >> endobj 191 0 obj (Correctness) endobj 192 0 obj << /S /GoTo /D (section.4.5) >> endobj 195 0 obj (Stretch Analysis) endobj 196 0 obj << /S /GoTo /D (section.4.6) >> endobj 199 0 obj (Space Analysis) endobj 200 0 obj << /S /GoTo /D (chapter.5) >> endobj 203 0 obj (Scale-Free Name-Independent Routing) endobj 204 0 obj << /S /GoTo /D (section.5.1) >> endobj 207 0 obj (Introduction) endobj 208 0 obj << /S /GoTo /D (subsection.5.1.1) >> endobj 211 0 obj (Our contribution) endobj 212 0 obj << /S /GoTo /D (subsection.5.1.2) >> endobj 215 0 obj (Techniques) endobj 216 0 obj << /S /GoTo /D (subsection.5.1.3) >> endobj 219 0 obj (Related work) endobj 220 0 obj << /S /GoTo /D (section.5.2) >> endobj 223 0 obj (Sparse and Dense Neighborhood Decomposition) endobj 224 0 obj << /S /GoTo /D (subsection.5.2.1) >> endobj 227 0 obj (Preliminaries) endobj 228 0 obj << /S /GoTo /D (subsection.5.2.2) >> endobj 231 0 obj (Dense Levels) endobj 232 0 obj << /S /GoTo /D (subsection.5.2.3) >> endobj 235 0 obj (Sparse Levels) endobj 236 0 obj << /S /GoTo /D (section.5.3) >> endobj 239 0 obj (A Scale-Free Routing Scheme) endobj 240 0 obj << /S /GoTo /D (subsection.5.3.1) >> endobj 243 0 obj (Sparse neighborhood routing strategy) endobj 244 0 obj << /S /GoTo /D (subsection.5.3.2) >> endobj 247 0 obj (Storage for sparse neighborhood strategy) endobj 248 0 obj << /S /GoTo /D (subsection.5.3.3) >> endobj 251 0 obj (Routing algorithm for sparse neighborhood strategy) endobj 252 0 obj << /S /GoTo /D (subsection.5.3.4) >> endobj 255 0 obj (Dense neighborhood routing strategy) endobj 256 0 obj << /S /GoTo /D (subsection.5.3.5) >> endobj 259 0 obj (Storage for dense neighborhood strategy) endobj 260 0 obj << /S /GoTo /D (subsection.5.3.6) >> endobj 263 0 obj (Routing algorithm for dense neighborhood strategy) endobj 264 0 obj << /S /GoTo /D (subsection.5.3.7) >> endobj 267 0 obj (Analysis) endobj 268 0 obj << /S /GoTo /D (section.5.4) >> endobj 271 0 obj (Conclusion) endobj 272 0 obj << /S /GoTo /D (chapter.6) >> endobj 275 0 obj (LLS : Name-Independent Routing for Mobile Ad Hoc Networks) endobj 276 0 obj << /S /GoTo /D (section.6.1) >> endobj 279 0 obj (Introduction) endobj 280 0 obj << /S /GoTo /D (subsection.6.1.1) >> endobj 283 0 obj (Our Results) endobj 284 0 obj << /S /GoTo /D (subsection.6.1.2) >> endobj 287 0 obj (Related work) endobj 288 0 obj << /S /GoTo /D (subsection.6.1.3) >> endobj 291 0 obj (Technical approach) endobj 292 0 obj << /S /GoTo /D (section.6.2) >> endobj 295 0 obj (Model and Notations) endobj 296 0 obj << /S /GoTo /D (subsection.6.2.1) >> endobj 299 0 obj (Virtual Coordinates) endobj 300 0 obj << /S /GoTo /D (section.6.3) >> endobj 303 0 obj (Problem Definition) endobj 304 0 obj << /S /GoTo /D (section.6.4) >> endobj 307 0 obj (LLS Architecture) endobj 308 0 obj << /S /GoTo /D (subsection.6.4.1) >> endobj 311 0 obj (Mapping to Hierarchical Lattices) endobj 312 0 obj << /S /GoTo /D (section.6.5) >> endobj 315 0 obj (The Spiral Algorithm) endobj 316 0 obj << /S /GoTo /D (subsection.6.5.1) >> endobj 319 0 obj (Analysis) endobj 320 0 obj << /S /GoTo /D (section.6.6) >> endobj 323 0 obj (The Spiral-Flood Algorithm) endobj 324 0 obj << /S /GoTo /D (subsection.6.6.1) >> endobj 327 0 obj (Analysis) endobj 328 0 obj << /S /GoTo /D (section.6.7) >> endobj 331 0 obj (The LLS Algorithm) endobj 332 0 obj << /S /GoTo /D (subsection.6.7.1) >> endobj 335 0 obj (Analysis) endobj 336 0 obj << /S /GoTo /D (section.6.8) >> endobj 339 0 obj (Fault Tolerance) endobj 340 0 obj << /S /GoTo /D (section.6.9) >> endobj 343 0 obj (Improving Locality Awareness) endobj 344 0 obj << /S /GoTo /D (section.6.10) >> endobj 347 0 obj (Simulations) endobj 348 0 obj << /S /GoTo /D (section.6.11) >> endobj 351 0 obj (Conclusions) endobj 352 0 obj << /S /GoTo /D [353 0 R /FitH ] >> endobj 355 0 obj << /Length 383 /Filter /FlateDecode >> stream xuRN0+|t1~#BAHE8$Zj=NUӮ흙YSAN?\0$h5@H NT~h\0,w>d19ƣVW)SK1`Drn1&_7C/X$xN. J2|8uamZ7z9#$ʅ"Tb.S}]?ϋ3@S#lʢql՜*H{rBU[n} yDGa smph8̩5\]f 84kbք3%f @yBLdsW;__|88{fCW51g'8Gb endstream endobj 353 0 obj << /Type /Page /Contents 355 0 R /Resources 354 0 R /MediaBox [0 0 612 792] /Parent 361 0 R >> endobj 356 0 obj << /D [353 0 R /XYZ 71 721 null] >> endobj 357 0 obj << /D [353 0 R /XYZ 72 688.245 null] >> endobj 354 0 obj << /Font << /F18 358 0 R /F19 359 0 R /F34 360 0 R >> /ProcSet [ /PDF /Text ] >> endobj 364 0 obj << /Length 258 /Filter /FlateDecode >> stream xePAn0{1cεTBԪ! "$P_GHݝ-0@ceALS#؝fˠ50 dabm}#6kYXq\S ]PQ`mZ;9 ΅*5xM`:$xmunړ]/VKഌ aQeR(t]K2^m}ĮiKO?9>_PfJZji +[/8_ endstream endobj 363 0 obj << /Type /Page /Contents 364 0 R /Resources 362 0 R /MediaBox [0 0 612 792] /Parent 361 0 R >> endobj 365 0 obj << /D [363 0 R /XYZ 71 721 null] >> endobj 367 0 obj << /D [363 0 R /XYZ 72 639.186 null] >> endobj 362 0 obj << /Font << /F18 358 0 R /F38 366 0 R /F19 359 0 R >> /ProcSet [ /PDF /Text ] >> endobj 370 0 obj << /Length 1582 /Filter /FlateDecode >> stream xڅr6LMILz9$$bD*HZQ>"-;B.}cx[/_wxG^"ɼ-*e*q^6_x]yQ̲(/e,*֕տ*Q:ˡVCdA*M#r22*b)~Q?,L_\EDF`xLe|~,TcfPՃ_!תN]F?c+`x]m$@y˗i5Y&xGXDŽSތͼPkcϸjH ۍVbPwmNJЏ=кaB ľC|В, ҳ =_
#lsP[M;J;bn0+f0?gќ,2zIsu :yst+X;5M"GA+RWTZr\C|h:{U8;r[u*Qsbt=@/[r0T*{W!\2Ox9]# RCmԝ$66јB^+7n]qsVlki(7FNwqwBߥpr ˭,WPo̎miX0e"S̫s\uJBЪI=CV)p+Ùg}D5g*-m n`tF5;ܵT|)yg,0! ITO0mAkRq)6Gf5-' ƈ Vڽ)m2ks@pOR^-_߁28`JƊDPk{`zj 0o:_nG^$ O2T}U1nB FxUɉ>ݷ!W;BpEjo$$)w^8%P"|Ru-]2MIHeC5SvL!{
Ϻ6Iy&R+H6XtEZZ(-
0nishپզ6F%sށ4RY*~}Ҝ`nf%s$wḻ$Bϰ<"=)]AI}
N~0^mN/̓8S Q.u`5ws^~ߙF+eO6XY=ZP o6Ki;