Tree algorithms for packet broadcast channels

DOI10.1109/TIT.1979.1056093zbMath0414.94019MaRDI QIDQ3050281

John I. Capetanakis

Publication date: 1979

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

independent sourcesmultiaccessingtree algorithms for packet broadcast channels

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (55)

Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ A fast maximum finding algorithm on broadcast communication ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Distributed communications in collision channels with errors ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback ⋮ Unbounded contention resolution in multiple-access channels ⋮ Random multiple access in a vector disjunctive channel ⋮ Analytical depoissonization and its applications ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ Leader election using loneliness detection ⋮ On ergodic algorithms in random multiple access systems with ``success-failure feedback ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ Spatially decentralized protocols in random multiple access networks ⋮ Merged search algorithms for radio frequency identification anticollision ⋮ Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms ⋮ On the height of digital trees and related problems ⋮ System-theoretic properties of large communication networks with Markovian multiaccess control disciplines ⋮ On tries, contention trees and their analysis ⋮ A stack protocol of CTM type with quartet feedback ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Contention resolution under selfishness ⋮ Reducing conflict resolution time for solving graph problems in broadcast communications ⋮ Interrelation of characteristics of blocked RMA stack algorithms ⋮ Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness ⋮ A novel prediction‐based collision resolution algorithm ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Performance evaluation of random power capture on mobile communications ⋮ A class of algorithms for collision resolution with multiplicity estimation ⋮ STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN ⋮ A fast maximum finding algorithm on broadcast communication ⋮ Randomized mutual exclusion on a multiple access channel ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ Transmitting once to elect a leader on wireless networks ⋮ Dynamic tree algorithms ⋮ A probabilistic analysis of some tree algorithms ⋮ The power of multimedia: Combining point-to-point and multi-access networks ⋮ From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader ⋮ On stability of multiple access systems with minimal feedback ⋮ Mean-field analysis of a scaling MAC radio protocol ⋮ Leader election in SINR model with arbitrary power control ⋮ Information exchange with collision detection on multiple channels ⋮ Throughput and delay analysis of an opportunistic tree algorithm ⋮ Bayesian estimation in dynamic framed slotted ALOHA algorithm for RFID system ⋮ CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Leader Election Using Loneliness Detection ⋮ Conflict-resolving tree algorithm stable to incomplete interference damping ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ A certainty equivalence principle based nonlinear separation control rule for random access channels: Stability and delay analysis ⋮ Large homogeneous communication networks with Markovian access control. I: Equilibria and local stability

This page was built for publication: Tree algorithms for packet broadcast channels