Poisson multiple-access contention with binary feedback
暂无分享,去创建一个
[1] Mart Molle,et al. On the capacity of infinite population multiple access protocols , 1982, IEEE Trans. Inf. Theory.
[2] Bruce E. Hajek,et al. A new upper bound to the throughput of a multi-access broadcast channel , 1982, IEEE Trans. Inf. Theory.
[3] J. Capetanakis,et al. Generalized TDMA: The Multi-Accessing Tree Protocol , 1979, IEEE Trans. Commun..
[4] J. Massey. Collision-Resolution Algorithms and Random-Access Communications , 1981 .
[5] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.
[6] Toby Berger,et al. The Poisson Multiple-Access Conflict Resolution Problem , 1981 .
[7] Donald F. Towsley,et al. Random Multiple-Access Communication and Group Testing , 1984, IEEE Trans. Commun..