Abstract
Mosely and Humblet have obtained an efficient Contention Resolution Algorithm for transmission scheduling in a multi-user collision channel with ternary feedback (idle, success, collision). In this letter, a recursion for the expected value of the algorithm cycle delay is shown to reduce the computation of the efficiency and optimum partition functions to a simple optimization problem.
Original language | English (US) |
---|---|
Pages (from-to) | 613-614 |
Number of pages | 2 |
Journal | Proceedings of the IEEE |
Volume | 74 |
Issue number | 4 |
DOIs | |
State | Published - Apr 1986 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Electrical and Electronic Engineering