Random Access for Machine-Type Communication Based on Bloom Filtering
暂无分享,去创建一个
[1] SeungJune Yi,et al. Radio Resource Control (RRC) , 2012 .
[2] Kenneth J. Christensen,et al. A new analysis of the false positive rate of a Bloom filter , 2010, Inf. Process. Lett..
[3] Sándor Gyri,et al. Coding for a multiple access OR channel: A survey , 2008 .
[4] Petar Popovski,et al. Assessment of LTE Wireless Access for Monitoring of Energy Distribution in the Smart Grid , 2015, IEEE Journal on Selected Areas in Communications.
[5] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[6] Michael Mitzenmacher,et al. Compressed bloom filters , 2001, PODC '01.
[7] David C. Chu,et al. Polyphase codes with good periodic correlation properties (Corresp.) , 1972, IEEE Trans. Inf. Theory.
[8] Petar Popovski,et al. Massive M2M access with reliability guarantees in LTE systems , 2015, 2015 IEEE International Conference on Communications (ICC).
[9] Kae Won Choi,et al. Hybrid Random Access and Data Transmission Protocol for Machine-to-Machine Communications in Cellular Networks , 2015, IEEE Transactions on Wireless Communications.
[10] Sándor Györi,et al. Coding for a multiple access OR channel: A survey , 2005, Discret. Appl. Math..
[11] Petar Popovski,et al. Efficient LTE access with collision resolution for massive M2M communications , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).
[12] Petar Popovski,et al. Code‐expanded radio access protocol for machine‐to‐machine communications , 2013, Trans. Emerg. Telecommun. Technol..