Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
From MaRDI portal
Publication:3578338
Recommendations
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Bounds on contention management in radio networks
- 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
- Contention resolution in a non-synchronized multiple access channel
- Unbounded contention resolution in multiple-access channels
- Unbounded contention resolution in multiple-access channels
- On selection problem in radio networks
- Models and approximation algorithms for channel assignment in radio networks
Cited in
(10)- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Counting in one-hop beeping networks
- 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
- Unbounded contention resolution in multiple-access channels
- Initializing sensor networks of non-uniform density in the weak sensor model
- On selection problem in radio networks
- Information exchange with collision detection on multiple channels
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 Q3578338)