Propagation and leader election in a multihop broadcast environment
The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time.
It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.
KeywordsBroadcast networks distributed leader election
Unable to display preview. Download preview PDF.
- 1.B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. Proc. 19th Symp. on Theory of Computing, pages 230–240, May 1987.Google Scholar
- 3.A. Ben-David and M. Sidi. Collision resolution algorithms in multi-station packet radio network. IEEE Journal on Selected Areas in Communications, November 1983.Google Scholar
- 4.F. Chin and H.F. Ting. An almost linear time and o(vlogv+e) message distributed algorithm for minimum weight spanning trees. Proceedings of Foundations Of Computer Science (FOCS), October 1985.Google Scholar
- 6.I. Cidon and O. Mokryn. Distributed algorithms in a multihop broadcast environment. Technical Report — Center for Communication and Information Technologies, Technion, no. 241, 1998.Google Scholar
- 8.M. Faloutsos and M. Molle. Optimal distributed algorithms for minimum spanning trees revisited. ACM Symp. on Principles of Distributed Computing, pages 231–237, May 1995.Google Scholar
- 10.J.A. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, pages 302–316, 1998.Google Scholar