Abstract
We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated on the plane, at grid points of a square or hexagonal mesh. Nodes send messages in synchronous time slots. Each node v has a given transmission range of the same radius R. 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. Faulty nodes do not receive or send any messages.
We give broadcasting algorithms whose worst-case running time has optimal order of magnitude, and we prove corresponding lower bounds. In case of nonadaptive algorithms this order of magnitude is Θ(D + t), and for adaptive algorithms it is Θ(D + log(min(R, t))), where t is an upper bound on the number of faults in the network and D is the diameter of the fault-free part of the network that can be reached from the source as a result of those faults.
Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grant.
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, 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. Gaber and Y. Mansour, Broadcast in Radio Networks, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA’95, 577–585.
E. Kushilevitz and Y. Mansour, An Ω(D log 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. ACM-SIAM Symp. on Discrete Algorithms, SODA’98, 236–243.
E. Pagani and G. P. Rossi, Reliable Broadcast in Mobile Multihop Packet Networks, Proc. 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’97), (1997), 34–42.
K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, New York, 1995.
A. Pelc, Fault-Tolerant Broadcasting and Gossiping in Communication Networks, Networks 28 (1996), 143–156.
K. Ravishankar and S. Singh, Asymptotically Optimal Gossiping in Radio Networks, Discrete Applied Mathematics 61 (1995), 61–82.
A. Sen and M. L. Huson, A New Model for Scheduling Packet Radio Networks, Proc. 15th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM’96) (1996), 1116–1124.
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
Kranakis, E., Krizanc, D., Pelc, A. (1998). Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive