Introduction to algorithms
A lower bound for radio broadcast
Journal of Computer and System Sciences
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Sparser: a paradigm for running distributed algorithms
Journal of Algorithms
Journal of Computer and System Sciences
Online tracking of mobile users
Journal of the ACM (JACM)
The time complexity of deterministic broadcast radio networks
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
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)
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
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Deterministic M2M multicast in radio networks
Theoretical Computer Science
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms
Acknowledged broadcasting and gossiping in ad hoc radio networks
Theoretical Computer Science
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
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
Note: A note on the lower bound of centralized radio broadcasting for planar reachability graphs
Discrete Applied Mathematics
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Efficient broadcasting in known topology radio networks with long-range interference
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast radio broadcasting with advice
Theoretical Computer Science
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Efficient k-shot broadcasting in radio networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
IEEE Transactions on Wireless Communications
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Gathering algorithms on paths under interference constraints
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th 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
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.01 |
We show that for any radio network there exists a schedule of a broadcast whose time is O (D +log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D =Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.