Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks

Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RING) 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. (1999) 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 /spl par/uv/spl par/ is at most the maximum transmission range. In this paper, we present a novel localized networking protocol that constructs a planar 2 5-spanner of UDG, called the localized Delaunay triangulation (LDEL), 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 FACE routing algorithm is applied on LDEL, rather than applied on GG.

[1]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[2]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[3]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[4]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[5]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[6]  Ivan Stojmenovic,et al.  Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation , 2004, IEEE Transactions on Parallel and Distributed Systems.

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2002, Int. J. Comput. Geom. Appl..

[9]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

[10]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[11]  Lali Barrière,et al.  Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.

[12]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[13]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[14]  Wen-Zhan Song,et al.  The spanning ratios of -Skeletons , 2003 .

[15]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[16]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[17]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[18]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[19]  Franco P. Preparata,et al.  Sequencing-by-hybridization revisited: the analog-spectrum proposal , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[20]  David Eppstein.  Beta-skeletons have unbounded dilation , 2002, Comput. Geom..

[21]  Gruia Calinescu.  Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks , 2003, ADHOC-NOW.

[22]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[23]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[25]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[26]  Tamás Lukovszki,et al.  New results on geometric spanners and their applications , 1999 .

[27]  Jyrki Katajaien,et al.  The region approach for computing relative neighborhood graphs in the L p metric , 1988 .

[28]  Xiang-Yang Li,et al.  Efficient localized routing for wireless ad hoc networks , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[29]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[30]  Tamás Lukovszki,et al.  Partitioned neighborhood spanners of minimal outdegree , 1999, CCCG.

[31]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[32]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[33]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

[34]  Paul Chew,et al.  There is a planar graph almost as good as the complete graph , 1986, SCG '86.

[35]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[36]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..

[37]  Jyrki Katajainen.  The region approach for computing relative neighbourhood graphs in the Lp metric , 2005, Computing.

[38]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[39]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[40]  Xiang-Yang Li,et al.  Efficient Construction of Low Weight Bounded Degree Planar Spanner , 2003, COCOON.

[41]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[42]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[43]  Limin Hu,et al.  Topology control for multihop packet radio networks , 1993, IEEE Trans. Commun..