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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
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
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
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed broadcast in unknown radio networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
DISC'10 Proceedings of the 24th international conference on Distributed computing
| Hi-index | 0.00 |
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.