A guided tour of Chernoff bounds
Information Processing Letters
Discrete Applied Mathematics
Proceedings of the sixth 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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks
Information Processing Letters
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Threshold of Broadcast in Random Graphs
Threshold of Broadcast in Random Graphs
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Communication problems in random line-of-sight ad-hoc radio networks
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.00 |
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. We propose here several time efficient, centralized as well as fully distributed procedures for the broadcasting problem in random radio networks. In particular, we show how to perform a centralized broadcast in a random graph G"p=(V,E) of size n=|V| and expected average degree d=pn in time O(lnn/lnd+lnd). Later we present a randomized distributed broadcasting algorithm with the running time O(lnn). In both cases we show that the presented algorithms are asymptotically optimal by deriving lower bounds on the complexity of radio broadcasting in random graphs. In these proofs we determine some structural properties of random graphs and develop new techniques which might be useful for further research in this field. We should note here that the results of this paper hold with probability 1-o(1/n).