Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Systems, Networks, and Communications
Volume 2008, Article ID 160453, 10 pages
Research Article

Constrained Delaunay Triangulation for Ad Hoc Networks

Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati 781039, Assam, India

Received 4 September 2007; Revised 12 January 2008; Accepted 22 February 2008

Academic Editor: Bechir Hamdaoui

Copyright © 2008 D. Satyanarayana and S. V. Rao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper, we propose a new spanner called constrained Delaunay triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by introducing a small set of constraint edges into local Delaunay triangulation (LDel) to reduce the number of hops between nodes in the network graph. We have simulated the CDT using network simulator (ns-2.28) and compared with Gabriel graph (GG), relative neighborhood graph (RNG), local Delaunay triangulation (LDel), and planarized local Delaunay triangulation (PLDel). The simulation results show that the minimum number of hops from source to destination is less than other spanners. We also observed the decrease in delay, jitter, and improvement in throughput.