Contention resolution in a non-synchronized multiple access channel
From MaRDI portal
Publication:2402256
Recommendations
- Deterministic non-adaptive contention resolution on a shared channel
- Unbounded contention resolution in multiple-access channels
- Unbounded contention resolution in multiple-access channels
- Conflict resolution in a multiple access channel
- Contention resolution on a fading channel
- Contention resolution on a fading channel
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
Cites work
- A better wake-up 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
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Automata, Languages and Programming
- Contention resolution in a non-synchronized multiple access channel
- Deterministic broadcasting in ad hoc radio networks
- Distributed broadcast in radio networks of unknown topology.
- Distributed broadcast in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Faster deterministic wakeup in multiple access channels
- scientific article; zbMATH DE number 5764877 (Why is no real title available?)
- Naming a channel with beeps
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Scalable wake-up of multi-channel single-hop radio networks
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- The wakeup problem in synchronous broadcast systems
- The Wake‐Up Problem in MultiHop Radio Networks
- Tree algorithms for packet broadcast channels
Cited in
(25)- Information gathering in ad-hoc radio networks
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Contention resolution in a non-synchronized multiple access channel
- Deterministic non-adaptive contention resolution on a shared channel
- The cost of synchronizing multiple-access channels
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Unbounded contention resolution in multiple-access channels
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- scientific article; zbMATH DE number 3924666 (Why is no real title available?)
- Cutoff points for roll call protocols in multiple access systems
- Unbounded contention resolution in multiple-access channels
- Contention resolution with constant throughput and log-logstar channel accesses
- Contention resolution without collision detection
- Contention resolution on a fading channel
- Contention resolution on multiple channels with collision detection
- Asynchronous shared channel
- Contention resolution with constant expected delay
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- On contention resolution protocols and associated probabilistic phenomena
- Subquadratic non-adaptive threshold group testing
- Optimal channel utilization with limited feedback
- Tight Trade-off in Contention Resolution without Collision Detection
- Contention resolution with message deadlines
- Jamming-resistant backoff with polylogarithmic sending and listening cost
- A model of restricted asynchronous multiple access in the presence of errors
This page was built for publication: Contention resolution in a non-synchronized multiple access channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402256)
