Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
DOI10.1137/0215032zbMATH Open0612.94001OpenAlexW2033487809MaRDI QIDQ3753913FDOQ3753913
Authors: Dan E. Willard 
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215032
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
Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Channel models (including quantum) in information and communication theory (94A40)
Cited In (41)
- Leader election in ad hoc radio networks: a keen ear helps
- Leader election using loneliness detection
- A logarithmic lower bound for time-spread multiple-access (TSMA) protocols
- Coordination Problems in Ad Hoc Radio Networks
- Unbounded contention resolution in multiple-access channels
- Distributed tree comparison with nodes of limited memory
- Global synchronization and consensus using beeps in a fault-prone multiple access channel
- How much memory is needed for leader election
- Impact of knowledge on election time in anonymous networks
- Topology recognition and leader election in colored networks
- Contention resolution on a fading channel
- Ordered and delayed adversaries and how to work against them on a shared channel
- Approximate Neighbor Counting in Radio Networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Quasi-optimal energy-efficient leader election algorithms in radio networks
- Leader election in SINR model with arbitrary power control
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Performing work in broadcast networks
- Approximating the Size of a Radio Network in Beeping Model
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
- Leader election in multi-hop radio networks
- Four shades of deterministic leader election in anonymous networks
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
- Leader election for anonymous asynchronous agents in arbitrary networks
- Information exchange with collision detection on multiple channels
- Title not available (Why is that?)
- Leader election using loneliness detection
- Optimal Protocols for 2-Party Contention Resolution
- Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
- Fast size approximation of a radio network in beeping model
- Initializing sensor networks of non-uniform density in the weak sensor model
- Knowledge, level of symmetry, and time of leader election
- Transmitting once to elect a leader on wireless networks
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Unbounded contention resolution in multiple-access channels
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Round complexity of leader election and gossiping in bidirectional radio networks
- Randomized mutual exclusion on a multiple access channel
- Local queuing under contention
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)
