Randomized 3D Geographic Routing.pptVIP

Randomized 3D Geographic Routing Roland Flury Roger Wattenhofer Distributed Computing Group Roland Flury, ETH Zurich @ Infocom 2008 Geographic Routing in 2D Nodes are aware of their position (coordinates) Sender knows position of destination (how?) Location server, even for dynamic networks Memoryless: Nodes store no info about transmitted messages Highly desirable for dynamic networks Roland Flury, ETH Zurich @ Infocom 2008 Geographic Routing in 3D Is it really different? Greedy routing is still possible Local minima are now delimited by 2-dim surfaces (before: 1-dim line) All we need to is to explore 2-dim surfaces… Roland Flury, ETH Zurich @ Infocom 2008 2D vs 3D In 2D, we use a planar graph to capture the boundary of a routing void In 3D, there is no standard way to do this… We examine the simplistic UBG network model for 3D: Two nodes are connected iff their distance is below 1 Gabriel Graph Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D η Regular, virtual 3D-grid Side Length η = 0.258 We consider UBG, with a transmission range normalized to 1 Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D ρ u v A node owns the grid nodes at most ρ away ρ = 0.37 Virtual nodes are at the intersection point of 3D grid u v Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D ρ u v A node owns the grid nodes at most ρ away ρ = 0.37 Virtual nodes are at the intersection point of 3D grid u v Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D ρ u v h To ensure connectivity on the grid, add grid nodes in the cone h = 0.223 ρ = 0.37 η = 0.258 h, ρ, η are chosen such that Connectivity on the network ↨ Connectivity on the virtual grid η u v Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D Adding further nodes… u v Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D Adding further nodes… Each virtual node belongs to exactly one network node The decision is strictly local (2 hops) Roland Flury, ETH Zurich @ Infocom 2008 Surfaces in 3D Adding furt