Dynamic Delaunay Triangulation for Wireless Ad Hoc Network
Geometric routing protocols benefit from localized Delaunay triangulation, which can guarantee the delivery of packet and bound the length of route. In this paper we propose a localized algorithm to build Delaunay triangulation in wireless ad hoc network. The algorithm considers not only stationary situation but also dynamic situation in which nodes can dynamically join and leave the network. The communication cost of the algorithm is O(nlogn). Therefore, our algorithm is applicable in wireless sensor network, in which nodes dynamically join and leave network. We also prove the correctness of the algorithm.
KeywordsTopology control ad hoc network Delaunay Triangulation geometric routing protocols
Unable to display preview. Download preview PDF.
- 4.Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. In: MobiHoc 2001 (2001)Google Scholar
- 5.Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of a planar spanner and routing for ad hoc wireless networks. In: IEEE Infocom 2002, New York (June 2002)Google Scholar
- 7.Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Discrete Computational Geometry 7 (1992)Google Scholar
- 8.Keil, J.M., Gutwin, C.A.: The Delaunay triangulation closely approximates the complete euclidean graph. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol. 382. Springer, Heidelberg (1989)Google Scholar
- 9.Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Computational Geometry (1990)Google Scholar
- 10.Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: Proc. 11th Canadian Conference on Computational Geometry, pp. 51–54 (1999)Google Scholar
- 12.Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks 7(6), 609–616 (2001); 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, pp. 48–55 (1999) zbMATHCrossRefGoogle Scholar