Abstract
Delaunay triangulation has been widely used in many fields such as computational fluid dynamics, statistics, meteorology, solid state physics, computational geometry and so on. With the development of Ad Hoc networks, some researchers proposed geometric routing protocols to guarantee the delivery of the packet between any pair of nodes in the network, and the underlying network topology is also constructed by the ways of Delaunay triangulation. In this paper, a novel online routing algorithm GLNFR (greedy and local neighbor face routing) for finding communication paths between the mobile nodes is proposed. The localized manner is used to form the local Delaunay triangulation as the underlying topology of a wireless network on which the GLNFR routing algorithm could guarantee the delivery of the packets. It has better scalability and adaptability for the change of networks. Experiment on NS (network simulator) has been conducted. The results show that the delivery success rate of packets and routing protocol overhead under such novel routing protocols performs better than others proposed
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.
