A robust high-throughput tree algorithm using successive interference cancellation

Xin Wang; Yingqun Yu; Georgios B Giannakis

doi:10.1109/GLOCOM.2005.1578442

A robust high-throughput tree algorithm using successive interference cancellation

Xin Wang, Yingqun Yu, Georgios B Giannakis

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. By migrating physical layer benefits to the medium access control (MAC) through a cross-layer approach, SICTA can afford stable throughput as high as 0.693. However, SICTA may lead to deadlocks caused by channel fading and error propagation in error-prone wireless networks. To mitigate such effects, we put forth a truncated version of SICTA that we term SICTA/FS (SICTA with first success). We establish using analysis and simulations that while providing high throughput, SICTA/FS is robust to errors, it is easy to implement, and can be readily incorporated to existing standards.

Original language	English (US)
Title of host publication	GLOBECOM'05
Subtitle of host publication	IEEE Global Telecommunications Conference, 2005
Pages	3597-3601
Number of pages	5
Volume	6
DOIs	https://doi.org/10.1109/GLOCOM.2005.1578442
State	Published - Dec 1 2005
Event	GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States Duration: Nov 28 2005 → Dec 2 2005

Other

Other	GLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Country/Territory	United States
City	St. Louis, MO
Period	11/28/05 → 12/2/05

Access

10.1109/GLOCOM.2005.1578442

OpenUrl availability

Full text

Cite this

@inproceedings{4b132f0f18794df3b4639b12a3a57be5,

title = "A robust high-throughput tree algorithm using successive interference cancellation",

abstract = "A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. By migrating physical layer benefits to the medium access control (MAC) through a cross-layer approach, SICTA can afford stable throughput as high as 0.693. However, SICTA may lead to deadlocks caused by channel fading and error propagation in error-prone wireless networks. To mitigate such effects, we put forth a truncated version of SICTA that we term SICTA/FS (SICTA with first success). We establish using analysis and simulations that while providing high throughput, SICTA/FS is robust to errors, it is easy to implement, and can be readily incorporated to existing standards.",

author = "Xin Wang and Yingqun Yu and Giannakis, {Georgios B}",

year = "2005",

month = dec,

day = "1",

doi = "10.1109/GLOCOM.2005.1578442",

language = "English (US)",

isbn = "0780394143",

volume = "6",

pages = "3597--3601",

booktitle = "GLOBECOM'05",

note = "GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 ; Conference date: 28-11-2005 Through 02-12-2005",

}

TY - GEN

T1 - A robust high-throughput tree algorithm using successive interference cancellation

AU - Wang, Xin

AU - Yu, Yingqun

AU - Giannakis, Georgios B

PY - 2005/12/1

Y1 - 2005/12/1

N2 - A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. By migrating physical layer benefits to the medium access control (MAC) through a cross-layer approach, SICTA can afford stable throughput as high as 0.693. However, SICTA may lead to deadlocks caused by channel fading and error propagation in error-prone wireless networks. To mitigate such effects, we put forth a truncated version of SICTA that we term SICTA/FS (SICTA with first success). We establish using analysis and simulations that while providing high throughput, SICTA/FS is robust to errors, it is easy to implement, and can be readily incorporated to existing standards.

AB - A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. By migrating physical layer benefits to the medium access control (MAC) through a cross-layer approach, SICTA can afford stable throughput as high as 0.693. However, SICTA may lead to deadlocks caused by channel fading and error propagation in error-prone wireless networks. To mitigate such effects, we put forth a truncated version of SICTA that we term SICTA/FS (SICTA with first success). We establish using analysis and simulations that while providing high throughput, SICTA/FS is robust to errors, it is easy to implement, and can be readily incorporated to existing standards.

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

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

U2 - 10.1109/GLOCOM.2005.1578442

DO - 10.1109/GLOCOM.2005.1578442

M3 - Conference contribution

AN - SCOPUS:33846567121

SN - 0780394143

SN - 9780780394148

VL - 6

SP - 3597

EP - 3601

BT - GLOBECOM'05

T2 - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

Y2 - 28 November 2005 through 2 December 2005

ER -

A robust high-throughput tree algorithm using successive interference cancellation

Abstract

Other

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this