Probabilistic handshake in all-to-all broadcast coded slotted ALOHA
暂无分享,去创建一个
Petar Popovski | Alexandre Graell i Amat | Cedomir Stefanovic | Fredrik Brannstrom | Mikhail Ivanov | P. Popovski | Č. Stefanović | F. Brannstrom | A. G. Amat | Mikhail Ivanov
[1] Lawrence G. Roberts,et al. ALOHA packet system with and without slots and capture , 1975, CCRV.
[2] Ieee Staff,et al. 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) , 2015 .
[3] Petar Popovski,et al. Error Floor Analysis of Coded Slotted ALOHA Over Packet Erasure Channels , 2015, IEEE Communications Letters.
[4] Petar Popovski,et al. ALOHA Random Access that Operates as a Rateless Code , 2013, IEEE Transactions on Communications.
[5] Gianluigi Liva,et al. Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.
[6] Carl A. Sunshine,et al. Connection Management in Transport Protocols , 1978, Comput. Networks.
[7] Petar Popovski,et al. All-to-all broadcast for vehicular networks based on coded slotted ALOHA , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).
[8] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[9] Marco Chiani,et al. High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA , 2011, 2011 IEEE International Conference on Communications (ICC).
[10] Petar Popovski,et al. Coded random access: applying codes on graphs to design random access protocols , 2014, IEEE Communications Magazine.