Contention resolution in a non-synchronized multiple access channel
From MaRDI portal
Publication:2402256
DOI10.1016/j.tcs.2017.05.014zbMath1372.68026OpenAlexW4235162847MaRDI QIDQ2402256
Gianluca De Marco, Dariusz R. Kowalski
Publication date: 7 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.014
Analysis of algorithms (68W40) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)
Related Items (7)
Contention resolution in a non-synchronized multiple access channel ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Subquadratic non-adaptive threshold group testing ⋮ Information gathering in ad-hoc radio networks ⋮ Optimal channel utilization with limited feedback ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds
Cites Work
- Unnamed Item
- Faster deterministic wakeup in multiple access channels
- Scalable wake-up of multi-channel single-hop radio networks
- Distributed broadcast in radio networks of unknown topology.
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Contention resolution in a non-synchronized multiple access channel
- The Wakeup Problem in Synchronous Broadcast Systems
- Tree algorithms for packet broadcast channels
- Distributed Broadcast in Unknown Radio Networks
- Fast broadcasting and gossiping in radio networks
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Naming a Channel with Beeps
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Deterministic broadcasting in ad hoc radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- The Wake‐Up Problem in MultiHop Radio Networks
- A better wake-up in radio networks
- Automata, Languages and Programming
This page was built for publication: Contention resolution in a non-synchronized multiple access channel