Abstract
We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step.
The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n 11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n 1.77291) = O(n 9/5), for general networks, and in time O(n 1+a+H(a)+0(1)) for sparse networks with in-degrees O(n a) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n 3/2 log1/2 n) for general networks or O(n 1+a+0(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n 3/2).
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.
N. Alon, A. Bar-Noy, N. Linial and D. Peleg, Single round simulation of radio networks, Journal of Algorithms 13 (1992) 188–210.
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–72.
R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992) 104–126.
R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993) 875–887.
B.S. Chlebus, L. Gcasieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861–870.
I. Chlamtac and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (1985) 1240–1246.
K. Diks, E. Kranakis, D. Krizanc and A. Pelc, The impact of knowledge on broadcasting time in radio networks, in Proc. 7th European Symposium on Algorithms, Prague, Czech Republic, 1999, Springer LNCS 1643, pp. 41–52.
I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 577–585.
R. Gallager, A perspective on multiaccess channels, IEEE Trans. on Information Theory 31 (1985) 124–142.
L.A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson, A bound on the capacity of backoff and acknowledgement-based protocols, in this volume of Springer LNCS.
E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, in Proc. 6th European Symposium on Algorithms, Venice, Italy, 1998, Springer LNCS 1461, pp. 283–294.
E. Kushilevitz and Y. Mansour, An Ω(Dlg(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998) 702–712.
E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236–243.
K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.
A. Sen and M. L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Ann. Joint Conference of the IEEE Computer and Communication Societies, 1996, pp. 1116–1124.
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
Chlebus, B.S., Gçasieniec, L., Östlin, A., Robson, J.M. (2000). Deterministic Radio Broadcasting. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_60
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive