三维AD-HOC 网络地理信息路由算法

在二维AD-HOC 网络中,可以充分利用节点的地理信息进行路由,即AD-HOC 中节点根据邻居节点的距离目标节点的距离,选择下一跳节点进行路由转发.由于AD-HOC 中节点部署通常不满足均匀分布,造成网络中出现路由空洞,贪婪转发算法在遭遇空洞的情况下将无法正确执行.在二维AD-HOC 网络环境中,往往采用贪婪(Greedy)算法结合表面路由(Face Routing)的方法跳出路由空洞.但是在三维条件下,目前没有很好跳出路由空洞的算法能够实现有效的路由.提出了一种在三维AD-HOC 网络中的地理信息路由算法GSG,该算法使用3D RDT 图和3D RRNG 图的方法实现三维网络空间的划分.采用3D 表面路由的方法进行信息传递,在遭遇局部最小点时,可有效跳出路由空洞.仿真实验结果表明,GSG 算法可提升三维AD-HOC 网络条件下地理信息路由的效率,具有良好的可扩展性.

A Geographic Surface Routing Algorithm in 3D Ad Hoc Networks

For geographic routing in 2D ad hoc networks, greedy algorithm is efficient. The next hop node is selected according to the distance to the destination. However, greedy forwarding fails when a message reaches a local-minimum. Face routing is used to solve these problems. Unfortunately, these results cannot be applied to 3D networks directly. We propose an algorithm GSG (Greedy Surface routing Greedy) for geographic routing in 3D environments. We partition whole network with 3D Restricted Delaunay Triangulation. Triangles and isolated edges are defined as 3D components on Surface. By means of identifying intersecting triangles and edges, efficient routes are constructed on surfaces by bypassing local-minimums. Simulation results show that GSG achieves good routing performance and scalability.