Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs
复制标题
任意通信图群体协议中的自稳定领导者选举
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Janna Burman
中科院分区：
文献类型：
--
作者：
J. Beauquier;Peva Blanchard;Janna Burman
本文研究了种群协议模型中的自稳定领导者选举问题。在这个模型中，一个未知数量的异步，匿名和有限状态的移动的代理在一个给定的通信图中进行交互。$mathcal{SSLE}$在原始模型中已被证明是不可能的。这种不可能性可以通过一种模块化技术来规避，该技术通过一个oracle来增强系统-一个外部模块抽象出关于系统的附加假设。Fischer和Jiang已经提出了$mathcal{SSLE}$的解决方案，用于完全通信图和环，使用oracle Ω？，称为最终领导者检测器。在这项工作中，我们提出了一个解决方案的任意图，使用的组合的两个副本的Ω？。我们还证明了困难来自自稳定的要求，通过给任意图的解决方案，没有预言，当一个一致的初始化是允许的。最后，我们证明了Ω？使用$mathcal{SSLE}$，在某种意义上，我们精确定义。
This paper considers the fundamental problem of self-stabilizing leader election ( $mathcal{SSLE}$ ) in the model of population protocols. In this model, an unknown number of asynchronous, anonymous and finite state mobile agents interact in pairs over a given communication graph. $mathcal{SSLE}$ has been shown to be impossible in the original model. This impossibility can been circumvented by a modular technique augmenting the system with an oracle - an external module abstracting the added assumption about the system. Fischer and Jiang have proposed solutions to $mathcal{SSLE}$ , for complete communication graphs and rings, using an oracle Ω?, called the eventual leader detector. In this work, we present a solution for arbitrary graphs, using a composition of two copies of Ω?. We also prove that the difficulty comes from the requirement of self-stabilization, by giving a solution without oracle for arbitrary graphs, when an uniform initialization is allowed. Finally, we prove that there is no self-stabilizing implementation of Ω? using $mathcal{SSLE}$ , in a sense we define precisely.