Greedy Local Delaunay Triangulation Routing for Wireless Ad Hoc Networks

Abstract

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