A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
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
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Theoretical Computer Science - Foundations of software science and computation structures
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
| Hi-index | 5.23 |
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every deterministic broadcasting protocol there exists a network, of radius 2, for which the protocol takes at least @W(n^1^2) rounds for completing the broadcast. Our argument can be extended to prove a lower bound of @W((nD)^1^2) rounds for broadcasting in radio networks of radius D. This resolves one of the open problems posed in Kowalski and Pelc (2004) [24], where the authors proved a lower bound of @W(n^1^4) rounds for broadcasting in constant diameter networks. We prove the new lower bound for a special family of radius 2 networks. Each network of this family consists of O(n) components which are connected to each other via only the source node. At the heart of the proof is a novel simulation argument, which essentially says that any arbitrarily complicated strategy of the source node can be simulated by the nodes of the networks, if the source node just transmits partial topological knowledge about some component instead of arbitrary complicated messages. To the best of our knowledge this type of simulation argument is novel and may be useful in further improving the lower bound or may find use in other applications.