Contention resolution in multiple-access channels: k-selection in radio networks

Authors:
Antonio Fernández Anta;Miguel A. Mosteiro
Affiliations:
LADyR, GSyC, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain;LADyR, GSyC, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain and Department of Computer Science, Rutgers University, Piscataway, NJ
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 11
Cited 1

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
Efficient optical communication in parallel computers

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Maximum finding on a multiple access broadcast network

Information Processing Letters
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
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
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

Dynamic contention resolution in multiple-access channels

WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, contention resolution among k contenders on a multipleaccess channel is explored. The problem studied has been modeled as a k- Selection in Radio Networks, in which every contender has to have exclusive access at least once to a shared communication channel. The randomized adaptive protocol presented shows that, for a probability of error 2e, all the contenders get access to the channel in time (e+1+ξ)k+O(log2(1/ε)), where ε ≤ 1/(n+1), ξ 0 is any constant arbitrarily close to 0, and n is the total number of potential contenders. The above time complexity is asymptotically optimal for any significant ε. The protocol works even if the number of contenders k is unknown and collisions can not be detected.