Data networks
On the stability of the Ethernet
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Faster broadcasting in unknown radio networks
Information Processing Letters
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
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Hi-index | 0.00 |
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in which no global clock is available: processors have local clocks ticking at the same rate, but each clock starts counting the rounds in the round in which the correspondent processor wakes up. Moreover, the number n of processors is not known to the processors. We propose a new deterministic algorithm for this problem, which improves on the currently best upper bound.