Localized routing for wireless ad hoc networks

We show that given a set of randomly distributed wireless nodes with density n, when the transmission range r/sub n/ of wireless nodes satisfies /spl pi/r/sup 2//sub n/ /spl ges/ 3[(log n+c(n))/n], the localized Delaunay triangulation (LDel) [Xiang-Yang Li, G. Calinescu, and Peng-Jun Wan, 2002] is the same as the Delaunay triangulation with high probability, where c(n) /spl rarr/ /spl infin/ as n goes infinity. Our experiments show that the delivery rates of existing localized Delaunay triangulation is used instead of several previously proposed topologies, and the localized routing protocol based on Delaunay triangulation works well in practice.