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
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Faster broadcasting in unknown radio networks
Information Processing Letters
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
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
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Threshold of Broadcast in Random Graphs
Threshold of Broadcast in Random Graphs
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
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
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
Average-Time complexity of gossiping in radio networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
| 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 Gp=(V,E) of size n=|V| and expected average degree d=pn in time O(ln n/lnd+lnd). Later we present a randomized distributed broadcasting algorithm with the running time O(ln n). 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 in random graphs which may be of independent interest. We should note here that the results of this paper hold with probability 1-o(1/n).