A Self-stabilizing and Local Delaunay Graph Construction [chapter]

Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
2009 Lecture Notes in Computer Science  
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
more » ... t-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] .
doi:10.1007/978-3-642-10631-6_78 fatcat:cn5mrvks2be5jjire42tr37czm