Some new random multiple-access algorithms
From MaRDI portal
Recommendations
- Randomized and nonrandomized algorithms of random multiple access
- Some Optimal Algorithms of Random Multiple Access
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- scientific article; zbMATH DE number 1222190
- On a random process in multiple access problems
- A Random Multiple-Access Protocol with Spatial Interactions
- scientific article; zbMATH DE number 3713612
- An random multiple access algorithm with finite stack and packet loss
Cited in
(26)- Random multiple packet access: part-and-try algorithm
- Random multiple access in binary feedback channel
- An access algorithm for a communication channel
- 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
- On a random process in multiple access problems
- A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
- Random multiple access with known appearance times of successfully transmitted packets
- Accelerated probing of the data channel -- a new multiple-access principle in local area networks
- Limit theorems for recursive algorithms
- Multiple access with collision resolution by station indices
- Adaptive random access algorithm with improved delay performance
- Delay analysis of interval-searching contention resolution algorithms
- On queueing problems in random-access communications
- Optimizing a random access system by biased source blocking
- Survey of USSR contributions to random multiple-access communications
- Delay analysis of the n-ary stack random-access algorithm
- scientific article; zbMATH DE number 3713612 (Why is no real title available?)
- One stochastic process and its application to multiple access in supercritical region
- scientific article; zbMATH DE number 2086424 (Why is no real title available?)
- \textit{CHIRRUP}: a practical algorithm for unsourced multiple access
- A 0.485 throughput randomized part-and-try algorithm
- Unsourced random access
- Randomized and nonrandomized algorithms of random multiple access
- Allowance for packet propagation time in random multiple access
- Enhancing the performance of random access networks with random packet CDMA and joint detection
This page was built for publication: Some new random multiple-access algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066858)
