A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(2) moves with high probability, under the adversarial distributed daemon. Among all adversarial distributed daemons and with the anonymous assumption, our algorithm provides the best known complexity. Moreover, the previous best known algorithm working under the same daemon and using identity has a O(m) complexity leading to the same order of growth than our anonymous algorithm. Finally, we do not make the common assumption that a node can determine whether one of its neighbors points to it or to another node, and still we present a solution with the same asymptotic behavior.