Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Fast gossiping for the hypercube
SIAM Journal on Computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Broadcasting with a bounded fraction of faulty nodes
Journal of Parallel and Distributed Computing
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
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, D2Δ)), 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(D2Δ/r).