On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm

DOI10.1016/0096-3003(92)90018-VMaRDI QIDQ1186995zbMATH OpenFDO

Authors Ulrich Schmid

Publication date 28 June 1992

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(92)90018-V

zbMATH Keywords

random multiple access broadcast channelsslotted ALOHA collision resolution algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The average CRI-length of a controlled ALOHA collision resolution algorithm
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• The instability time distribution behavior of slotted ALOHA

Cites work

• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• A perspective on multiaccess channels
• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 3176961 (Why is no real title available?)
• Singularity Analysis of Generating Functions

Cited in

(3)

• The average CRI-length of a controlled ALOHA collision resolution algorithm
• ALOHA With Collision Resolution (ALOHA-CR): Theory and Software Defined Radio Implementation
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

This page was built for publication: On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm

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