MINIMUM SPANNING TREE ALGORITHM: DESIGN AND ANALYSIS (original) (raw)

In this paper, we introduce and analyze a probabilistic distributed algorithm for a construction of a minimum spanning tree on network. This algorithm is based on the handshake concept. Firstly, each network node is considered as a spanning sub-tree. And at each round of the execution of our algorithm, spanning sub-trees are merged. The execution continues until all spanning sub-trees are merged into one. We proof that spanning tree obtained is minimal and characterize the expected number of phases required to reduce the number of spanning tree form n to 1. We show that this expected number is bounded between O(log2(n)) and O(n). Keywords- Spanning tree, Distributed Algorithm, Handshake Algorithm, Matching, Probabilistic Analysis.