CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS

DOI10.1142/S1793830910000796zbMath1211.68503OpenAlexW1967764814MaRDI QIDQ3084678

Miguel A. Mosteiro, Antonio Fernández Anta

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000796

zbMATH Keywords

selectioncontention resolutionradio networksmultiple-access channels

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

Unbounded contention resolution in multiple-access channels ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

Cites Work

• Tree algorithms for packet broadcast 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
• Probability and Computing

This page was built for publication: CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS