Random multiple access in binary feedback channel
In the paper random multiple-access algorithms with binary feedback channels are considered. \textit{N. Mehravari's} algorithm [IEEE Trans. Inf. Theory, IT--36, No. 3, 614-622 (1990)] with two types of feedback channel: ``successful transmission-non-successful transmission and ``empty slot-non-empty slot, is analyzed. Two variants of the algorithm differing in the choice of the packet transmission beginning time point are considered. Using standard methods of probabilistic calculus, generation functions and recurrence equation sets, transmission system throughput and upper limits on packet delays for several versions of the algorithm are calculated.
- Random multiple access in a channel with binary ``success-no success feedback
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- On ergodic algorithms in systems of multiple access with partial feedback
- Some new random multiple-access algorithms
- Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
- Random multiple access system with impatient packets
- Improved upper bound for the capacity of the random-access channel
- Block transmission of information in a summing multiple access channel with feedback
- Lower bound on delay in a random multiple access system
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- Random multiple access with known appearance times of successfully transmitted packets
- Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback
- On ergodic algorithms in systems of multiple access with partial feedback
- Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
- Random multiple access in a channel with binary ``success-no success feedback
- scientific article; zbMATH DE number 1717210 (Why is no real title available?)
- Poisson multiple-access contention with binary feedback
- On multiple access channels with feedback (Corresp.)
- scientific article; zbMATH DE number 3865145 (Why is no real title available?)
- scientific article; zbMATH DE number 3874593 (Why is no real title available?)
- Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
- Delay analysis of interval-searching contention resolution algorithms
- Analytic properties of multiple-access trees
- Limited feedback sensing algorithms for the packet broadcast channel
- Optimizing a random access system by biased source blocking
- scientific article; zbMATH DE number 3932930 (Why is no real title available?)
- Delay analysis of the n-ary stack random-access algorithm
- Random multiple access in a vector disjunctive channel
- On ergodic algorithms in random multiple access systems with ``success-failure feedback
- Splitting algorithms in noisy channels with memory
- Allowance for packet propagation time in random multiple access
- Upper bound on the capacity of a packet random multiple access system with errors
This page was built for publication: Random multiple access in binary feedback channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174079)
