欧氏平面上的简洁贪婪几何路由
Succinct Greedy Geometric Routing in the Euclidean Plane
摘要：
在贪婪几何路由中，消息在嵌入度量空间的网络中根据总是将消息转发到更接近目的地的节点的贪婪策略进行传递。我们证明了对于R^2中的欧氏度量，对于3连通平面图，存在贪婪的几何路由方案，其坐标可以简洁地表示，也就是说，具有O（log n）位，其中n是图中的顶点数。此外，我们的嵌入策略为R^2引入了一个坐标系，支持使用我们简洁的坐标进行距离比较。因此，我们的方案可以用来显着减少带宽，空间和头部大小比其他最近发现的贪婪几何路由实现R^2。
英文摘要：
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy geometric routing schemes exist for the Euclidean metric in R^2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits, where n is the number of vertices in the graph. Moreover, our embedding strategy introduces a coordinate system for R^2 that supports distance comparisons using our succinct coordinates. Thus, our scheme can be used to significantly reduce bandwidth, space, and header size over other recently discovered greedy geometric routing implementations for R^2.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
