High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

DOI10.1109/TIT.2007.909080MaRDI QIDQ3549016zbMATH OpenOpenAlexFDO

Authors Yingqun Yu, Georgios B. Giannakis

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.909080

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Throughput analysis of slotted ALOHA with cooperative transmission using successive interference cancellation
• Modern random access protocols
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• On the throughput of degenerate intersection and first-come first-served collision resolution algorithms
• Random access algorithms with multiple reception capability and \(n\)-ary feedback channel

Cited in

(8)

• Protograph LDPC code design for asynchronous random access
• Throughput analysis of slotted ALOHA with cooperative transmission using successive interference cancellation
• Modern random access protocols
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation
• Throughput and delay analysis of an opportunistic tree algorithm
• Conflict-resolving tree algorithm stable to incomplete interference damping
• Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
• Random multiple access in a vector disjunctive channel

This page was built for publication: High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549016)