A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Centralized broadcast in multihop radio networks
Journal of Algorithms
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
SIAM Journal on Discrete Mathematics
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast radio broadcasting with advice
Theoretical Computer Science
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The impact of mobility on the time complexity for deterministic broadcasting in radio networks
International Journal of Ad Hoc and Ubiquitous Computing
Efficient distributed communication in ad-hoc radio networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Leader election using loneliness detection
DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
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
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
The cost of radio network broadcast for different models of unreliable links
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributed deterministic broadcasting in wireless networks of weak devices
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D) + log2 n) in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. [1] and Kushilevitz and Mansour [16]. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai [3], running in expected time O(D log n + log2 n). (In fact, our result holds also in the setting of n-node directed radio networks of radius D.) For deterministic broadcasting, we show the lower bound Ω(n log n/log (n/m)) on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai [3] and Bruschi and Del Pinto [5], and is sharper than any of them in many cases. We also give an algorithm working in time O(n log n), thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.