Skip to Main content Skip to Navigation
New interface
Conference papers

Delay and throughput analysis of tree algorithms for random access over noisy collision channels

Abstract : 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 we 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, we also study the ALOHA-SICTA/FS algorithm and show that it can achieve throughputs of 0.6 or above without packet loss. Additionally, we provide an accurate estimation of the mean packet delay under ALOHA-SICTA/FS using a simple queueing model with vacations. Finally, we indicate that ALOHASICTA/FS suffers from hardly any throughput reduction when the access point stores the last two collision signals only.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 31, 2011 - 11:57:08 AM
Last modification on : Friday, February 25, 2022 - 10:12:40 AM
Long-term archiving on: : Friday, November 9, 2012 - 2:01:09 PM


Files produced by the author(s)


  • HAL Id : inria-00597176, version 1



Benny van Houdt, Robbe Block. Delay and throughput analysis of tree algorithms for random access over noisy collision channels. NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Ghent, Belgium. ⟨inria-00597176⟩



Record views


Files downloads