Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
A lower bound for radio broadcast
Journal of Computer and System Sciences
Single round simulation on radio networks
Journal of Algorithms
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
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
Computation in noisy radio networks
Proceedings of the ninth 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
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Faster broadcasting in unknown radio networks
Information Processing Letters
Distributed Algorithms
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
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
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Original Broadcasting Technique in Radio Networks
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
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
Journal of Discrete Algorithms
Acknowledged broadcasting and gossiping in ad hoc radio networks
Theoretical Computer Science
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Centralized Communication in Radio Networks with Strong Interference
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
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
On neighbor discovery in cognitive radio networks
Journal of Parallel and Distributed Computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Maximizing the number of broadcast operations in static random geometric ad-hoc networks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Efficient distributed communication in ad-hoc radio networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Average-Time complexity of gossiping in radio networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Gathering algorithms on paths under interference constraints
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Almost optimal distributed M2M multicasting in wireless mesh networks
Theoretical Computer Science
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
| Hi-index | 0.00 |
We establish an O(nlog2n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of Ω(n log n). The fastest previously known algorithm for this problem works in time O(n3/2). Using our broadcasting algorithm, we develop an O(n3/2log2n) algorithm for gossiping in the same network model.