@inproceedings{Fusco2008BroadcastingIU,
author={Emanuele G. Fusco and Andrzej Pelc},
booktitle={DISC},
year={2008}
}
• Published in DISC 22 September 2008
• Computer Science
We study broadcasting time in radio networks, modeled as unit disk graphs (UDG). Emek et al. showed that broadcasting time depends on two parameters of the UDG network, namely, its diameter D(in hops) and its granularityg. The latter is the inverse of the densitydof the network which is the minimum Euclidean distance between any two stations. They proved that the minimum broadcasting time is $\Theta \left( \min\left\{ D + g^2, D \log{g} \right\} \right)$, assuming that each node knows the…

## References

SHOWING 1-10 OF 37 REFERENCES
• Computer Science
Distributed Computing
• 2002
For the model with collision detection, efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs are developed and it is shown that broadcasting with acknowledgement is not possible in this model at all.
• Computer Science
PODC '07
• 2007
A deterministic broadcasting algorithm is presented which works in time O (Dg) under the conditional wake up model and it is proved that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than $${\Omega (D \sqrt{g})}$$ .
• Computer Science
SIAM J. Comput.
• 2004
An algorithm is constructed that broadcasts in logarithmic time on all graphs from the Bar-Yehuda, Goldreich, and Itai paper (BGI), giving the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting.
• Computer Science
SODA '00
• 2000
This work considers the problem of distributed deterministic broadcasting in radio networks of unknown topology and size, and develops a linear-time broadcasting algorithm for symmetric graphs, which is optimal and develops efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs.
• Computer Science
ESA
• 1999
These are the first results concerning broadcasting algorithms that are distributed and deterministic at the same time and it is shown that in this case the amount of knowledge available to nodes influences the efficiency of broadcasting in a significant way.
• Computer Science
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
• 2003
An optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log/sup 2/n), with high probability is described, and a deterministic oblivious algorithm is described that completes broadcasting in almost optimal time O(n log/Sup 2/D).
• Computer Science
ICALP
• 2000
Three new deterministic distributed algorithms are developed for broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes, and one of these algorithms improves the performance for general networks running in time O(n3/2).