Faster deterministic wakeup in multiple access channels

DOI10.1016/j.dam.2006.08.009zbMath1115.68029OpenAlexW2152985036MaRDI QIDQ881569

Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.08.009

zbMATH Keywords

clockalgorithmssynchronymultiple access channelwakeup problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (4)

Contention resolution in a non-synchronized multiple access channel ⋮ Adversarial multiple access channels with individual injection rates ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no set is covered by the union of \(r\) others
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• The Wakeup Problem in Synchronous Broadcast Systems
• A perspective on multiaccess channels
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• ON THE PROBLEM OF JACOBSTHAL
• Analysis of Backoff Protocols for Multiple Access Channels
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Nonrandom binary superimposed codes
• Theoretical Computer Science
• A better wake-up in radio networks
• On the Integers Relatively Prime to $n$ and a Number-Theoretic Function Considered by Jacobsthal.
• Automata, Languages and Programming

This page was built for publication: Faster deterministic wakeup in multiple access channels