Abstract
This paper studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identifiers, we go a step further and explore a natural 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm that constructs a Delaunay graph from any initial connected topology and in a distributed manner. This algorithm terminates in time O(n 3) in the worst-case. We believe that such self-stabilizing Delaunay networks have interesting applications and give insights into the necessary geometric reasoning that is required for higher-dimensional linearization problems.
Research supported by the DFG project SCHE 1592/1-1. Due to space constraints, many proofs and simulation results are only presented in the technical report [9].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Varghese, G.: Distributed program checking: A paradigm for building self-stabilizing distributed protocols. In: Proc. FOCS, pp. 258–267 (1991)
Berg, M.d., Cheong, O., Kreveld, M.v., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008)
Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: A self-stabilizing deterministic skip list. In: Proc. SSS (2008)
Dijkstra, E.: Self-stabilization in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 4, 1–40 (1997)
Gafni, E.M., Bertsekas, D.P.: Asymptotic optimality of shortest path routing algorithms. IEEE Trans. Inf. Theor. 33(1), 83–90 (1987)
Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: Brief announcement: On the time complexity of distributed topological self-stabilization. In: Proc. SSS (2009)
Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proc. PODC (2009)
Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A self-stabilizing and local delaunay graph construction. Tech. Report TR-TI-09-307, University of Paderborn (2009)
Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: Proc. INFOCOM (2002)
Onus, M., Richa, A., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: Proc. ALENEX (2007)
Stojmenovic, I.: Handbook of Wireless Networks and Mobile Computing. Wiley, Chichester (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacob, R., Ritscher, S., Scheideler, C., Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_78
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)