Analysis of Tree-Algorithms with Multi-Packet Reception

Cedomir Stefanovic, H. Murat Gursu, Yash Deshpande, Wolfgang Kellerer

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review


In this paper, we analyze binary-tree algorithms in a setup in which the receiver can perform multi-packet reception (MPR) of up to and including K packets simultaneously. The analysis addresses both traffic-independent performance as well as performance under Poisson arrivals. For the former case, we show that the throughput, when normalized with respect to the assumed linear increase in resources required to achieve K-MPR capability, tends to the same value that holds for the singlereception setup. However, when coupled with Poisson arrivals in the windowed access scheme, the normalized throughput increases with K, and we present evidence that it asymptotically tends to 1. We also provide performance results for the modified tree algorithm with K-MPR in the clipped access scheme. To the best of our knowledge, this is the first paper that provides an analytical treatment and a number of fundamental insights in the performance of tree-algorithms with MPR.

Original languageEnglish
Title of host publicationGLOBECOM 2020 - 2020 IEEE Global Communications Conference
Number of pages6
Publication date25 Jan 2021
Article number9322082
ISBN (Print)978-1-7281-8299-5
ISBN (Electronic)978-1-7281-8298-8
Publication statusPublished - 25 Jan 2021
EventGLOBECOM 2020 - 2020 IEEE Global Communications Conference - Taipei, Taiwan, Province of China
Duration: 7 Dec 202011 Dec 2020


ConferenceGLOBECOM 2020 - 2020 IEEE Global Communications Conference
CountryTaiwan, Province of China

Fingerprint Dive into the research topics of 'Analysis of Tree-Algorithms with Multi-Packet Reception'. Together they form a unique fingerprint.

Cite this