arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.3632cs.OScs.DCcs.DS
收藏

几何路由中保证交货的空运输问题

Void Traversal for Guaranteed Delivery in Geometric Routing

Mikhail Nesterenko, Adnan Vora

摘要:

几何路由算法,如GFG(GPSR)是轻量级的,可扩展的算法,可用于在资源受限的ad hoc无线网络的路由。然而,这样的算法只能在平面图上运行。为了有效地构造一个平面图,它们需要一个单位圆盘图。为了使拓扑单元-磁盘,网络中的最大链路长度必须保守地选择。在实际设置中,这导致节点密度相当高的设计。此外,平面子图的网络直径大于原始图,这导致更长的路线。为了解决这个问题,我们提出了一个空遍历算法,适用于任意几何图形。我们描述了如何使用该算法的几何路由与保证交付,并比较其性能与GFG。

英文摘要:

Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑