Tree algorithms for packet broadcast channels

Cited in

(59)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050281)