Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
On adaptive deterministic gossiping in ad hoc radio networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Broadcasting with Universal Lists Revisited: Using Competitive Analysis
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Gossiping in Radio Networks
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Deterministic Radio Broadcasting at Low Cost
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Centralized broadcast in multihop radio networks
Journal of Algorithms
Deterministic broadcasting time with partial knowledge of the network
Theoretical Computer Science
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
The Journal of Supercomputing
IEEE Transactions on Mobile Computing
An improved algorithm for radio broadcast
ACM Transactions on Algorithms (TALG)
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Energy efficient randomised communication in unknown AdHoc networks
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
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
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
Maximum Finding in the Symmetric Radio Networks with Collision Detection
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
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
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sensor network gossiping or how to break the broadcast lower bound
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic communication in the weak sensor model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
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
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An optimal algorithm of acknowledged broadcasting in ad hoc radio networks
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Interference-aware broadcast scheduling in wireless networks
Ad Hoc Networks
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
Optimal gossiping in square meshes in all-port mode and with short packets
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
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
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
| Hi-index | 0.01 |
We establish an O(n log/sup 2/n) 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 /spl Omega/(n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm, we develop an O(n/sup 3/2/log/sup 2/n) algorithm for gossiping in the same network model.