A simple randomized k-local election algorithm for local computations

Abstract

Most of distributed algorithms encoded by means of local computations [3] need to solve k-local election problems to ensure a faithful relabeling of disjoint subgraphs. Due to a result stated in [1], it is not possible to solve the k-local election problem for k ≥ 3 in anonymous networks. Based on distributed computations of rooted trees of minimal paths, we present in this paper a simple randomized algorithm which, with very high probability, solves the k-local election problem (k ≥ 2) in an anonymous graph. © Springer-Verlag Berlin Heidelberg 2005.