The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm

Abstract We investigate the expected CRI-length (collision resolution interval) of a hybrid collision resolution algorithm based on slotted ALOHA with controlled retransmission probability, e.g., we study the average number of slots necessary for the resolution of an initial collision of multiplicity n . An algorithm similar to binary exponential backoff for adjusting the retransmission probability w.r.t. the channel load is used prior to the application of the ALOHA resolution algorithm, thus operating it in the region of nonexponential behaviour. Mellin-transform techniques are used for the derivation of an asymptotic expression for the desired quantity, which turns out to be O( n log n ).