A branching process approach to compute the delay and energy efficiency of tree algorithms with free access
This paper presents a branching process approach to determine the main performance measures of a variety of conflict resolution algorithms known as tree algorithms with free access. In particular we present an efficient approach to calculate the mean delay, number of transmission attempts, collision resolution interval length and energy usage with arbitrary precision.