This Article 
 Bibliographic References 
 Add to: 
New Memoryless Online Routing Algorithms for Delaunay Triangulations
Aug. 2012 (vol. 23 no. 8)
pp. 1520-1527
Weisheng Si, University of Western Sydney and National ICT Australia
Albert Y. Zomaya, University of Sydney, Sydney
Memoryless online routing (MOR) algorithms are suitable for the applications only using local information to find paths, and Delaunay triangulations (DTs) are the class of geometric graphs widely proposed as network topologies. Motivated by these two facts, this paper reports a variety of new MOR algorithms that work for Delaunay triangulations, thus greatly enriching the family of such algorithms. This paper also evaluates and compares these new algorithms with three existing MOR algorithms. The experimental results shed light on their performance in terms of both Euclidean and link metrics, and also reveal certain properties of Delaunay triangulations. Finally, this paper poses three open problems, with their importance explained.

[1] P. Bose and P. Morin, "Online Routing in Triangulations," SIAM J. Computing, vol. 33, pp. 937-951, 2004.
[2] 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," Int'l J. Computational Geometry, vol. 12, pp. 283-295, 2002.
[3] P. Bose and P. Morin, "Competitive Online Routing in Geometric Graphs," Theoretical Computer Science: Special Issue: In Memoriam, vol. 324, pp. 273-288, 2004.
[4] D. Chen, L. Devroye, V. Dujmovic, and P. Morin, "Memoryless Routing in Convex Subdivisions: Random Walks are Optimal,", 2009.
[5] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric Ad-Hoc Routing: Of Theory and Practice," Proc. ACM 22nd Ann. Symp. Principles of Distributed Computing (PODC), pp. 63-72, 2003.
[6] P. Bose, P. Carmi, and S. Durocher, "Bounding the Locality of Distributed Routing Algorithms," Proc. ACM 28th Symp. Principles of Distributed Computing (PODC), pp. 250-259, 2009.
[7] E. Kranakis, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks," Proc. Canadian Conf. Computational Geometry, pp. 51-54, 1999.
[8] P. Cucka, N.S. Netanyahu, and A. Rosenfeld, "Learning in Navigation: Goal Finding in Graphs," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 10, pp. 429-446, 1996.
[9] J. O'Rourke, Computational Geometry in C, second ed. Cambridge Univ. Press, 1998.
[10] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric Spanners for Routing in Mobile Networks," IEEE J. Selected Areas in Comm., vol. 23, no. 1, pp. 174-185, Jan. 2005.
[11] X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, "Localized Delaunay Triangulation with Applications in Wireless Ad Hoc Networks," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1035-1047, Oct. 2003.
[12] J. Liebeherr, M. Nahas, and W. Si, "Application-Layer Multicasting with Delaunay Triangulation Overlays," IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1472-1488, Oct. 2002.
[13] Y. Wang and X.-Y. Li, "Efficient Delaunay-Based Localized Routing for Wireless Sensor Networks," Int'l J. Comm. Systems, vol. 20, pp. 767-789, 2007.
[14] W. Si, A.Y. Zomaya, and S. Selvakennedy, "A Geometric Deployment and Routing Scheme for Directional Wireless Mesh Networks," IEEE Trans. Computers, in press, 2011.
[15] M.d. Berg, M.v. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, second ed. Springer, 2000.
[16] P. Bose, L. Devroye, M. Loffler, J. Snoeyink, and V. Verma, "The Spanning Ratio of the Delaunay Triangulation is Greater than Pi/2," Proc. Canadian Conf. Computational Geometry, pp. 1-3, 2009.
[17] G. Xia, "Improved Upper Bound on the Stretch Factor of Delaunay Triangulations," Proc. 27th Ann. Symp. Computational Geometry, pp. 264-273, 2011.
[18] W. Si and A.Y. Zomaya, "Midpoint Routing Algorithms for Delaunay Triangulations," Proc. IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS), pp. 1-7, 2010.
[19] Y. Zou and K. Chakrabarty, "Sensor Deployment and Target Localization Based on Virtual Forces," Proc. IEEE INFOCOM, pp. 1293-1303, 2003.
[20] B. Leong, S. Mitra, and B. Liskov, "Path Vector Face Routing: Geographic Routing with Local Face Information," Proc. IEEE 13th Int'l Conf. Network Protocols (ICNP), pp. 147-158, 2005.
[21] S. Cui, I.A. Kanj, and G. Xia, "On the Dilation of Delaunay Triangulations of Points in Convex Position," Proc. Canadian Conf. Computational Geometry, pp. 51-54, 2009.
[22] K. Alzoubi, X.Y. Li, Y. Wang, P.J. Wan, and O. Frieder, "Geometric Spanners for Wireless Ad Hoc Networks," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 408-421, Apr. 2003.
[23] J.R. Shewchuk, Triangle Version 1.6. , 2005.

Index Terms:
Geometric (geographic) routing, online routing, shortest paths, Delaunay triangulations.
Weisheng Si, Albert Y. Zomaya, "New Memoryless Online Routing Algorithms for Delaunay Triangulations," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 8, pp. 1520-1527, Aug. 2012, doi:10.1109/TPDS.2011.301
Usage of this product signifies your acceptance of the Terms of Use.