Analysis of d-ary Tree Algorithms with Successive Interference Cancellation
arXiv:2302.08145 · doi:10.1017/jpr.2023.107
Abstract
In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximises throughput. Our method works with many observables and can be used as a blueprint for further analysis.
30 pages, 2 figures, comments welcome