Abstract
The main contribution of this work is to propose energy- efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in \( O(\frac{n} {k} + \log n) \) time slots, with no station being awake for more than O(log n) time slots.
Work supported in part by ONR grant N00014-91-1-0526 and by Grant-in-Aid for Scientific Research (C) (10680351) 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
N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, Single-round simulation on radio networks, Journal of Algorithms, 13, (1992), 188–210.
R. Dechter and L. Kleinrock, Broadcast communication and distributed algorithms, IEEE Transactions on Computers, C-35, (1986), 210–219.
T. Hayashi, K. Nakano, and S. Olariu, Randomized initialization protocols for Packet Radio Networks, Proc. 13th International Parallel Processing Symposium, (1999), 544–548.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
S. Murthy and J. J. Garcia-Luna-Aceves, A routing protocol for packet radio networks, Proc. First Annual ACM Conference on Mobile Computing and Networking, Berkeley, California, 1995, 86–95.
K. Nakano, Optimal initializing algorithms for a reconfigurable mesh, Journal of Parallel and Distributed Computing, 24, (1995), 218–223.
K. Nakano, Optimal sorting algorithms on bus-connected processor arrays, IEICE Transactions Fundamentals, E-76A, 11, (1994), 2008–2015.
K. Nakano, S. Olariu, and J. L. Schwing, Broadcast-efficient protocols for ad-hoc radio networks with few channels, IEEE Transactions on parallel and Distributed Systems, to appear.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordim, J.L., Cui, J., Hayashi, T., Nakano, K., Olariu, S. (1999). Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive