Analysis of Tree-Algorithms with Multi-Packet Reception

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

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelGLOBECOM 2020 - 2020 IEEE Global Communications Conference
Antal sider6
ForlagIEEE
Publikationsdato2020
Sider1-6
Artikelnummer9322082
ISBN (Trykt)978-1-7281-8299-5
ISBN (Elektronisk)978-1-7281-8298-8
DOI
StatusUdgivet - 2020
BegivenhedGLOBECOM 2020 - 2020 IEEE Global Communications Conference - Taipei, Taiwan
Varighed: 7 dec. 202011 dec. 2020

Konference

KonferenceGLOBECOM 2020 - 2020 IEEE Global Communications Conference
LandTaiwan
ByTaipei
Periode07/12/202011/12/2020
NavnIEEE Global Communications Conference (GLOBECOM)
ISSN1930-529X

Fingeraftryk Dyk ned i forskningsemnerne om 'Analysis of Tree-Algorithms with Multi-Packet Reception'. Sammen danner de et unikt fingeraftryk.

Citationsformater