Abstract
For geographic routing in 2D ad hoc networks, greedy algorithm is efficient if no holes exist. However, greedy forwarding fails when a message reaches a local-minimum. Thus, face routing is used to solve the problem of local-minimums. Unfortunately, few research results can be applied to geographic routing in 3D environments. This paper proposes an algorithm GSG (Greedy Surface routing Greedy), for geographic routing in 3D environments. GSG firstly partitions whole network with 3D Restricted Delau-nay Triangulation. When a local-minimum is encountered because of a hole, a message is transferred on a surface with triangles in order to jump out of a local-minimum area. 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. For sparsely deployed networks, an algorithm DFS based on 3D RNG is provided. Simulation results show that GSG outperforms the algorithms such as GRG and GHG.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
