The average CRI-length of a controlled ALOHA collision resolution algorithm

DOI10.1016/0304-3975(93)90195-YzbMATH Open0781.68027MaRDI QIDQ1208718FDOQ1208718

Authors: Ulrich Schmid 

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• An analysis of a contention resolution algorithm. Another approach
• An access algorithm for a communication channel

zbMATH Keywords

Mellin transformasymptotic analysisconflict resolution algorithmcontrolled \(S\)-ALOHACRI length

Mathematics Subject Classification ID

Communication theory (94A05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A perspective on multiaccess channels
• Title not available (Why is that?)
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm

Cited In (2)

• 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: The average CRI-length of a controlled ALOHA collision resolution algorithm

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