Abstract
The main contribution of this work is to propose energyeffcient randomized leader election protocols for single-hop, single-channel radio networks (RN) that do not have collision detection (CD) capabilities. We first presents a leader election protocol for the case the number n of stations is known beforehand. The protocol runs in O(log f) time slots with no station being awake for more than O(log log f + log f/log n ) time slots with probability at least 1 -1/f for any f ≥ 1. We then present three leader election protocols for the case where n is not known beforehand. The first protocol terminates, with probability exceeding 1 -1/f , in O((log n) 2 + (log f) 2 ) time slots, with no station being awake for more than O(log n +log f) time slots. Clearly, this first protocol terminates in O((log n) 2 ) expected time slots. Our second protocol reduces the expected termination time to O(log n) time slots. This second protocol terminates, with probability exceeding 1 -1/f in O(f 3/5 log n) time slots. Finally, by combining these two protocols, we obtain a third leader election protocol that terminates in O(log n) expected time slots. This latter protocol terminates, with with probability exceeding 1 -1/f , in O(min((log n) 2 + (log f) 2 ; f 3/5 log n)) time slots, with no station being awake for more than O(log n + log f) time slots.
Work supported in part by ONR grant N00014-91-1-0526 and by Grant-in-Aid for Encouragement of Young Scientists (12780213) from Ministry of Education, Science, Sports, and Culture of Japan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Feher, Wireless Digital Communications, Prentice-Hall, Upper Saddle River, NJ, 1995.
W. C. Fifer and F. J. Bruno, Low cost packet radio, Proceedings of the IEEE, 75, (1987), 33–42.
E. P. Harris and K. W. Warren, Low power technologies: a system perspective, Proc. 3-rd International Workshop on Multimedia Communications, Princeton, 1996.
T. Hayashi, K. Nakano, and S. Olariu, Randomized initialization protocols for Packet Radio Networks, Proc. 13th International Parallel Processing Symposium, (1999), 544–548.
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.
K. Nakano and S. Olariu, Randomized O(log log n)-round leader election protocols in Packet Radio Networks, Proc. of International Symposium on Algorithms and Computation, (LNCS 1533), 209–218, 1998.
K. Nakano and S. Olariu, Randomized Leader Election Protocols for Ad-hoc Networks to appear in Proc. of SCIROCCO (2000).
R. A. Powers, Batteries for low-power electronics, Proceedings of the IEEE, 83, (1995), 687–693.
A. K. Salkintzis and C. Chamzas, An in-band power-saving protocol for mobile data networks, IEEE Transactions on Communications, COM-46, (1998), 1194–1205.
K. Sivalingam, M. B. Srivastava, and P. Agrawal, Low power link and access protocols for wireless multimedia networks, Proc. IEEE Vehicular Technology Conference VTC’97, Phoenix, AZ, May, 1997.
M. Stemm, P. Gauthier, and D. Harada, Reducing power consumption on network interfaces in hand-held devices, Proc. 3-rd International Workshop on Multimedia Communications, Princeton, 1996.
J. E. Wieselthier, G. D. Nguyen, and A. Ephemerides, Multicasting in energylimited ad-hoc wireless networks, Proc. MILCOM’98, 1998.
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
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakano, K., Olariu, S. (2000). Randomized Leader Election Protocols in Radio Networks with no Collision Detection. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive