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

DOI10.1142/S1793830910000796MaRDI QIDQ3084678zbMATH OpenOpenAlexFDO

Authors Antonio Fernández Anta, Miguel A. Mosteiro

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

contention resolutionmultiple-access channelsradio networksselection

Mathematics Subject Classification ID

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

Recommendations

• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
• Bounds on contention management in radio networks
• Contention resolution in a non-synchronized multiple access channel
• Unbounded contention resolution in multiple-access channels
• Unbounded contention resolution in multiple-access channels
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
• Multi-channel assignment for communication in radio networks
• Contention resolution on a fading channel

Cites work

• 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
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Probability and Computing
• Tree algorithms for packet broadcast channels

Cited in

(12)

• A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
• Contention resolution on a fading channel
• Contention resolution in a non-synchronized multiple access channel
• Unbounded contention resolution in multiple-access channels
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Unbounded contention resolution in multiple-access channels
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• On selection problem in radio networks
• Contention resolution on a fading channel
• Tight Trade-off in Contention Resolution without Collision Detection
• On full utilization of multi-channel capacity with priority protocol

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084678)