Sciweavers

Share
IPPS
2005
IEEE

Self-Stabilizing Anonymous Leader Election in a Tree

9 years 4 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non leaf node (starting from the same initial state) depending on the behavior of the daemon. The protocol generalizes the result in [1] and at the same time is much simpler and terminates in polynomial number of moves.
Zhenyu Xu, Pradip K. Srimani
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where IPPS
Authors Zhenyu Xu, Pradip K. Srimani
Comments (0)
books