期刊名称：Journal of Computer Networks and Communications
印刷版ISSN：2090-7141
电子版ISSN：2090-715X
出版年度：2008
卷号：2008
DOI：10.1155/2008/160453
出版社：Hindawi Publishing Corporation
摘要：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.
