A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Randomized algorithms
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Of malicious motes and suspicious sensors
Theoretical Computer Science
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Trusted computing for fault-prone wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Broadcasting in sensor networks of unknown topology in the presence of swamping
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Dynamic networks: models and algorithms
ACM SIGACT News
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
The cost of radio network broadcast for different models of unreliable links
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults.Concerning oblivious fault-tolerant distributed protocols, we provide an Ω(Dn) lower bound where n is the number of nodes of the network and D is the source eccentricity in the fault-free part of the network. Rather surprisingly, this lower bound implies that the simple Round Robin protocol, working in O(Dn) time, is an optimal fault-tolerant oblivious protocol. Then, we demonstrate that networks of o(n/log n) maximum in-degree admit faster oblivious protocols. Indeed, we derive an oblivious protocol having O(D min{n, Δ log n}) completion time on any network of maximum in-degree Δ.Finally, we address the question whether adaptive protocols can be faster than oblivious ones. We show that the answer is negative at least in the general setting: we indeed prove an Ω(Dn) lower bound when D = Θ(√n). This clearly implies that no (adaptive) protocol can achieve, in general, o(Dn) completion time.