Estimating the multiplicities of conflicts in multiple access channels

@article{Greenberg1983EstimatingTM,
  title={Estimating the multiplicities of conflicts in multiple access channels},
  author={Albert G. Greenberg and Richard E. Ladner},
  journal={24th Annual Symposium on Foundations of Computer Science (sfcs 1983)},
  year={1983},
  pages={383-392}
}
A conflict of multiplicity k occurs when k stations transmit simultaneously to a multiple access channel. As a result, all stations receive feedback indicating whether k is 0, 1, or is ≥ 2. If k = 1 the transmission succeeds, whereas if k ≥ 2 all the transmissions fail. In general, no a priori information about k is available. We present and analyze an algorithm that enables the conflicting stations to cooperatively compute a statistical estimate of k, at small cost, as a function of the… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS