Randomized and nonrandomized algorithms of random multiple access
The paper concerns the randomized (R) and nonrandomized (NR) random multiple access algorithms. The author defines these two classes of random access protocols taking into account the probability p, that a packet is sent over a channel in the current slot. The analysis is restricted to systems with Poisson input streams. Under this condition the author constructs, for any R-algorithm an equivalent NR-algorithm with the same rate, delay time and other parameters. Furthermore he determines R-and NR-algorithms that are optimal in the sense of the maximum rate. It has been shown that for a Poisson input stream, any upper bounds for the rate of the optimal NR-algorithms are also upper bounds for the rate of the optimal R-algorithms. Examples of representation of some known R-algorithms in an NR-form are also given.
- Some new random multiple-access algorithms
- Some Optimal Algorithms of Random Multiple Access
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- On a random process in multiple access problems
- Random matrix methods for design of multiuser communication systems
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Random sequence multisets for synchronous code-division multiple-access channels
- Random multiple access in a vector disjunctive channel
- scientific article; zbMATH DE number 1222190
- Some new random multiple-access algorithms
- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
- Random multiple packet access: part-and-try algorithm
- Effect on an unbalanced random number generator on the throughput of a random access local area
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- Optimizing a random access system by biased source blocking
- Survey of USSR contributions to random multiple-access communications
- Random multiple access in a vector disjunctive channel
- scientific article; zbMATH DE number 3713612 (Why is no real title available?)
- On ergodic algorithms in random multiple access systems with ``success-failure feedback
- Random Time and Frequency Hopping for Infinite User Population
- A 0.485 throughput randomized part-and-try algorithm
This page was built for publication: Randomized and nonrandomized algorithms of random multiple access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753784)
