Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
From MaRDI portal
Publication:3753913
DOI10.1137/0215032zbMath0612.94001MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
94A40: Channel models (including quantum) in information and communication theory
94A05: Communication theory
Related Items
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, Unnamed Item, Approximate Neighbor Counting in Radio Networks, Local queuing under contention, 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, Transmitting once to elect a leader on wireless networks, Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election, Four shades of deterministic leader election in anonymous networks, Unbounded contention resolution in multiple-access channels, Leader election in ad hoc radio networks: a keen ear helps, Initializing sensor networks of non-uniform density in the weak sensor model, Knowledge, level of symmetry, and time of leader election, Randomized mutual exclusion on a multiple access channel, How much memory is needed for leader election, 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, 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, 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
