Article contents
A Simple Proof of Instability of a Random-Access Communication Channel
Published online by Cambridge University Press: 27 July 2009
Abstract
We give an extremely simple argument to prove that in infinite user-commurlication channels, under the Aloha protocol, the number of successful transmissions is finite with probability 1. The same result is then shown to hold for those back-off protocols whose transmission probabilities are bounded away from 0.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 2 , Issue 3 , July 1988 , pp. 383 - 385
- Copyright
- Copyright © Cambridge University Press 1988
References
Referenecs
- 2
- Cited by