Deterministic non-adaptive contention resolution on a shared channel
From MaRDI portal
Publication:2677825
DOI10.1016/j.jcss.2022.11.001OpenAlexW4309628998MaRDI QIDQ2677825
Dariusz R. Kowalski, Gianluca De Marco, Grzegorz Stachowiak
Publication date: 6 January 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.13423
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalable wake-up of multi-channel single-hop radio networks
- Conflict resolution in a multiple access channel
- Distributed broadcast in radio networks of unknown topology.
- Contention resolution in a non-synchronized multiple access channel
- Tree algorithms for packet broadcast channels
- Distributed Broadcast in Unknown Radio Networks
- Unbounded Contention Resolution in Multiple-Access Channels
- Adversarial Queuing on the Multiple Access Channel
- A perspective on multiaccess channels
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
- A Proof for the Queuing Formula: L = λW
- Contention resolution without collision detection
- The wakeup problem in synchronous broadcast systems (extended abstract)
- On selection problem in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Contention resolution with log-logstar channel accesses
- Asynchronous Shared Channel
- Contention resolution with constant expected delay
- Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
- A better wake-up in radio networks
- Automata, Languages and Programming
