By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 2 )