Near-far effect on coded slotted ALOHA

Motivated by scenario requirements for 5G cellular networks, we study one of the candidate protocols for massive random access: the family of random access methods known as Coded Slotted ALOHA (CSA). A recent trend in research has explored aspects of such methods in various contexts, but one aspect has not been fully taken into account: the impact of path loss, which is a major design constraint in long-range wireless networks. In this article, we explore the behavior of CSA, by focusing on the path loss component correlated to the distance to the base station. Path loss provides opportunities for capture, improving the performance of CSA. We revise methods for estimating CSA behavior, provide bounds of performance, and then, focusing on the achievable throughput, we extensively explore the key parameters, and their associated gain (experimentally). Our results shed light on the behavior of the optimal distribution of repetitions in actual wireless networks.

[1]  Gianluigi Liva,et al.  Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.

[2]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[3]  W. Marsden.  I and J , 2012 .

[4]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[5]  François Baccelli,et al.  Stochastic geometry and wireless networks , 2009 .

[6]  Michele Zorzi,et al.  Capture and retransmission control in mobile radio , 1994, IEEE J. Sel. Areas Commun..

[7]  Petar Popovski,et al.  Coded random access: applying codes on graphs to design random access protocols , 2014, IEEE Communications Magazine.

[8]  Harish Viswanathan,et al.  Connectionless access for mobile cellular networks , 2015, IEEE Communications Magazine.

[9]  Hosein Nikopour,et al.  Sparse code multiple access , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[10]  Riccardo De Gaudenzi,et al.  Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks , 2007, IEEE Transactions on Wireless Communications.

[11]  Henry D. Pfister,et al.  Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[12]  Yury Polyanskiy,et al.  A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[13]  C. Namislo.  Analysis of Mobile Radio Slotted ALOHA Networks , 1984, IEEE Journal on Selected Areas in Communications.

[14]  Martin Haenggi,et al.  The Performance of Successive Interference Cancellation in Random Wireless Networks , 2012, IEEE Transactions on Information Theory.

[15]  Marco Chiani,et al.  Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access , 2014, IEEE Transactions on Information Theory.