Contention resolution on a fading channel
DOI10.1007/s00446-018-0323-9zbMath1451.68043OpenAlexW2793340227MaRDI QIDQ2010610
Fabian Kuhn, Seth Gilbert, Calvin Newport, Jeremy T. Fineman
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
Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- The Wakeup Problem in Synchronous Broadcast Systems
- The Cost of Synchronizing Multiple-Access Channels
- Broadcast in the Ad Hoc SINR Model
- Distributed connectivity of wireless networks
- On the impact of geometry on ad hoc communication in wireless networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- A perspective on multiaccess 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
- A sufficient condition of nonergodicity of a Markov chain (Corresp.)
- Decentralized dynamic control of a multiaccess broadcast channel
- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
- Efficient Symmetry Breaking in Multi-Channel Radio Networks
- Maximal independent sets in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Radio Network Lower Bounds Made Easy
This page was built for publication: Contention resolution on a fading channel
