Abstract
The main contribution of this work is to propose efficient randomized leader election protocols in Packet Radio Networks (PRN). We show that in a one-channel PRN a leader can be elected among n identical stations in O(log log n) broadcast rounds with probability at least 1 - O(1/log n) or in O(log n) broadcast rounds with probability at least 1 - O(1/n). We begin by designing such a protocol for the case where the number n of stations is known beforehand. Next, we show that the leader election can be completed within the same number of broadcast rounds even if n is not known. We show that our protocols are optimal in the sense that no randomized protocol that terminates in o(log n) rounds can elect a leader with probability higher than 1 - O(1/n) and no randomized protocol that terminates in o(log log n) rounds can elect a leader with probability higher than 1 - O(1/log n).
Work supported in part by the National Science Foundation under grant CCR-9522093, and by ONR grant N00014-97-1-0526.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Bentley and A. Yao, An almost optimal algorithm for unbounded search, Information Processing Letters, 5, (1976),:82–87.
D. Bertzekas and R. Gallager, Data Networks, Second Edition, Prentice-Hall, 1992.
R. Bar-Yehuda, O. Goldreich, and A. Itai, Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection, Distributed Computing, 5, (1991), 67–71.
J. I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Transactions on Information Theory, IT-25, (1979), 505–515.
I. Chlamtac and S. Kutten, Tree-based broadcasting in multihop radio networks, IEEE Transaction on Computers, C-36, (1987), 1209–1223.
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
R. M. Metcalfe and D. R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, 19, (1976), 395–404.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
D. E. Willard, Log-logarithmic selection resolution protocols in a multiple access channel, SIAM Journal on Computing, 15, (1986), 468–477.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakano, K., Olariu, S. (1998). Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive