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