Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel

DOI10.1137/140982763zbMath1326.68329OpenAlexW764027259MaRDI QIDQ5501204

Dariusz R. Kowalski, Gianluca De Marco

Publication date: 3 August 2015

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/140982763

zbMATH Keywords

deterministic algorithmsdistributed algorithmsmultiple-access channellatencythroughputcontention resolution

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Channel models (including quantum) in information and communication theory (94A40) Distributed algorithms (68W15)

Related Items (11)

Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Subquadratic non-adaptive threshold group testing ⋮ Information gathering in ad-hoc radio networks ⋮ Optimal channel utilization with limited feedback ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded contention resolution in multiple-access channels
• Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
• Distributed broadcast in radio networks of unknown topology.
• A jamming-resistant MAC protocol for single-hop wireless networks
• Tree algorithms for packet broadcast channels
• Distributed Broadcast in Unknown Radio Networks
• Fast broadcasting and gossiping in radio networks
• Adversarial Queuing on the Multiple Access Channel
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Stochastic Contention Resolution With Short Delays
• Distributed Online and Stochastic Queuing on a Multiple Access Channel
• On selection problem in radio networks
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Optimal Two-Stage Algorithms for Group Testing Problems
• Nonrandom binary superimposed codes
• Contention resolution with constant expected delay
• Broadcasting algorithms in radio networks with unknown topology
• Fundamentals of Computation Theory

This page was built for publication: Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel