Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Adaptive packet routing for bursty adversarial traffic
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
SIAM Journal on Computing
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
SIAM Journal on Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Stability of the multiple-access channel under maximum broadcast loads
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Deterministic broadcast on multiple access channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Bounds on stability and latency in wireless communication
IEEE Communications Letters
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Medium access control for adversarial channels with jamming
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
An efficient and fair MAC protocol robust to reactive interference
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider broadcasting on the multiple-access channel when packets are injected continuously. Multiple-access channel is a synchronous system with the properties that a single transmission at a round delivers the message to all nodes, while multiple simultaneous transmissions result in a conflict which prevents delivering messages to any among the recipients. The traditional approach to dynamic broadcasting has been concerned with stability of protocols under suitable stochastic assumptions about injection rates. We study deterministic protocols competing against adversaries restricted by injection rate and burstiness of traffic. Stability means that the number of packets in queues is bounded by a constant in any execution, for a given number of stations, protocol, and adversary. Strong stability denotes the property that the number of queued packets is proportional to the burstiness of traffic, that is, the maximum number of packets an adversary may inject simultaneously. There are three natural classes of protocols we consider. The weakest acknowledgement-based protocols have a station rely on its local clock and on a feedback from the channel during its own attempts of transmissions. Full-sensing protocols allow a station to rely on a global clock and to store the history of all the previous successes/failures of transmissions in the course of an execution. A station running an adaptive protocol can rely on a global clock, may add control bits to be piggybacked on messages, and may store the complete history of the feedback from the channel during an execution. It turns out that there is no adaptive broadcast protocol stable for the injection rate λ = 1 for the multiple-access channel with at least n ≥ 4 stations, even when collision detection is available. We show that a simple full-sensing protocol is universally stable, which means it can handle any constant injection rate λ ‹ 1 in a stable manner. A more involved full-sensing protocol is shown to be both universally stable and strongly-stable for injection rate ρ (n) ≤ 1overd lg2 n, where d0 is a sufficiently large constant and n is the number of stations. We show that there is an acknowledgement-based protocol that is strongly stable for injection rate ρ(n)≤ 1d lg2 n, for a sufficiently large constant d0. Regarding the stability of acknowledgement-based protocols, we show that no such a protocol is stable for injection rate ρ(n) 21+lg n. This implies that there are no universally stable acknowledgement-based protocols. We show that when collision detection is available, then a simple full-sensing protocol is both universally stable and strongly stable for injection rate ρ(n)≤ 12 lgn. As a complementary fact, we prove that no adaptive protocol for a channel with collision detection can be strongly stable for the injection rate that satisfies ρ (n) = ω (1log n). This shows that the protocol we give is optimal with respect to injection rates it handles in a strongly stable manner.