A deadlock-free high-throughput tree algorithm for random access over fading channels

Xin Wang, Yingqun Yu, Georgios B. Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We recently proposed a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA), which relies on successive interference cancellation (SIC) with first success (FS). It was shown that BEB and SICTA/FS complement each other nicely and the proposed protocol can afford a maximum stable throughput (MST) as high as 0.6 without packet loss. However, although BEB-SICTA/FS avoids the deadlock problem caused by the error propagation of successive interference cancellation (SIC), it may still suffer from deadlock effects induced by the "level skipping" under harsh wireless channels. In this paper, we develop a novel BEB-SICTA/F1 protocol, which is a modified version of BEB-SICTA/FS. Our analysis and simulations demonstrate that this simple modification can afford high-throughput random access while completely avoiding deadlock problems. 1

Original languageEnglish (US)
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages420-425
Number of pages6
ISBN (Print)1424403502, 9781424403509
DOIs
StatePublished - Jan 1 2006
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Publication series

Name2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

Fingerprint

Dive into the research topics of 'A deadlock-free high-throughput tree algorithm for random access over fading channels'. Together they form a unique fingerprint.

Cite this