Unbounded contention resolution in multiple-access channels

DOI10.1007/s00453-013-9816-xzbMath1311.68012OpenAlexW2088909229MaRDI QIDQ378254

Jorge Ramón Muñoz, Antonio Fernández Anta, Miguel A. Mosteiro

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

zbMATH Keywords

multiple-access channel\(k\)-selectioncommunication protocolscontention resolutionradio networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (10)

Bounded information dissemination in multi-channel wireless networks ⋮ Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Deterministic multi-channel information exchange ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Information gathering in ad-hoc radio networks ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• 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
• 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
• Probability and Computing

This page was built for publication: Unbounded contention resolution in multiple-access channels