Protocol-sequence-based media-access control with successive interference cancellation (invited paper)
暂无分享,去创建一个
[1] Cedomir Stefanovic,et al. Finite-Length Analysis of Frameless ALOHA , 2016, ArXiv.
[2] Kenneth W. Shum,et al. Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback , 2009, IEEE Transactions on Information Theory.
[3] Wing Shing Wong,et al. Transmission Sequence Design and Allocation for Wide-Area Ad Hoc Networks , 2013, IEEE Transactions on Vehicular Technology.
[4] Kenneth W. Shum,et al. Construction and Applications of CRT Sequences , 2010, IEEE Transactions on Information Theory.
[5] Kenneth W. Shum,et al. On pairwise shift-invariant protocol sequences , 2009, IEEE Communications Letters.
[6] Soung Chang Liew,et al. Coding for network-coded slotted ALOHA , 2015, 2015 IEEE Information Theory Workshop (ITW).
[7] James L. Massey,et al. The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.
[8] Tai-Kuo Woo. FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA , 2016, Wirel. Pers. Commun..
[9] Cedomir Stefanovic,et al. Irregular repetition slotted ALOHA over the Rayleigh block fading channel with capture , 2017, 2017 IEEE International Conference on Communications (ICC).
[10] Gianluigi Liva,et al. Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.
[11] Georgios B. Giannakis,et al. High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm , 2007, IEEE Transactions on Information Theory.
[12] Wing Shing Wong,et al. The zero-error capacity of a collision channel with successive interference cancellation , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[13] Marco Chiani,et al. Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access , 2014, IEEE Transactions on Information Theory.