By Topic

A novel geographic routing algorithm for ad hoc networks based on localized Delaunay triangulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Peng He ; State Key Lab. of Int. Service Networks, Xidian Univ., Xi''an, China ; Jiandong Li ; Lei Zhou

With the development of ad hoc networks, some researchers proposed several geometric routing protocols which depend on the planarization of the network connectivity graph to guarantee the delivery of the packet between any pair of nodes in the network. In this paper, we proposed a new online routing algorithm GLNFR (greedy and local neighbor face routing) for finding paths between the nodes of the ad hoc networks by storing a small amount of local face information at each node. The localized Delaunay triangulation was used to be the backbone of wireless network on which the GLNFR routing algorithm runs. It has the better scalability and adaptability for the change of ad hoc networks. Experiment on NS have been conducted. The results show that the delivery rate of packets and routing protocol message cost under such novel routing protocols performs better than others proposed before.

Published in:

Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on  (Volume:1 )

Date of Conference:

18-20 April 2006