The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RNG) or Gabriel graph (GG) is used as such planar structure. However, it is well-known that the spanning ratios of these two graphs are not bounded by any constant (even for uniform randomly distributed points). Bose et al. recently developed a localized routing protocol that guarantees that the distance traveled by the packets is within a constant factor of the minimum if Delaunay triangulation of all wireless nodes is used, in addition, to guarantee the delivery of the packets. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we model the network as a unit-disk graph (UDG), in which a link uv exists only if the distance \Vert uv \Vert is at most the maximum transmission range. In this paper, we present a novel localized networking protocol that constructs a <it>planar</it> 2.5-spanner of UDG, called the localized Delaunay triangulation (LD<scp>el</scp>), as network topology. It contains all edges that are both in the unit-disk graph and the Delaunay triangulation of all nodes. The total communication cost of our networking protocol is O(n log n) bits, which is within a constant factor of the optimum to construct any structure in a distributed manner. Our experiments show that the delivery rates of some of the existing localized routing protocols are increased when localized Delaunay triangulation is used instead of several previously proposed topologies. Our simulations also show that the traveled distance of the packets is significantly less when the F<scp>ace</scp> routing algorithm is applied on LD<scp>el</scp>, rather than applied on GG.</p>
Delaunay triangulation, localized method, planar, routing, spanner, topology control, wireless networks.

X. Li, P. Wan, Y. Wang and G. Calinescu, "Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 1035-1047, 2003.
90 ms
(Ver 3.3 (11022016))