Supported by the National Natural Science Foundation of China under Grant No.60973122 (国家自然科学基金); the Aeronautics Foundation of China under Grant No.20091969022 (航空基金)
A Geographic Surface Routing Algorithm in 3D Ad Hoc Networks
School of Computer Science and Engineering, Southeast University, Nanjing 211198, China; Shanghai Institute of Microsystems and Information Technology, The Chinese Academy of Sciences, Shanghai 200050, China 在期刊界中查找 在百度中查找 在本站中查找
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.