Unbounded contention resolution in multiple-access channels
From MaRDI portal
Recommendations
- Unbounded contention resolution in multiple-access channels
- Contention resolution in a non-synchronized multiple access channel
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Deterministic non-adaptive contention resolution on a shared channel
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- Resolvability theory for the multiple-access channel
- Conflict resolution in a multiple access channel
- On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels
Cites work
- scientific article; zbMATH DE number 3659453 (Why is no real title available?)
- scientific article; zbMATH DE number 1857647 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- scientific article; zbMATH DE number 3195515 (Why is no real title available?)
- 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
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- On selection problem in radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Probability and Computing
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- The wakeup problem in synchronous broadcast systems
- Tree algorithms for packet broadcast channels
- Unbounded contention resolution in multiple-access channels
Cited in
(16)- On contention resolution protocols and associated probabilistic phenomena
- Bounded information dissemination in multi-channel wireless networks
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- Packet latency of deterministic broadcasting in adversarial multiple access channels
- Contention resolution with constant throughput and log-logstar channel accesses
- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
- Contention resolution in a non-synchronized multiple access channel
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Deterministic multi-channel information exchange
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- Scalable wake-up of multi-channel single-hop radio networks
- Optimal Protocols for 2-Party Contention Resolution
- Contention resolution on multiple channels with collision detection
- Information gathering in ad-hoc radio networks
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Unbounded contention resolution in multiple-access channels
This page was built for publication: Unbounded contention resolution in multiple-access channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378254)
