Abstract
We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node v knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from v. Apart from that, each node knows only the maximum degree Δ of the network and the number n of nodes. One node of the network, called the source, has a message which has to reach all other nodes. We adopt the widely studied communication model called the one-way model in which, in every round, each node can communicate with at most one neighbor, and in each pair of nodes communicating in a given round, one can only send a message while the other can only receive it. This is the weakest of all store-and-forward models for point-to-point networks, and hence our algorithms work for other models as well in at most the same time.
We show tradeoffs between knowledge radius and time of deterministic broadcasting, when knowledge radius is small, i.e., when nodes are only aware of their close vicinity. While for knowledge radius 0, minimum broadcasting time is θ(e), where e is the number of edges in the network, broadcasting can be usually completed faster for positive knowledge radius. Our main results concern knowledge radii 1 and 2. We develop fast broadcasting algorithms and analyze their execution time. We also prove lower bounds on broadcasting time, showing that our algorithms are close to optimal, for a given knowledge radius. For knowledge radius 1 we develop a broadcasting algorithm working in time O(min(n, D 2 Δ)), where n is the number of nodes, D is the diameter of the network, and Δ is the maximum degree. We show that for bounded maximum degree Δ this algorithm is asymptotically optimal. For knowledge radius 2 we show how to broadcast in time O(DΔ log n)) and prove a lower bound Ω(DΔ) on broadcasting time, when DΔ ∈ O(n). This lower bound is valid for any constant knowledge radius. For knowledge radius log* n+3 we show how to broadcast in time O(DΔ). Finally, for any knowledge radius r, we show a broadcasting algorithm working in time O(D 2 Δ/r).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Albers and M. R. Henzinger, Exploring unknown environments, Proc. 29th Symp. on Theory of Computing (1997), 416–425.
B. Awerbuch, A new distributed depth-first-search algorithm, Information Processing Letters 20 (1985), 147–150.
B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A Tradeoff Between Information and Communication in Broadcast Protocols, J. ACM 37, (1990), 238–256.
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 Symp. on Principles of Distr. Comp. (1987), 98–108.
B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter, Deterministic broadcasting in unknown radio networks, Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’2000), 861–870.
G. De Marco and A. Pelc, Fast distributed graph coloring with O(Δ) colors, manuscript.
K. Diks, E. Kranakis, D. Krizanc and A. Pelc, The impact of knowledge on broadcasting time in radio networks, Proc. 7th Annual European Symposium on Algorithms, ESA’99, Prague, Czech Republic, July 1999, LNCS 1643, 41–52.
D. Z. Du and F. H. Hwang, Combinatorial group testing and its applications, World Scientific, Singapore, 1993.
S. Even and B. Monien, On the number of rounds necessary to disseminate information, Proc. 1st ACM Symp. on Par. Alg. and Arch., June 1989, 318–327.
U. Feige, D. Peleg, P. Raghavan and E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (1990), 447–460.
P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79–133.
P. Fraigniaud, A. Pelc, D. Peleg and S. Perennes, Assigning labels in unknown anonymous networks, Proc. 19th ACM Symp. on Principles of Distributed Computing (PODC’2000), July 2000, Portland, Oregon, U.S.A., 101–112.
L. Gargano, A. Pelc, S. Perennes and U. Vaccaro, Efficient communication in unknown networks, Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’2000), June 2000, Konstanz, Germany, to appear.
L. Gasieniec and A. Pelc, Broadcasting with a bounded fraction of faulty nodes, Journal of Parallel and Distributed Computing 42 (1997), 11–20.
S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman, A survey of Gossiping and Broadcasting in Communication Networks, Networks 18 (1988), 319–349.
J. Komlós and A. G. Greenberg, An asymptotically nonadaptive algorithm for con ict resolution in multiple-access channels, IEEE Trans. on Information Theory, IT-31 n. 2 (1985), 302–306.
D.W. Krumme, Fast gossiping for the hypercube, SIAM J. Computing 21 (1992), 365–380.
N. Linial, Locality in distributed graph algorithms, SIAM J. Computing 21 (1992), 193–201.
P. Panaite and A. Pelc, Exploring unknown undirected graphs, Proc. 9th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’98), 316–322.
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
De Marco, G., Pelc, A. (2000). Deterministic Broadcasting Time with Partial Knowledge of the Network. 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_32
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_32
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