Delay and Throughput Analysis of Tree Algorithms for Random Access Over Noisy Collision Channels
The Successive Interference Cancellation Tree Algorithm with First Success (SICTA/FS) was specifically designed as a random access protocol over noisy collision channels. Given J users with an infinite buffer and subject to Poisson arrivals, SICTA/FS achieves throughputs as high as 0:6 if packet losses are allowed (up to 20%), while without packet losses its throughput quickly degrades as the number of users J increases. In this paper, the authors indicate that SICTA/FS may remain stable for a considerable amount of time before becoming unstable when the arrival rate exceeds the maximum stable throughput. More importantly, they also study the ALOHA-SICTA/FS algorithm and show that it can achieve throughputs of 0.6 or above without packet loss.