Unbounded Contention Resolution in Multiple-Access Channels
From MaRDI portal
Publication:3095329
DOI10.1007/978-3-642-24100-0_23zbMath1311.68013arXiv1107.0234OpenAlexW1826313918MaRDI QIDQ3095329
Antonio Fernández Anta, Jorge Ramón Muñoz, Miguel A. Mosteiro
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.0234
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Related Items (5)
Unbounded contention resolution in multiple-access channels ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Unnamed Item ⋮ Information exchange with collision detection on multiple channels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbounded contention resolution in multiple-access channels
- Tree algorithms for packet broadcast channels
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- 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 $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- On selection problem in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
- Probability and Computing
This page was built for publication: Unbounded Contention Resolution in Multiple-Access Channels