.png){kind=icon}
.png){kind=icon}
Return
Succinct Greedy Geometric Routing Using Hyperbolic Geometry
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2010.257.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We describe a method for performing greedy geometric routing for any n-vertex simple connected graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M's destination. Our algorithm produces succinct embeddings, where vertex positions are represented using O(log n) bits and distance comparisons may be performed efficiently using these representations. These properties are useful, for example, for routing in sensor networks, where storage and bandwidth are limited.
Keywords:
Greedy routing
hyperbolic geometry
autocratic weight-balanced trees
dyadic tree metric space
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
