Random Multiple-Access Communication and Group Testing
- 1 July 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 32 (7), 769-779
- https://doi.org/10.1109/tcom.1984.1096146
Abstract
We study the application of group testing to the design of efficient algorithms for random multiple-access communication systems. Both direct transmission and reservation systems are considered for various types of channel feedback. We propose and analyze algorithms based on conventional and generalized group testing techniques. The proposed algorithms outperform TDMA and algorithms based on binary tree search and possess certain optimality properties.Keywords
This publication has 15 references indexed in Scilit:
- A Collision Resolution Protocol for Random Access Channels with Energy DetectorsIEEE Transactions on Communications, 1982
- Generalized TDMA: The Multi-Accessing Tree ProtocolIEEE Transactions on Communications, 1979
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978
- An Optimum Nested Procedure in Binomial Group TestingBiometrics, 1976
- A Generalized Binomial Group Testing ProblemJournal of the American Statistical Association, 1975
- On Finding a Single Defective in Binomial Group TestingJournal of the American Statistical Association, 1974
- The cutoff point for group testingCommunications on Pure and Applied Mathematics, 1960
- On the Detection of Defective Members of Large PopulationsThe Annals of Mathematical Statistics, 1957
- The Detection of Defective Members of Large PopulationsThe Annals of Mathematical Statistics, 1943