Design and analysis of cross-layer tree algorithms for wireless random access

Xin Wang, Yingqun Yu, Georgios B. Giannakis

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on successive interference cancellation (SIC) with first success (FS). BEB and SICTA/FS complement each other nicely in enabling the novel protocol to attain a maximum stable throughput (MST) as high as 0.6 without packet loss. Although BEB-SICTA/FS avoids the deadlock problem caused by the error propagation commonly present in successive interference cancellation (SIC) algorithms, it may still suffer from deadlock effects induced by the "level skipping" caused by harsh wireless fading effects. We further develop a novel BEB-SICTA/F1 protocol, which is a modified version of BEB-SICTA/FS. Analysis and simulations demonstrate that this simple modification leads to high-throughput random access while completely avoiding deadlock problems.

Original languageEnglish (US)
Article number4472009
Pages (from-to)909-919
Number of pages11
JournalIEEE Transactions on Wireless Communications
Volume7
Issue number3
DOIs
StatePublished - Mar 2008

Bibliographical note

Funding Information:
Manuscript received August 31, 2006; revised February 21, 2007; accepted June 11, 2007. The associate editor coordinating the review of this paper and approving it for publication was R. Negi. Work in this paper was supported in part by the USDoD ARO under Grant W911NF-05-1-0283 and was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.

Keywords

  • Binary exponential backoff
  • Random access
  • Successive interference cancellation
  • Tree algorithm

Fingerprint

Dive into the research topics of 'Design and analysis of cross-layer tree algorithms for wireless random access'. Together they form a unique fingerprint.

Cite this