Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Maximum finding on a multiple access broadcast network
Information Processing Letters
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
SIAM Journal on Computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth 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
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Contention resolution in multiple-access channels: k-selection in radio networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Contention resolution over a multiple-access channel can be modeled as a k -selection problem in wireless networks, where a subset k of n network nodes want to broadcast their messages over a shared channel. This paper studies a dynamic version of this problem, which assumes that k messages arrive at an arbitrary set of k nodes (contenders) asynchronously and the message arrival pattern is determined by an on-line adversary. Under this harsh and more practical assumption, we give a randomized distributed algorithm which can guarantee any contender deliver its message in O (k +log2n ) rounds with high probability. Our proposed algorithm neither relies on collision detection, nor a global clock or any knowledge about the contenders, not even its size k . Furthermore, we do not assume the channel can provide any kind of feedback information, which makes our protocol work in simple channels, such as the channels used in wireless sensor networks.