嵌入在任意亏格曲面上的图的局部路由
Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus
摘要:
我们提出了一个本地路由算法,保证交付的所有连接图嵌入在一个已知的表面属$g$。该算法传输$O(g\log n)$内存并及时完成$O(g^2n^2)$,其中$n$是图的大小。它需要获得表面的同源基础。这个算法,GFR,可以被看作是一个合适的推广面路由(FR),众所周知的算法平面图,我们以前证明了{ \it不}保证交付的图形嵌入在正亏格表面。这样的表面的问题是可能存在的同调非平凡的封闭的步行,可以遍历的右手规则。我们使用一个有趣的数学性质的同源基地(证明引理\ref{lem:connectFaceBdr}),以显示这样的散步不会阻碍GFR。FR是现代(2D)ad hoc网络中使用的大多数路由算法的基础:这些算法都涉及额外的本地技术来处理边缘交叉,因此可以应用FR。GFR应该以同样的眼光看待,作为一种基础算法,例如可以针对3D表面上的传感器网络进行定制。目前还没有已知的有效的本地,对数记忆算法的3D ad hoc网络。从理论的角度来看,我们的工作表明,效率的优势,FR的好处是相关的余维一个性质的嵌入式图形在一个表面,而不是平面的表面(平面性)。
英文摘要:
We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does {\it not} guarantee delivery in graphs embedded on positive genus surfaces. The problem for such surfaces is the potential presence of homologically non-trivial closed walks which may be traversed by the right-hand rule. We use an interesting mathematical property of homology bases (proven in Lemma \ref{lem:connectFaceBdr}) to show that such walks will not impede GFR. FR is at the base of most routing algorithms used in modern (2D) ad hoc networks: these algorithms all involve additional local techniques to deal with edge-crossings so FR may be applied. GFR should be viewed in the same light, as a base algorithm which could for example be tailored to sensor networks on surfaces in 3D. Currently there are no known efficient local, logarithmic memory algorithms for 3D ad hoc networks. From a theoretical point of view our work suggests that the efficiency advantages from which FR benefits are related to the codimension one nature of an embedded graph in a surface rather than the flatness of that surface (planarity).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。