Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Solving conflicts of known multiplicity

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)
del Angel, G. ; Aware Inc., Bedford, MA, USA ; Fine, T.L.

We consider collision resolution protocols for a random access collision channel with multiplicity feedback. By using Markov decision processes, we provide performance bounds for such systems in terms of the mean number of slots required to resolve a collision of a given multiplicity. We show that recursive binary splitting is strictly suboptimal for all collisions of size n>3, and we find the optimal protocol for the case n=4.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002