Log In Sign Up

Tree-Algorithms with Multi-Packet Reception and Successive Interference Cancellation

by   Cedomir Stefanovic, et al.

In this paper, we perform a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC). We first derive the basic performance parameters, which are the expected length of the collision resolution interval and the normalized throughput, conditioned on the number of contending users. We then study their asymptotic behaviour, identifying an oscillatory component that amplifies with the increase in MPR. In the next step, we derive the throughput for the gated and windowed access, assuming Poisson arrivals. We show that for windowed access, the bound on maximum stable normalized throughput increases with the increase in MPR. We also analyze d-ary tree algorithms with MPR and SIC, showing deficiencies of the analysis performed in the seminal paper on tree-algorithms with SIC by Yu and Giannakis.


page 1

page 2

page 3

page 4


On d-ary tree algorithms with successive interference cancellation

In this paper, we outline the approach for the derivation of the length ...

Analysis of Tree-Algorithms with Multi-Packet Reception

In this paper, we analyze binary-tree algorithms in a setup in which the...

Throughput of CDM-based Random Access With SINR Capture

Code division multiplexing (CDM)-based random access is used in many pra...

Stable Throughput Region of the Two-User Interference Channel

The stable throughput region of the two-user interference channel is inv...

Breaking the Unit Throughput Barrier in Distributed Systems

A multi-level random power transmit strategy that is used in conjunction...

Boost Your CotS IEEE 802.15.4 Network with Inter-Slot Interference Cancellation for Industrial IoT

The current cellular standardization for 5G is working towards wireless ...

Effects of MAC Parameters on the Performance of IEEE 802.11 DCF in NS-3

This paper presents the design procedure of the NS-3 script for WLAN tha...