A note on leader election in directed split-stars and directed alternating group graphs

作者：Wang Fu Hsing^*

来源：International Journal of Computer Mathematics, 2010, 87(11): 2450-2457.

DOI：10.1080/00207160802676554

• leader election problem
• anonymous networks
• split-stars
• alternating group graphs
• self-stabilizing algorithms

A leader node is defined to be any node of the network unambiguously identified by some characteristics. In this paper, we first present a distributed algorithm for finding a leader node of a directed split-star. Moreover, an efficient self-stabilizing leader election algorithm that converges with linear rounds is proposed for directed split-stars. Actually, the distributed algorithm and the self-stabilizing algorithm are also applicable to the problem of directed alternating group graphs. As far as we know, no self-stabilizing leader election algorithm was known for the two graphs.

• 出版日期2010