Computation of the efficiency of the Mosely-Humblet contention resolution algorithm: A simple method
暂无分享,去创建一个
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.
[1] Pierre A. Humblet,et al. A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..
[2] BORIS S. TSYBAKOV. Survey of USSR contributions to random multiple-access communications , 1985, IEEE Trans. Inf. Theory.