Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal on Computer and System Sciences, 45:104–126, 1992.
A. Ben-David and M. Sidi. Collision resolution algorithms in multi-station packet radio network. IEEE Journal on Selected Areas in Communications, November 1983.
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.
I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Transaction on Communications, COM-39(3):426–433, 1991.
I. Cidon and O. Mokryn. Distributed algorithms in a multihop broadcast environment. Technical Report — Center for Communication and Information Technologies, Technion, no. 241, 1998.
I. Cidon and M. Sidi. Distributed assignment algorithm for multihop packet radio networks. IEEE Transaction on Computers, 38(10):1353–1361, October 1989.
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.
R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transactions on Programming languages and Systems, 4(1):66–77, January 1983.
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.
M.A. Marsen and D. Roffinella. Multichannel local area network protocols. IEEE Journal on Selected Areas in Communications, SAC-1(5):885–897, November 1983.
A. Segall. Distributed network protocols. IEEE Transaction on Information Theory, IT-29(1):23–35, January 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cidon, I., Mokryn, O. (1998). Propagation and leader election in a multihop broadcast environment. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056477
Download citation
DOI: https://doi.org/10.1007/BFb0056477
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65066-9
Online ISBN: 978-3-540-49693-9
eBook Packages: Springer Book Archive