OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Theoretical Computer Science
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Silence is golden: self-stabilizing protocols communication-efficient after convergence
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Communication-Efficient self-stabilization in wireless networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.01 |
In this paper, our focus is to lower the communication complexity of self-stabilizing protocols below the need of checking every neighbor forever. Our contribution is threefold: (i) We provide new complexity measures for communication efficiency of self-stabilizing protocols, especially in the stabilized phase or when there are no faults, (ii) On the negative side, we show that for non-trivial problems such as coloring, maximal matching, and maximal independent set, it is impossible to get (deterministic or probabilistic) self-stabilizing solutions where every participant communicates with less than every neighbor in the stabilized phase, and (iii) On the positive side, we present protocols for maximal matching and maximal independent set such that a fraction of the participants communicates with exactly one neighbor in the stabilized phase.