On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory

Syed Muhammad Ali; Marko Beko; Dejan Vukobratović; Čedomir Stefanović

doi:10.1109/BalkanCom58402.2023.10167996

On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory

Syed Muhammad Ali^*, Marko Beko, Dejan Vukobratović, Čedomir Stefanović^*

^*Kontaktforfatter

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

Abstract

In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm with the free access in a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC) techniques. We analytically derive the maximum stable throughput of the scheme as well as the mean number of transmission attempts and the mean packet delay in a scenario with Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals.

Originalsprog	Engelsk
Titel	2023 International Balkan Conference on Communications and Networking, BalkanCom 2023
Forlag	IEEE (Institute of Electrical and Electronics Engineers)
Publikationsdato	2023
Artikelnummer	10167996
ISBN (Elektronisk)	9798350339109
DOI	https://doi.org/10.1109/BalkanCom58402.2023.10167996
Status	Udgivet - 2023
Begivenhed	2023 International Balkan Conference on Communications and Networking, BalkanCom 2023 - Istanbul, Tyrkiet Varighed: 5 jun. 2023 → 8 jun. 2023

Konference

Konference	2023 International Balkan Conference on Communications and Networking, BalkanCom 2023
Land/Område	Tyrkiet
By	Istanbul
Periode	05/06/2023 → 08/06/2023

Bibliografisk note

Publisher Copyright:
© 2023 IEEE.

Adgang til dokumentet

10.1109/BalkanCom58402.2023.10167996

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Andre filer og links

Link to publication in Scopus

Citationsformater

Ali, S. M., Beko, M., Vukobratović, D., & Stefanović, Č. (2023). On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory. I 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023 Artikel 10167996 IEEE (Institute of Electrical and Electronics Engineers). https://doi.org/10.1109/BalkanCom58402.2023.10167996

@inproceedings{f4d131e1b69b4ae383287af2a46d0001,

title = "On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory",

abstract = "In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm with the free access in a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC) techniques. We analytically derive the maximum stable throughput of the scheme as well as the mean number of transmission attempts and the mean packet delay in a scenario with Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals.",

author = "Ali, {Syed Muhammad} and Marko Beko and Dejan Vukobratovi{\'c} and {\v C}edomir Stefanovi{\'c}",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023 ; Conference date: 05-06-2023 Through 08-06-2023",

year = "2023",

doi = "10.1109/BalkanCom58402.2023.10167996",

language = "English",

booktitle = "2023 International Balkan Conference on Communications and Networking, BalkanCom 2023",

publisher = "IEEE (Institute of Electrical and Electronics Engineers)",

address = "United States",

}

Ali, SM, Beko, M, Vukobratović, D & Stefanović, Č 2023, On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory. i 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023., 10167996, IEEE (Institute of Electrical and Electronics Engineers), 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023, Istanbul, Tyrkiet, 05/06/2023. https://doi.org/10.1109/BalkanCom58402.2023.10167996

On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory. / Ali, Syed Muhammad; Beko, Marko; Vukobratović, Dejan et al.
2023 International Balkan Conference on Communications and Networking, BalkanCom 2023. IEEE (Institute of Electrical and Electronics Engineers), 2023. 10167996.

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

TY - GEN

T1 - On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory

AU - Ali, Syed Muhammad

AU - Beko, Marko

AU - Vukobratović, Dejan

AU - Stefanović, Čedomir

PY - 2023

Y1 - 2023

N2 - In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm with the free access in a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC) techniques. We analytically derive the maximum stable throughput of the scheme as well as the mean number of transmission attempts and the mean packet delay in a scenario with Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals.

AB - In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm with the free access in a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC) techniques. We analytically derive the maximum stable throughput of the scheme as well as the mean number of transmission attempts and the mean packet delay in a scenario with Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals.

UR - http://www.scopus.com/inward/record.url?scp=85165719605&partnerID=8YFLogxK

U2 - 10.1109/BalkanCom58402.2023.10167996

DO - 10.1109/BalkanCom58402.2023.10167996

M3 - Article in proceeding

AN - SCOPUS:85165719605

BT - 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023

PB - IEEE (Institute of Electrical and Electronics Engineers)

T2 - 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023

Y2 - 5 June 2023 through 8 June 2023

ER -

On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory

Abstract

Konference

Bibliografisk note

Adgang til dokumentet

AUB Link

Andre filer og links

Fingeraftryk

Citationsformater