Poisson multiple-access contention with binary feedback

DOI10.1109/TIT.1984.1056956MaRDI QIDQ3216553zbMATH OpenFDO

Authors Nader Mehravari, Toby Berger

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/TIT.1984.1056956

zbMATH Keywords

confusion resolution algorithmspacket-switched channelPoisson infinite-user modelrandom multiple-access

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• Random multiple access in binary feedback channel
• A perspective on multiaccess channels
• Random multiple access in a channel with binary ``success-no success feedback
• Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
• The collision channel without feedback

Cited in

(10)

• A stack protocol of CTM type with quartet feedback
• A characterization of digital search trees from the successful search viewpoint
• Spatially decentralized protocols in random multiple access networks
• On stability of multiple access systems with minimal feedback
• Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback
• Random multiple access in a channel with binary ``success-no success feedback
• The collision channel without feedback
• Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
• On ergodic algorithms in random multiple access systems with ``success-failure feedback
• Optimal channel utilization with limited feedback

This page was built for publication: Poisson multiple-access contention with binary feedback

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