TY - GEN
T1 - Semi-grant-free non-orthogonal multiple access for tactile Internet of Things
AU - Pliatsios, Dimitrios
AU - Boulogeorgos, Alexandros Apostolos A.
AU - Lagkas, Thomas
AU - Argyriou, Vasileios
AU - Moscholios, Ioannis D.
AU - Sarigiannidis, Panagiotis
N1 - Organising Body: Institute of Electrical and Electronics Engineers (IEEE)
PY - 2021
Y1 - 2021
N2 - Ultra-low latency connections for a massive number of devices are one of the main requirements of the next-generation tactile Internet-of-Things (TIoT). Grant-free non-orthogonal multiple access (GF-NOMA) is a novel paradigm that leverages the advantages of grant-free access and non-orthogonal transmissions, to deliver ultra-low latency connectivity. In this work, we present a joint channel assignment and power allocation solution for semi-GF-NOMA systems, which provides access to both grant-based (GB) and grant-free (GF) devices, maximizes the network throughput, and is capable of ensuring each device’s throughput requirements. In this direction, we provide the mathematical formulation of the aforementioned problem. After explaining that it is not convex, we propose a solution strategy based on the Lagrange multipliers and subgradient method. To evaluate the performance of our solution, we carry out system-level Monte Carlo simulations. The simulation results indicate that the proposed solution can optimize the total system throughput and achieve a high association rate, while taking into account the minimum throughput requirements of both GB and GF devices.
AB - Ultra-low latency connections for a massive number of devices are one of the main requirements of the next-generation tactile Internet-of-Things (TIoT). Grant-free non-orthogonal multiple access (GF-NOMA) is a novel paradigm that leverages the advantages of grant-free access and non-orthogonal transmissions, to deliver ultra-low latency connectivity. In this work, we present a joint channel assignment and power allocation solution for semi-GF-NOMA systems, which provides access to both grant-based (GB) and grant-free (GF) devices, maximizes the network throughput, and is capable of ensuring each device’s throughput requirements. In this direction, we provide the mathematical formulation of the aforementioned problem. After explaining that it is not convex, we propose a solution strategy based on the Lagrange multipliers and subgradient method. To evaluate the performance of our solution, we carry out system-level Monte Carlo simulations. The simulation results indicate that the proposed solution can optimize the total system throughput and achieve a high association rate, while taking into account the minimum throughput requirements of both GB and GF devices.
KW - Computer science and informatics
U2 - 10.1109/PIMRC50174.2021.9569640
DO - 10.1109/PIMRC50174.2021.9569640
M3 - Conference contribution
SN - 9781728175874
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
SP - 1389
EP - 1394
BT - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
Y2 - 13 September 2021 through 16 September 2021
ER -