Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

IEEE Transactions on Information Theory

Volumn 61, Issue 12, 2015, Pages 6815-6832

  Paolini, Enrico ^a   Liva, Gianluigi ^b   Chiani, Marco ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Codes on graphs; collision channel; density evolution; erasure channel; interference cancellation; iterative decoding; random access

Indexed keywords

CODES (SYMBOLS); DECODING; GRAPHIC METHODS; ITERATIVE METHODS; OPTICAL COMMUNICATION; SATELLITE COMMUNICATION SYSTEMS;

CODES ON GRAPHS; COLLISION CHANNELS; DENSITY EVOLUTION; ERASURE CHANNELS; INTERFERENCE CANCELLATION; RANDOM ACCESS;

ITERATIVE DECODING;

EID: 84959450491     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2015.2492579     Document Type: Conference Paper

References (44)

1. N. Abramson, "The ALOHA system: Another alternative for computer communications," in Proc. Fall Joint Comput. Conf., 1970, pp. 281-285.
2. L. G. Roberts, "ALOHA packet system with and without slots and capture," ACM SIGCOMM Comput. Commun. Rev., vol. 5, no. 2, pp. 28-42, 1975.
3. N. Abramson, "Multiple access in wireless digital networks," Proc. IEEE, vol. 82, no. 9, pp. 1360-1370, Sep. 1994.
4. D. P. Bertsekas and R. G. Gallager, Data Networks. Upper Saddle River, NJ, USA: Prentice-Hall, 1987.
5. C. Morlet, A. B. Alamañac, G. Gallinaro, L. Erup, P. Takats, and A. Ginesi, "Introduction of mobility aspects for DVB-S2/RCS broadband systems," Space Commun., vol. 21, nos. 1-2, pp. 5-17, Dec. 2007.
6. W. Szpankowski, "Stability conditions for some distributed systems: Buffered random access systems," Adv. Appl. Probab., vol. 26, no. 2, pp. 498-515, Jun. 1994.
7. A. Ephremides and B. Hajek, "Information theory and communication networks: An unconsummated union," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2416-2434, Oct. 1998.
8. R. R. Rao and A. Ephremides, "On the stability of interacting queues in a multiple-access system," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 918-930, Sep. 1988.
9. J. Luo and A. Ephremides, "On the throughput, capacity, and stability regions of random multiple access," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2593-2607, Jun. 2006.
10. A. Fanous and A. Ephremides, "Stable throughput in a cognitive wireless network," IEEE J. Sel. Areas Commun., vol. 31, no. 3, pp. 523-533, Mar. 2013.
11. E. Casini, R. De Gaudenzi, and O. del Rio Herrero, "Contention resolution diversity slotted ALOHA (CRDSA): An enhanced random access scheme for satellite access packet networks," IEEE Trans. Wireless Commun., vol. 6, no. 4, pp. 1408-1419, Apr. 2007.
12. G. L. Choudhury and S. S. Rappaport, "Diversity ALOHA-A random access scheme for satellite communications," IEEE Trans. Commun., vol. 31, no. 3, pp. 450-457, Mar. 1983.
13. Y. Yu and G. B. Giannakis, "High-throughput random access using successive interference cancellation in a tree algorithm," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4628-4639, Dec. 2007.
14. S. Gollakota and D. Katabi, "ZigZag decoding: Combating hidden terminals in wireless networks," in Proc. ACM SIGCOMM Conf. Data Commun., Seattle, WA, USA, 2008, pp. 159-170.
15. J. L. Massey, "Collision-resolution algorithms and random-access communications," in Multi-User Communication Systems (Courses and Lectures), vol. 265, G. Longo, Ed. New York, NY, USA: Springer-Verlag, 1981.
16. G. Liva, "Graph-based analysis and optimization of contention resolution diversity slotted ALOHA," IEEE Trans. Commun., vol. 59, no. 2, pp. 477-487, Feb. 2011.
17. A. S. Tehrani, A. G. Dimakis, and M. J. Neely, "SigSag: Iterative detection through soft message-passing," IEEE J. Sel. Topics Signal Process., vol. 5, no. 8, pp. 1512-1523, Dec. 2011.
18. T. J. Richardson and R. L. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
19. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
20. C. Stefanović, P. Popovski, and D. Vukobratovic, "Frameless ALOHA protocol for wireless networks," IEEE Commun. Lett., vol. 16, no. 12, pp. 2087-2090, Dec. 2012.
21. C. Stefanović and P. Popovski, "ALOHA random access that operates as a rateless code," IEEE Trans. Commun., vol. 61, no. 11, pp. 4653-4662, Nov. 2013.
22. K. R. Narayanan and H. D. Pfister, "Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy," in Proc. 7th Int. Symp. Turbo Codes Iterative Inf. Process., Gothenburg, Sweden, Aug. 2012, pp. 136-139.
23. C. Kissling, "Performance enhancements for asynchronous random access protocols over satellite," in Proc. IEEE Int. Conf. Commun., Kyoto, Japan, Jun. 2011, pp. 1-6.
24. Z. Shi and C. Schlegel, "Iterative multiuser detection and error control code decoding in random CDMA," IEEE Trans. Signal Process., vol. 54, no. 5, pp. 1886-1895, May 2006.
25. J. L. Massey and P. Mathys, "The collision channel without feedback," IEEE Trans. Inf. Theory, vol. 31, no. 2, pp. 192-204, Mar. 1985.
26. J. Y. N. Hui, "Multiple accessing for the collision channel without feedback," IEEE Trans. Veh. Technol., vol. 33, no. 3, pp. 191-198, Aug. 1984.
27. G. Thomas, "Capacity of the wireless packet collision channel without feedback," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 1141-1144, May 2000.
28. S. Tinguely, M. Rezaeian, and A. J. Grant, "The collision channel with recovery," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3631-3638, Oct. 2005.
29. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
30. K. W. Shum, C. S. Chen, C. W. Sung, and W. S. Wong, "Shiftinvariant protocol sequences for the collision channel without feedback," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3312-3322, Jul. 2009.
31. E. Paolini, M. P. C. Fossorier, and M. Chiani, "Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1651-1672, Apr. 2010.
32. T. Helleseth, T. Kløve, and V. I. Levenshtein, "On the information function of an error-correcting code," IEEE Trans. Inf. Theory, vol. 43, no. 2, pp. 549-557, Mar. 1997.
33. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
34. E. Paolini, M. P. C. Fossorier, and M. Chiani, "Doubly-generalized LDPC codes: Stability bound over the BEC," IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1027-1046, Mar. 2009.
35. M. Ivanov, F. Brännström, A. Graell i Amat, and P. Popovski, "Error floor analysis of coded slotted ALOHA over packet erasure channels," IEEE Commun. Lett., vol. 19, no. 3, pp. 419-422, Mar. 2015.
36. M. Shokrollahi, "Capacity-achieving sequences," in Codes, Systems, and Graphical Models (IMA Volumes in Mathematics and its Applications). New York, NY, USA: Springer-Verlag, 2001, pp. 153-166.
37. K. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization. Berlin, Germany: Springer-Verlag, 2005.
38. S. Kudekar, T. J. Richardson, and R. L. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
39. G. Liva, E. Paolini, M. Lentmaier, and M. Chiani, "Spatially-coupled random access on graphs," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 478-482.
40. A. Munari, M. Heindlmaier, G. Liva, and M. Berioli, "The throughput of slotted Aloha with diversity," in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, USA, Oct. 2013, pp. 698-706.
41. O. del Rio Herrero and R. De Gaudenzi, "A high-performance MAC protocol for consumer broadband satellite systems," in Proc. 27th AIAA Int. Commun. Satellite Syst. Conf., Edinburgh, U.K., Jun. 2009, p. 512.
42. M. Ghanbarinejad and C. Schlegel, "Irregular repetition slotted ALOHA with multiuser detection," in Proc. 10th Annu. Conf. Wireless-Demand Netw. Syst. Services, Banff, AB, Canada, Mar. 2013, pp. 201-205.
43. G. Liva, E. Paolini, B. Matuz, S. Scalise, and M. Chiani, "Short turbo codes over high order fields," IEEE Trans. Commun., vol. 61, no. 6, pp. 2201-2211, Jun. 2013.
44. R. Urbanke and B. Rimoldi, "Coding for the F-adder channel: Two applications of Reed Solomon codes," in Proc. IEEE Int. Symp. Inf. Theory, San Antonio, TX, USA, Jan. 1993, p. 85.