Contention resolution on a fading channel
DOI10.1007/S00446-018-0323-9zbMATH Open1451.68043OpenAlexW2793340227MaRDI QIDQ2010610FDOQ2010610
Authors: Jeremy T. Fineman, Fabian Kuhn, Calvin Newport, Seth Gilbert
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-018-0323-9
Recommendations
- Contention resolution on a fading channel
- Distributed contention resolution in wireless networks
- Contention resolution on multiple channels with collision detection
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Unbounded contention resolution in multiple-access channels
Analysis of algorithms and problem complexity (68Q25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Efficient symmetry breaking in multi-channel radio networks
- Distributed connectivity of wireless networks
- Maximal independent sets in radio networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- The wakeup problem in synchronous broadcast systems
- 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
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- A perspective on multiaccess channels
- A sufficient condition of nonergodicity of a Markov chain (Corresp.)
- The cost of synchronizing multiple-access channels
- Title not available (Why is that?)
- Decentralized dynamic control of a multiaccess broadcast channel
- Broadcast in the Ad Hoc SINR Model
- Distributed backbone structure for algorithms in the SINR model of wireless networks
- On the impact of geometry on ad hoc communication in wireless networks
- Radio Network Lower Bounds Made Easy
Cited In (4)
This page was built for publication: Contention resolution on a fading channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010610)