Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
Cutoff points for roll call protocols in multiple access systems
IEEE Transactions on Information Theory
On the time complexity of broadcast communication schemes (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Log-logarithmic protocols for resolving ethernet and semaphore conflicts
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Efficient algorithms for multiple access channels
Efficient algorithms for multiple access channels
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
On contention resolution protocols and associated probabilistic phenomena
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
The do-all problem in broadcast networks
Proceedings of the twentieth 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
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Contention resolution with heterogeneous job sizes
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Contention resolution in multiple-access channels: k-selection in radio networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Faster deterministic wakeup in multiple access channels
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Random Structures & Algorithms
Efficient algorithms for neighbor discovery in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A problem related to the decentralized control of a multiple access channel is considered: Suppose k stations from an ensemble of n simultaneously transmit to a multiple access channel that provides the feedback 0, 1, or 2+, denoting k = 0, k = 1, or k ≥ 2, respectively. If k = 1, then the transmission succeeds. But if k ≥ 2, as a result of the conflict, none of the transmissions succeed. An algorithm to resolve a conflict determines how to schedule retransmissions so that each of the conflicting stations eventually transmits singly to the channel. In this paper, a general model of deterministic algorithms to resolve conflicts is introduced, and it is established that, for all k and n (2 ≤ k ≤ n), &OHgr;(k(log n)/(log k)) time must elapse in the worst case before all k transmissions succeed.