Journal of Computer and System Sciences
Algorithmic number theory
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
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
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
A better wake-up in radio networks
Proceedings of the twenty-third 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
A survey of autonomic communications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
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
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
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
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
Hi-index | 0.00 |
Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving simultaneously to a node interfere with one another and none of them can be read reliably. We present improved solutions to the problem of waking up such a network. This requires activating all nodes in a scenario when some nodes start to be active spontaneously, while every sleeping node needs to be awaken by receiving successfully a message from a neighbor. Our contributions concern the existence and efficient construction of universal radio synchronizers, which are combinatorial structures introduced in [6] as building blocks of efficient wake-up algorithms. First we show by counting that there are (n,g)-universal synchronizers for $g(k)={\mathcal O}(k \ {\rm log}\ k \ {\rm log}\ n)$. Next we show an explicit construction of (n,g)-universal-synchronizers for $g(k) = {\mathcal O}(k^{2}{\rm polylog}\ n)$. By way of applications, we obtain an existential wake-up algorithm which works in time ${\mathcal O}(n {\rm log}^{2}n)$ and an explicitly instantiated algorithm that works in time ${\mathcal O}(n{\it \Delta} {\rm polylog}\ n)$, where n is the number of nodes and ${\it \Delta}$ is the maximum in-degree in the network. Algorithms for leader-election and synchronization can be developed on top of wake-up ones, as shown in [7], such that they work in time slower by a factor of ${\mathcal O}({\rm log} \ n)$ than the underlying wake-up ones.