2000 character limit reached
Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees
Published 20 Feb 2022 in cs.IT and math.IT | (2202.09890v2)
Abstract: We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by utilizing multiple transmissions (K-repetition coding). This allows them to achieve diversity and improve the reliability within a certain latency constraint. We focus on two access methods: one where devices choose K slots at random and another one where the access patterns are deterministic and follow a specific code design, namely the Steiner System. We analyze the problem under two signal models that involve different complexity for the receiver. First, collision model is considered, where only interference-free transmissions can be used and combined. Second, a model treating interference as noise is analyzed, where the receiver is capable of utilizing all K replicas, applying maximum ratio combining (MRC). For both signal models, we investigate receivers with and without successive interference cancellation (SIC). We develop approximations and bounds for the outage probabilities that very closely match simulation results. Overall, we show that deterministic access patterns have the potential to significantly outperform random selection in terms of reliability. Furthermore, deterministic access patterns offer a simplified system design.
- “Ericsson Mobility Report,” Tech. Rep., Nov. 2021. [Online]. Available: https://www.ericsson.com/
- M. A. Uusitalo & al., “6G vision, value, use cases and technologies from european 6G flagship project Hexa-X,” IEEE Access, vol. 9, pp. 160 004–160 020, 2021.
- 3GPP, “Service Requirements for the 5G System; Stage 1,” 3rd Generation Partnership Project (3GPP), TS 22.261, Dec. 2021, v18.5.0.
- NGMN Alliance, “Verticals URLLC Use Cases and Requirements,” Tech. Rep., July. 2019. [Online]. Available: https://www.ngmn.org/
- P. Popovski, F. Chiariotti, K. Huang, A. E. Kalør, M. Kountouris, N. Pappas, and B. Soret, “A Perspective on Time Toward Wireless 6G,” Proceedings of the IEEE, vol. 110, no. 8, pp. 1116–1146, 2022.
- S. Schiessl, “Performance Trade-offs for Ultra-Reliable Low-Latency Communication Systems,” Ph.D. dissertation, KTH Royal Institute of Technology, 2019. [Online]. Available: http://urn.kb.se
- G. Berardinelli & al., “Reliability Analysis of Uplink Grant-Free Transmission Over Shared Resources,” IEEE Access, vol. 6, pp. 23 602–23 611, 2018.
- N. Patriciello, S. Lagen, L. Giupponi, and B. Bojovic, “The Impact of NR Scheduling Timings on End-to-End Delay for Uplink Traffic,” in IEEE Global Communications Conference (GLOBECOM), 2019, pp. 1–6.
- M. B. Shahab, R. Abbas, M. Shirvanimoghaddam, and S. J. Johnson, “Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey,” IEEE Communications Surveys Tutorials, vol. 22, no. 3, pp. 1805–1838, 2020.
- E. Casini, R. De Gaudenzi, and O. Del Rio Herrero, “Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks,” IEEE Transactions on Wireless Communications, vol. 6, no. 4, pp. 1408–1419, 2007.
- M. Ghanbarinejad and C. Schlegel, “Irregular Repetition Slotted ALOHA with Multiuser Detection,” in Conference on Wireless On-demand Network Systems and Services (WONS), 2013, pp. 201–205.
- C. Boyd, R. Kotaba, O. Tirkkonen, and P. Popovski, “Non-Orthogonal Contention-Based Access for URLLC Devices with Frequency Diversity,” in IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019, pp. 1–5.
- G. Choudhury and S. Rappaport, “Diversity ALOHA - A Random Access Scheme for Satellite Communications,” IEEE Transactions on Communications, vol. 31, no. 3, pp. 450–457, 1983.
- C. Boyd, R. Vehkalahti, and O. Tirkkonen, “Interference cancelling codes for ultra-reliable random access,” International Journal of Wireless Information Networks, vol. 25, pp. 1–12, 12 2018.
- L. G. Roberts, “ALOHA Packet System with and without Slots and Capture,” ACM SIGCOMM Computer Communication Review, vol. 5, no. 2, 1975.
- G. Liva, “Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA,” IEEE Transactions on Communications, vol. 59, no. 2, pp. 477–487, 2011.
- F. Clazzer, E. Paolini, I. Mambelli, and C. Stefanović, “Irregular Repetition Slotted ALOHA Over the Rayleigh Block Fading Channel with Capture,” in IEEE International Conference on Communications (ICC), 2017, pp. 1–6.
- E. Paolini, G. Liva, and M. Chiani, “Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access,” IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6815–6832, 2015.
- J. Choi, “Throughput Analysis for Coded Multichannel ALOHA Random Access,” IEEE Communications Letters, vol. 21, no. 8, pp. 1803–1806, 2017.
- R. Abreu, “Uplink grant-free access for ultra-reliable low-latency communications in 5G: Radio access and resource management solutions,” Ph.D. dissertation, Aalborg University, 2019.
- M. C. Lucas-Estañ, J. Gozálvez, and M. Sepulcre, “On the Capacity of 5G NR Grant-Free Scheduling with Shared Radio Resources to Support Ultra-Reliable and Low-Latency Communications,” Sensors, vol. 19, 2019.
- Y. Liu, Y. Deng, M. Elkashlan, A. Nallanathan, and G. K. Karagiannidis, “Analyzing Grant-Free Access for URLLC Service,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 3, pp. 741–755, 2021.
- J. Choi and J. Ding, “Network Coding for K-Repetition in Grant-Free Random Access,” IEEE Wireless Communications Letters, vol. 10, no. 11, pp. 2557–2561, 2021.
- M. Lucas-Estan and J. Gozalvez, “Sensing-based Grant-Free Scheduling for Ultra Reliable Low Latency and Deterministic Beyond 5G Networks,” IEEE Transactions on Vehicular Technology, pp. 1–1, 2022.
- G. T. Peeters, R. Bocklandt, and B. Van Houdt, “Multiple Access Algorithms Without Feedback Using Combinatorial Designs,” IEEE Transactions on Communications, vol. 57, no. 9, pp. 2724–2733, 2009.
- C. Boyd, R. Vehkalahti, and O. Tirkkonen, “Combinatorial Code Designs for Ultra-reliable IoT Random Access,” in IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), 2017.
- E. Paolini, G. Liva, and A. Graell i Amat, “A structured irregular repetition slotted aloha scheme with low error floors,” in IEEE International Conference on Communications (ICC), 2017, pp. 1–6.
- R. Kotaba, C. N. Manchón, and P. Popovski, “Enhancing Performance of Uplink URLLC Systems via Shared Diversity Transmissions and Multiple Antenna Processing,” in Asilomar Conference on Signals, Systems, and Computers, 2019, pp. 1409–1415.
- W. Tang, S. Kang, B. Ren, and X. Yue, “Uplink Grant-Free Pattern Division Multiple Access (GF-PDMA) for 5G Radio Access,” China Communications, vol. 15, no. 4, pp. 153–163, 2018.
- G. Durisi, T. Koch, and P. Popovski, “Toward massive, ultrareliable, and low-latency wireless communication with short packets,” Proceedings of the IEEE, vol. 104, no. 9, pp. 1711–1726, Sept 2016.
- C. Di, D. Proietti, I. Telatar, T. Richardson, and R. Urbanke, “Finite-length analysis of low-density parity-check codes on the binary erasure channel,” IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1570–1579, 2002.
- La Jolla Covering Repository. Steiner Systems. [Online]. Available: https://ljcr.dmgordon.org/cover.php.
- F. D. Salvo, “A characterization of the distribution of a weighted sum of gamma variables through multiple hypergeometric functions,” Integral Transforms and Special Functions, vol. 19, no. 8, pp. 563–575, 2008.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.