Unbounded contention resolution in multiple-access channels
From MaRDI portal
Publication:378254
DOI10.1007/S00453-013-9816-XzbMATH Open1311.68012OpenAlexW2088909229MaRDI QIDQ378254FDOQ378254
Authors: Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz 
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9816-x
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
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- On selection problem in radio networks
- Probability and Computing
- Title not available (Why is that?)
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
- The wakeup problem in synchronous broadcast systems
- Tree algorithms for packet broadcast channels
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Unbounded contention resolution in multiple-access channels
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Title not available (Why is that?)
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
Cited In (16)
- 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
- On contention resolution protocols and associated probabilistic phenomena
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)
