Loosely-stabilizing leader election with polylogarithmic convergence time
Loosely-stabilizing leader election with polylogarithmic convergence time
复制标题
具有多对数收敛时间的松散稳定领导者选举
DOI:
10.1016/j.tcs.2019.09.034
复制
发表时间:
2020
影响因子:
1.1
通讯作者:
Larmore Lawrence L.
中科院分区:
文献类型:
--
作者:
Sudo Yuichi;Ooshita Fukuhito;Kakugawa Hirotsugu;Masuzawa Toshimitsu;Datta Ajoy K.;Larmore Lawrence L.
A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper. In the population protocol model, which is a common abstract model of mobile sensor networks, it is known to be impossible to design a self-stabilizing leader election protocol unless the exact number of agents is knowna priori. Thus, in our prior work, we introduced concept of loose-stabilization, which is weaker than self-stabilization but has similar advantage in practice. Following this work, several loosely-stabilizing leader election protocols have been given. Loosely-stabilizing leader election guarantees that, starting from an arbitrary configuration, the system reaches a safe configuration with a single leader within a short time, and keeps the unique leader for a long time thereafter. The convergence times of all existing loosely-stabilizing protocols,i.e., the expected times to reach a safe configuration, are polynomial innwherenis the number of nodes, while their holding times,i.e., the expected times to keep the unique leader after reaching a safe configuration, are exponential inn. In this paper, a loosely-stabilizing protocol with polylogarithmic convergence time is presented. Its holding time is not exponential, rather an arbitrarily large polynomial function ofn.