By Topic

Analytic properties of multiple-access trees

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
$33 $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 potentially infinite population of terminals is considered, of which a random number X seek reserved access to a slotted, broadcast, random-access channel. The reservation protocol is a tree search with collision detection. The time slots are assumed to be organized in nonover-lapping frames of k consecutive slots each, and the channel feedback is assumed to be available only at frame (as opposed to slot) boundaries. Control is exercised by varying the nodal degree at the root of the search tree according to the distribution p of X . Optimal control, and the duration of the reservation set-up time, are studied as functions of k and p .

Published in:

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