By Topic

Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known

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

1 Author(s)
E. Gulko ; Bell-Northern Res., Verdun, P. Q., Canada

We compute the stability region and mean packet delay for a class of tree-based, multiaccess protocols proposed recently in the literature for an ALOHA-type channel when collision multiplicities are known, and Show that within the stability region, all the moments of the delay distribution are finite. We also show that the main advantage, of knowing the collision multiplicities is being able, in effect, to detect conflicts in two groups in a single slot.

Published in:

IEEE Transactions on Communications  (Volume:33 ,  Issue: 9 )