Faster deterministic wakeup in multiple access channels

Authors:
Gianluca De Marco;Marco Pellegrini;Giovanni Sburlati
Affiliations:
Dipartimento di Informatica e Applicazioni, Universití di Salerno, 84081 Baronissi (SA), Italy;Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy;Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 15
Cited 0

Data networks

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
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
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
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Theoretical 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
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
Nonrandom binary superimposed codes

IEEE Transactions on Information Theory
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels

IEEE Transactions on Information Theory
A perspective on multiaccess channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 in time O(n^3log^3n), which improves on the currently best upper bound of O(n^4log^5n).