PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks
Information Processing Letters
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd 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
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
SIAM Journal on Discrete Mathematics
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
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
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
Fast radio broadcasting with advice
Theoretical Computer Science
Efficient k-shot broadcasting in radio networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Oblivious k-shot broadcasting in ad hoc radio networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Oblivious k-shot broadcasting in ad hoc radio networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
We consider the problem of broadcasting in an unknown radio network modeled as a directed graph G = (V, E), where |V| = n. In unknown networks, every node knows only its own label, while it is unaware of any other parameter of the network, included its neighborhood and even any upper bound on the number of nodes. We show an O(n log n log log n) upper bound on the time complexity of deterministic broadcasting improving upon the time complexity of the currently best known algorithms [6, 12].