# Analysis of tree algorithm for collision resolution

1 DCSIT - Department of Computer Science and Information Theory

Abstract : For the tree algorithm introduced by Cap79 and TsMi78 let $L N$ denote the expected collision resolution time given the collision multiplicity $N$. If $Lz$ stands for the Poisson transform of $L N$, then we show that $L N - LN ≃ 1.29·10^-4 \cos 2 π \log 2 N + 0.698$.

Keywords : random access communication collision resolution time tree algorithm

Author: Laszlo Gyorfi - Sándor Gyori -

Source: https://hal.archives-ouvertes.fr/