By Topic

Greedy Local Delaunay Triangulation Routing for Wireless Ad Hoc Networks

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

1 Author(s)
Satyanarayana, D. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol.

One of the challenging tasks in the design of wireless ad hoc networks is the development of dynamic routing protocol that can efficiently transmit packets between two multihop communication nodes. Most of the geometric based greedy routing protocols suffer from the problem of local maximum. Inspite of this problem, it is not always efficient to use geometric graphs in the routing of adhoc networks. In this paper, we propose a new geometric routing algorithm called greedy local Delaunay triangulation (GLDT) protocol. GLDT uses greedy forwarding with its immediate neighborhood information. When a packet reaches the local maximum, the algorithm recovers it by using local Delaunay triangulation and forwards the packet using right hand rule. The algorithm not only solves the local maximum problem but also outperforms on end-to-end packet delay and delivery ratio compared to the previously proposed algorithms. The simulation results show the performance of GLDT protocol

Published in:

Signal Processing, Communications and Networking, 2007. ICSCN '07. International Conference on

Date of Conference:

22-24 Feb. 2007