Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
An improved algorithm for radio broadcast
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science - Foundations of software science and computation structures
Journal of Discrete Algorithms
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed broadcast in unknown radio networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Grid emulation for managing random sensor networks
Ad Hoc Networks
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Journal of Parallel and Distributed Computing
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
On neighbor discovery in cognitive radio networks
Journal of Parallel and Distributed Computing
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
A location aided flooding protocol for wireless ad hoc networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
DISC'09 Proceedings of the 23rd 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
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
The impact of mobility on the time complexity for deterministic broadcasting in radio networks
International Journal of Ad Hoc and Ubiquitous Computing
Managing random sensor networks by means of grid emulation
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
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 |
In a seminal paper [3], Bar-Yehuda, Goldreich and Itai considered broadcasting in radio networks whose nodes know only their own label and labels of their neighbors. They claimed a linear lower bound on the time of deterministic broadcasting in such radio networks, by constructing a class of graphs of diameter 3, with the property that every broadcasting algorithm requires linear time on one of these graphs. Due to a subtle error in the argument, this result is incorrect. We construct an algorithm that broadcasts in logarithmic time on all graphs from [3]. Moreover, we show how to broadcast in sublinear time on all n -node graphs of diameter 0(log log n). On the other hand, we construct a class of graphs of diameter 4, such that every broadcasting algorithm requires time \Omega (\sqrt[4]{n}) on one of these graphs. In view of the randomized algorithm from [3], runnning in expected time O(Dlogn + log2n) on all n -node graphs of diameter D, our lower bound gives the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting.