An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
From MaRDI portal
Publication:5187198
DOI10.1109/TIT.1985.1057020zbMath0561.94004OpenAlexW2098243917MaRDI QIDQ5187198
János Komlós, Albert G. Greenberg
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1985.1057020
Related Items
Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Performing work in broadcast networks ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Adversarial multiple access channels with individual injection rates ⋮ Unbounded contention resolution in multiple-access channels ⋮ Faster deterministic wakeup in multiple access channels ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Applications of coding theory to communication combinatorial problems ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ 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 ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ Contention resolution on a fading channel ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Information exchange with collision detection on multiple channels ⋮ Separable collusion-secure multimedia codes ⋮ Bounded-contention coding for the additive network model ⋮ Optimal channel utilization with limited feedback ⋮ Local queuing under contention ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Deterministic recurrent communication in restricted sensor networks ⋮ Coding for write-unidirectional memories and conflict resolution ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions ⋮ Broadcasting in ad hoc multiple access channels ⋮ Broadcasting in Ad Hoc Multiple Access Channels
