An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink

Quirin Vogel; Yash Deshpande; Cedomir Stefanovicl; Wolfgang Kellerer

doi:10.1109/IEEECONF59524.2023.10477014

An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink

Quirin Vogel, Yash Deshpande, Cedomir Stefanovicl, Wolfgang Kellerer

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

Abstract

In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation (IC) can be performed both by the access point (AP), as in SICTA, but also by the users. Specifically, after every collision slot, the AP broadcasts the observed collision as feedback. Users who participated in the ^collisi^on then ^attempt to perform IC by subtracting their transmissions from the collision signal. This way, the users can resolve collisions of degree 2 and, using a simple distributed arbitration algorithm based on user IDs, ensure that the next slot will contain just a single transmission. We show that ATIC reaches the asymptotic throughput of 0.924 as the number of initially collided users tends to infinity and reduces the number of collisions and packet delay. We also compare ATIC with other tree algorithms and indicate the extra feedback resources it requires.

Original language	English
Title of host publication	Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023
Editors	Michael B. Matthews
Number of pages	8
Publisher	IEEE Computer Society Press
Publication date	2023
Pages	72-79
ISBN (Electronic)	9798350325744
DOIs	https://doi.org/10.1109/IEEECONF59524.2023.10477014
Publication status	Published - 2023
Event	57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023 - Pacific Grove, United States Duration: 29 Oct 2023 → 1 Nov 2023

Conference

Conference	57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023
Country/Territory	United States
City	Pacific Grove
Period	29/10/2023 → 01/11/2023

Series	Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN	1058-6393

Bibliographical note

Publisher Copyright:
© 2023 IEEE.

Keywords

5G
medium access algorithms
random access
wireless communications

Access to Document

10.1109/IEEECONF59524.2023.10477014

http://arxiv.org/pdf/2308.15158

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

Vogel, Quirin ; Deshpande, Yash ; Stefanovicl, Cedomir et al. / An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink. Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023. editor / Michael B. Matthews. IEEE Computer Society Press, 2023. pp. 72-79 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

@inproceedings{33b04b911606406cb789023448a8d02f,

title = "An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink",

abstract = "In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation (IC) can be performed both by the access point (AP), as in SICTA, but also by the users. Specifically, after every collision slot, the AP broadcasts the observed collision as feedback. Users who participated in the collision then attempt to perform IC by subtracting their transmissions from the collision signal. This way, the users can resolve collisions of degree 2 and, using a simple distributed arbitration algorithm based on user IDs, ensure that the next slot will contain just a single transmission. We show that ATIC reaches the asymptotic throughput of 0.924 as the number of initially collided users tends to infinity and reduces the number of collisions and packet delay. We also compare ATIC with other tree algorithms and indicate the extra feedback resources it requires.",

keywords = "5G, medium access algorithms, random access, wireless communications",

author = "Quirin Vogel and Yash Deshpande and Cedomir Stefanovicl and Wolfgang Kellerer",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023 ; Conference date: 29-10-2023 Through 01-11-2023",

year = "2023",

doi = "10.1109/IEEECONF59524.2023.10477014",

language = "English",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society Press",

pages = "72--79",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023",

address = "United States",

}

Vogel, Q, Deshpande, Y, Stefanovicl, C & Kellerer, W 2023, An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink. in MB Matthews (ed.), Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023. IEEE Computer Society Press, Conference Record - Asilomar Conference on Signals, Systems and Computers, pp. 72-79, 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023, Pacific Grove, United States, 29/10/2023. https://doi.org/10.1109/IEEECONF59524.2023.10477014

An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink. / Vogel, Quirin; Deshpande, Yash; Stefanovicl, Cedomir et al.
Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023. ed. / Michael B. Matthews. IEEE Computer Society Press, 2023. p. 72-79 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink

AU - Vogel, Quirin

AU - Deshpande, Yash

AU - Stefanovicl, Cedomir

AU - Kellerer, Wolfgang

PY - 2023

Y1 - 2023

N2 - In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation (IC) can be performed both by the access point (AP), as in SICTA, but also by the users. Specifically, after every collision slot, the AP broadcasts the observed collision as feedback. Users who participated in the collision then attempt to perform IC by subtracting their transmissions from the collision signal. This way, the users can resolve collisions of degree 2 and, using a simple distributed arbitration algorithm based on user IDs, ensure that the next slot will contain just a single transmission. We show that ATIC reaches the asymptotic throughput of 0.924 as the number of initially collided users tends to infinity and reduces the number of collisions and packet delay. We also compare ATIC with other tree algorithms and indicate the extra feedback resources it requires.

AB - In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference Cancellation (IC) can be performed both by the access point (AP), as in SICTA, but also by the users. Specifically, after every collision slot, the AP broadcasts the observed collision as feedback. Users who participated in the collision then attempt to perform IC by subtracting their transmissions from the collision signal. This way, the users can resolve collisions of degree 2 and, using a simple distributed arbitration algorithm based on user IDs, ensure that the next slot will contain just a single transmission. We show that ATIC reaches the asymptotic throughput of 0.924 as the number of initially collided users tends to infinity and reduces the number of collisions and packet delay. We also compare ATIC with other tree algorithms and indicate the extra feedback resources it requires.

KW - 5G

KW - medium access algorithms

KW - random access

KW - wireless communications

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

U2 - 10.1109/IEEECONF59524.2023.10477014

DO - 10.1109/IEEECONF59524.2023.10477014

M3 - Article in proceeding

AN - SCOPUS:85190387879

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 72

EP - 79

BT - Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023

A2 - Matthews, Michael B.

PB - IEEE Computer Society Press

T2 - 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023

Y2 - 29 October 2023 through 1 November 2023

ER -

Vogel Q, Deshpande Y, Stefanovicl C, Kellerer W. An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink. In Matthews MB, editor, Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023. IEEE Computer Society Press. 2023. p. 72-79. (Conference Record - Asilomar Conference on Signals, Systems and Computers). doi: 10.1109/IEEECONF59524.2023.10477014

An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink

Abstract

Conference

Bibliographical note

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this