An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels

Authors:
J. Komlos;A. Greenberg
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Faster deterministic wakeup in multiple access channels

Discrete Applied Mathematics
Dynamic contention resolution in multiple-access channels

WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference

DISC'07 Proceedings of the 21st international conference on Distributed Computing
Finding witnesses by peeling

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Deterministic history-independent strategies for storing information on write-once memories

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Bounded-contention coding for wireless networks in the high SNR regime

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Reliable neighbor discovery for mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	754.84

Visualization

Abstract

A basic problem in the decentralized control of a multiple access channel is to resolve the conflicts that arise when several stations transmit simultaneously to the channel. Capetanakis, Hayes, and Tsybakov and Mikhailov found a deterministic {em tree algorithm} that resolves conflicts amongkstations from an ensemble ofnin timeTheta (k + k log (n / k))in the worst case. In this algorithm, at each step, the choice of which stations to enable to transmit depends crucially on feedback information provided by the channel. We show that ifkis given {em a priori} then such conflicts can be resolved in timeTheta (k + k log (n / k))using an algorithm in which the corresponding choices do not depend on feedback.