Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual 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
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
| Hi-index | 0.00 |
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, $\lambda$, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgment-based protocol.