This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks
October 2003 (vol. 14 no. 10)
pp. 1035-1047

Abstract—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 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] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks Mobile Computing, T. Imielinski and H.F. Korth, eds., vol. 353, Kluwer Academic, 1996.
[2] S. Murthy and J. Garcia-Luna-Aceves, An Efficient Routing Protocol for Wireless Networks ACM Mobile Networks and Applications J., Special issue on Routing in Mobile Comm. Networks, vol. 1, no. 2, 1996.
[3] V. Park and S. Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Proc. 18th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 1405-1414, Apr. 1997.
[4] C. Perkins, Ad-Hoc On-Demand Distance Vector Routing Proc. MILCOM, Nov. 1997.
[5] C. Perkins and P. Bhagwat, Highly Dynamic Destination-Sequenced Distance-Vector Routing Proc. ACM SIGCOMM, Oct. 1994.
[6] R. Sivakumar, P. Sinha, and V. Bharghavan, CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm IEEE J. Selected Areas in Comm., special issue on ad-hoc routing, vol. 17, no. 8, pp. 1454-1465, 1999.
[7] E.M. Royer and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm., pp. 46-55, Apr. 1999.
[8] S. Ramanathan and M. Steenstrup, A Survey of Routing Techniques for Mobile Communication Networks ACM/Baltzer Mobile Networks and Applications, pp. 89-104, 1996.
[9] P. Bose and P. Morin, Online Routing in Triangulations Proc. 10th Ann. Int'l Symp. Algorithms and Computation, 1999.
[10] I. Stojmenovic and X. Lin, Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, 2001.
[11] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, Routing with Guaranteed Delivery in Ad Hoc Wireless Networks ACM/Kluwer Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001, Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 48-55, 1999.
[12] B. Karp and H.T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, 2000.
[13] L. Barrire, P. Fraigniaud, and L. Narayanan, Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 19-27, 2001.
[14] P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, On the Spanning Ratio of Gabriel Graphs and Beta-Skeletons Proc. Latin Am. Theoretical Informatics Conf., 2002.
[15] D. Eppstein, Beta-Skeletons Have Unbounded Dilation Technical Report ICS-TR-96-15, Univ. of California, Irvine, 1996.
[16] X.-Y. Li, G. Calinescu, and P.-J. Wan, Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Socs. (INFOCOM), vol. 3, 2002.
[17] J. Gao, L.J. Guibas, J. Hershburger, L. Zhang, and A. Zhu, Geometric Spanner for Routing in Mobile Networks Proc. Second ACM Symp. Mobile Ad Hoc Networking and Computing, 2001.
[18] L. Hu, Topology Control for Multihop Packet Radio Networks IEEE Trans. Comm., vol 41, no. 10, pp. 1474-1481, 1993.
[19] X.-Y. Li, I. Stojmenovic, and Y. Wang, Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Multihop Scatternet Formation IEEE Trans. Parallel and Distributed Systems, 2003.
[20] E. Kranakis, H. Singh, and J. Urrutia, Compass Routing on Geometric Networks Proc. 11th Canadian Conf. Computational Geometry, pp. 51-54, 1999.
[21] A.C.-C. Yao, On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems SIAM J. Computing, vol. 11, pp. 721-736, 1982.
[22] J.M. Keil and C.A. Gutwin, Classes of Graphs which Approximate the Complete Euclidean Graph Discrete Compuational Geometry, vol. 7, pp. 13-28, 1992.
[23] F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
[24] D.P. Dobkin, S.J. Friedman, and K.J. Supowit, Delaunay Graphs are Almost as Good as Complete Graphs Discrete Computational Geometry, pp. 399-407, 1990.
[25] J.M. Keil and C.A. Gutwin, The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph Proc. First Workshop Algorithms Data Structure, 1989.
[26] P.L. Chew, There is a Planar Graph as Good as the Complete Graph Proc. Second Symp. Computational Geometry, pp. 169-177, 1986.
[27] X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, Sparse Power Efficient Topology for Wireless Networks J. Parallel and Distributed Computing, 2002.
[28] K.R. Gabriel and R.R. Sokal, A New Statistical Approach to Geographic Variation Analysis Systematic Zoology, vol. 18, pp. 259-278, 1969.
[29] J. Katajainen, The Region Approach for Computing Relative Neighborhood Graphs in the lp Metric Computing, vol. 40, pp. 147-161, 1988.
[30] G.T. Toussaint, The Relative Neighborhood Graph of a Finite Planar Set Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
[31] W.Z. Wang, X.-Y. Li, K. Moaveninejad, Y. Wang, and W.-Z. Song, The Spanning Ratios of$\beta{\hbox{-}}{\rm{Skeletons}}$ Proc. Canadian Conf. Computational Geometry, 2003.
[32] T. Lukovszki, New Results on Geometric Spanners and Their Applications PhD thesis, Univ. of Paderborn, 1999.
[33] M. Fischer, T. Lukovszki, and M. Ziegler, Partitioned Neighborhood Spanners of Minimal Outdegree technical report, Heinz Nixdore Inst., Germany, 1999.
[34] P. Bose, A. Brodnik, S Carlsson, E.D. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, and J.I. Munro, Online Routing in Convex Subdivisions Proc. Int'l Symp. Algorithms and Computation, pp. 47-59, 2000.
[35] G. Calinescu, Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. 2002.
[36] X.-Y. Li, P.-J. Wan, and O. Frieder, Coverage in Wireless Ad-Hoc Sensor Networks IEEE Trans. Computers, vol. 52, no. 6, pp. 753-763, 2003.
[37] X.-Y. Li, Y. Wang, and O. Frieder, Efficient Localized Routing for Wireless Ad Hoc Networks Proc. IEEE Int'l Conf. Comm., 2003.
[38] S. Datta, I. Stojmenovic, and J. Wu, “Internal Nodes and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks,” Cluster Computing, 2001.
[39] X.-Y. Li and Y. Wang, Efficient Construction of Low Weight Bounded Degree Spanner Proc. Int'l Computing and Combinatorics Conf., 2003.
[40] Y. Wang and X.-Y. Li, Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks submitted for publication, 2003.

Index Terms:
Delaunay triangulation, localized method, planar, routing, spanner, topology control, wireless networks.
Citation:
Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang, "Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 10, pp. 1035-1047, Oct. 2003, doi:10.1109/TPDS.2003.1239871
Usage of this product signifies your acceptance of the Terms of Use.