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)
Time-spread multiple-access (TSMA) protocols for multihop mobile 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
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
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
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Theoretical Computer Science - Foundations of software science and computation structures
Efficient k-shot broadcasting in radio networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
| Hi-index | 0.01 |
We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log2 n). Our main result is a broadcasting algorithm working in time O(n log n log D) for arbitrary n- node ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is 驴(n log D), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time O(n log D) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.