Abstract
We consider the problem of distributed deterministic broadcasting in radio networks. Nodes send messages in synchronous time-slots. Each node v has a given transmission range. All nodes located within this range can receive messages from v. However, a node situated in the range of two or more nodes that send messages simultaneously, cannot receive these messages and hears only noise. Each node knows only its own position and range, as well as the maximum of all ranges. Broadcasting is adaptive: Nodes can decide on the action to take on the basis of previously received messages, silence or noise.We prove a lower bound on broadcasting time in this model and construct a broadcasting protocol whose performance matches this bound for the simplest case when nodes are situated on a line and the network has constant depth.We also show that if nodes do not even know their own range, every broadcasting protocol must be hopelessly slow.
While distributed randomized broadcasting algorithms, and, on the other hand, deterministic off-line broadcasting algorithms assuming full knowledge of the radio network, have been extensively studied in the literature, ours are the first results concerning broadcasting algorithms that are distributed and deterministic at the same time.We show that in this case the amount of knowledge available to nodes influences the efficiency of broadcasting in a significant way.
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
N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A Lower Bound for Radio Broadcast, Journal of Computer and System Sciences 43 (1991), 290–298.
R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Proc. 6th ACM Symposium on Principles of Distributed Computing (1987), 98–108.
R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple Communication in Multi-Hop Radio Networks, Proc. 8th ACM Symposium on Principles of Distributed Computing (1989), 329–338.
I. Chlamtac and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (1985).
I. Gaber and Y. Mansour, Broadcast in Radio Networks, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA’95, 577–585.
E. Kranakis, D. Krizanc and A. Pelc, Fault-Tolerant Broadcasting in Radio Networks, Proc. 6th European Symp. on Algorithms, ESA’98,Venice, Italy, Aug. 1998, LNCS 1461, 283–294.
E. Kushilevitz and Y. Mansour, An Ω (Dlog n) Lower Bound for Broadcast in Radio Networks, Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing (1993), 65–73.
E. Kushilevitz and Y. Mansour, Computation in Noisy Radio Networks, Proc. 9th Ann.ACMSIAM Symp. on Discrete Algorithms, SODA’98, 236–243.
M. Li and P. Vitányi, Introduction to Kolmogorov Complexity and its Applications, Springer Verlag, 1993.
K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, NewYork, 1995.
A. Sen and M. L. Huson, A New Model for Scheduling Packet Radio Networks, Proc. 15th Ann. Joint Conf. of the IEEE Computer and Communication Societies (1996), 1116–1124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diks, K., Kranakis, E., Krizanc, D., Pelc, A. (1999). The Impact of Knowledge on Broadcasting Time in Radio Networks. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive