Analysis of Tree-Algorithms with Multi-Packet Reception
| Autor: | H. Murat Gursu, Yash Deshpande, Cedomir Stefanovic, Wolfgang Kellerer |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Network packet Computer science Information Theory (cs.IT) Computer Science - Information Theory 05 social sciences 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Poisson distribution ddc Computer Science - Networking and Internet Architecture symbols.namesake Tree (data structure) Tree traversal 0508 media and communications 0202 electrical engineering electronic engineering information engineering symbols Throughput (business) Algorithm Decoding methods |
| Zdroj: | Stefanovic, C, Gursu, H M, Deshpande, Y & Kellerer, W 2020, Analysis of Tree-Algorithms with Multi-Packet Reception . in GLOBECOM 2020-2020 IEEE Global Communications Conference ., 9322082, IEEE, IEEE Global Communications Conference (GLOBECOM), pp. 1-6, GLOBECOM 2020-2020 IEEE Global Communications Conference, Taipei, Taiwan, Province of China, 07/12/2020 . https://doi.org/10.1109/GLOBECOM42002.2020.9322082 GLOBECOM |
| DOI: | 10.1109/GLOBECOM42002.2020.9322082 |
| Popis: | 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 single-reception 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. Published in : GLOBECOM 2020 - 2020 IEEE Global Communications Conference |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|