Minimizing Recovery State in Geographic Ad Hoc Routing
Minimizing Recovery State in Geographic Ad Hoc Routing
复制标题
DOI：
10.1145/1132905.1132908
复制
发表时间：
2006-05
影响因子：
7.9
通讯作者：
Noa Arad;Y. Shavitt
中科院分区：
文献类型：
--
作者：
Noa Arad;Y. Shavitt
地理自组织网络使用位置信息进行路由。它们通常利用无状态贪婪转发，并且在贪婪方法失败时需要使用恢复算法。我们提出了一种基于节点虚拟重定位的新思想，它可以提高贪婪路由的效率，并显着增加仅基于局部信息的恢复算法的成功率。我们解释了预测贪婪算法可能到达的死胡同并绕过网络中的空洞的问题，并引入了近节点提升自组织路由，这是一种结合了虚拟定位和路由算法的解决方案，其改进了包含空洞的自组织网络中的性能。我们通过仿真验证了该算法相对于其他地理自组网路由方案的优势。
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails. We propose a novel idea based on virtual repositioning of nodes that allows to increase the efficiency of greedy routing and significantly increase the success of the recovery algorithm based on local information alone. We explain the problem of predicting dead ends which the greedy algorithm may reach and bypassing voids in the network, and introduce NEAR, node elevation ad-hoc routing, a solution that incorporates both virtual positioning and routing algorithms that improve performance in ad-hoc networks containing voids. We demonstrate by simulations the advantages of our algorithm over other geographic ad-hoc routing solutions.