Complexity of network synchronization
Journal of the ACM (JACM)
A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Algorithmic number theory
SIAM Journal on Computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Maximal independent sets in 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
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Mobile Computing
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on 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
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Faster deterministic wakeup in multiple access channels
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Energy efficient alert in single-hop networks of extremely weak devices
Theoretical Computer Science
Efficient symmetry breaking in multi-channel radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
We present an improved algorithm to wake up a multi-hop ad-hoc radio network. The goal is to have all the nodes activated, when some of them may wake up spontaneously at arbitrary times and the remaining nodes need to be awoken by the already active ones. The best previously known wake-up algorithm was given by Chrobak, Gasieniec and Kowalski [11], and operated in time O(n5/3 log n), where n is the number of nodes. We give an algorithm with the running time O(n3/2 log n). This also yields better algorithms for other synchronization-type primitives, like leader election and local-clocks synchronization, each with a time performance that differs from that of wake-up by an extra factor of O(log n) only, and improves the best previously known method for the problem by a factor of n1/6. A wake-up algorithm is a schedule of transmissions for each node. It can be represented as a collection of binary sequences. Useful properties of such collections have been abstracted to define a (radio) synchronizer. It has been known that good radio synchronizers exist and previous algorithms [17,11] relied on this. We show how to construct such synchronizers in polynomial time, from suitable constructible expanders. As an application, we obtain a wake-up protocol for a multiple-access channel that activates the network in time O(k2 polylog n), where k is the number of stations that wake up spontaneously, and which can be found in time polynomial in n. We extend the notion of synchronizers to universal synchronizers. We show that there exist universal synchronizers with parameters that guarantee time O(n3/2 log n) of wake-up.