基于反应偏转的高效贪婪地理非平面路由算法
Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection
摘要：
我们提出了一种新的地理路由方案的自发无线网状网络。贪婪的地理路由有很多优点，但遭受的数据包丢失发生在边界的空隙。在本文中，我们提出了一个灵活的贪婪路由方案，可以适应任何变种的地理路由和工程的任何连接图，不一定是单位盘图。这个想法是反应性地检测空隙，回溯数据包，并在阻塞的扇区上传播信息以减少数据包丢失。我们还提出了一个外推算法，以减少空发现的延迟和限制路由拉伸。通过仿真的性能评估表明，改进后的贪婪路由避免了大部分的丢包。
英文摘要：
We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
