arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0611117cs.DCcs.DScs.OS
收藏

2FACE:用于高效几何布线的双向面跟踪算法

2FACE: Bi-Directional Face Traversal for Efficient Geometric Routing

Mark Miyashita, Mikhail Nesterenko

摘要:

提出了双向人脸遍历算法$2FACE$,以缩短几何路由中消息到达目的地的路径。我们的算法结合了最好的单向遍历算法的实用性与最坏情况下的消息复杂度$O(|E|)$,其中$E$是网络边缘的数量。我们将$2FACE$应用到各种几何路由算法中。我们的模拟结果表明,双向人脸遍历减少了两到三倍的消息传递的延迟相比,单向人脸遍历。这样选择的路径接近最短的可能路线。这种速度上的提高伴随着类似的消息开销增加。我们描述了一种算法,它通过记录更好的面遍历方向来补偿此消息开销。因此,如果源有多个消息要发送到目的地,则后续消息将遵循最短路由。我们的模拟结果表明,与大多数几何路由算法的消息开销,找到最短的路线,通过双向面遍历补偿在两个到四个重复消息。

英文摘要:

We propose bi-directional face traversal algorithm $2FACE$ to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best single-direction traversal algorithms with the worst case message complexity of $O(|E|)$, where $E$ is the number of network edges. We apply $2FACE$ to a variety of geometric routing algorithms. Our simulation results indicate that bi-directional face traversal decreases the latency of message delivery two to three times compared to single direction face traversal. The thus selected path approaches the shortest possible route. This gain in speed comes with a similar message overhead increase. We describe an algorithm which compensates for this message overhead by recording the preferable face traversal direction. Thus, if a source has several messages to send to the destination, the subsequent messages follow the shortest route. Our simulation results show that with most geometric routing algorithms the message overhead of finding the short route by bi-directional face traversal is compensated within two to four repeat messages.

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

↑