Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
From MaRDI portal
(Redirected from Publication:3753913)
Recommendations
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- On selection problem in radio networks
- On adaptive conflict resolution algorithms in a multiple access channel
- Conflict resolution in a multiple access channel
Cited in
(44)- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Impact of knowledge on election time in anonymous networks
- A logarithmic lower bound for time-spread multiple-access (TSMA) protocols
- Leader election using loneliness detection
- Ordered and delayed adversaries and how to work against them on a shared channel
- Contention resolution on a fading channel
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Leader election for anonymous asynchronous agents in arbitrary networks
- Global synchronization and consensus using beeps in a fault-prone multiple access channel
- Fast size approximation of a radio network in beeping model
- Leader election in multi-hop radio networks
- Performing work in broadcast networks
- Round complexity of leader election and gossiping in bidirectional radio networks
- Approximating the size of a radio network in beeping model
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Unbounded contention resolution in multiple-access channels
- Leader election using loneliness detection
- Unbounded contention resolution in multiple-access channels
- Leader election in ad hoc radio networks: a keen ear helps
- Contention resolution with constant throughput and log-logstar channel accesses
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Initializing sensor networks of non-uniform density in the weak sensor model
- Deterministic blind radio networks
- Local queuing under contention
- Approximate Neighbor Counting in Radio Networks
- Randomized mutual exclusion on a multiple access channel
- Distributed tree comparison with nodes of limited memory
- Coordination Problems in Ad Hoc Radio Networks
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
- Leader election in SINR model with arbitrary power control
- Information exchange with collision detection on multiple channels
- Topology recognition and leader election in colored networks
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Four shades of deterministic leader election in anonymous networks
- Transmitting once to elect a leader on wireless networks
- Optimal Protocols for 2-Party Contention Resolution
- How much memory is needed for leader election
- Contention resolution with message deadlines
- Jamming-resistant backoff with polylogarithmic sending and listening cost
- Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
- Softening the impact of collisions in contention resolution
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- Quasi-optimal energy-efficient leader election algorithms in radio networks
This page was built for publication: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753913)
