TY - GEN
T1 - A Random Non-Orthogonal Multiple Access Scheme for mMTC
AU - Ye, Neng
AU - Wang, Aihua
AU - Li, Xiangming
AU - Yu, Hanxiao
AU - Li, Anxin
AU - Jiang, Huiling
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/11/14
Y1 - 2017/11/14
N2 - Massive Machine Type Communication (mMTC) is one key usage scenario in future 5G. To fulfill the massive connection requirement in mMTC, and reduce the signaling overhead, a novel grant free Random Non-Orthogonal Multiple Access (RNOMA) scheme is proposed in this paper, inspired by the concept of conventional NOMA. In RNOMA, one physical resource area is reserved and divided into orthogonal resource units (RU), where each user is allowed to persuade-randomly transmit the same packet on each RU according to optimized probability. At the receiver, inter- and intra-RU Successive Interference Cancelation (SIC) is applied for multi-user receiving. A frame structure is also designed to enable RNOMA, where signaling overhead on informing each UE with assigned resources is reduced. Simulation results show, the proposed method is robust and is able to achieve significantly better performance than novel random access method, i.e. irregular repetition slotted aloha, where its access degree distribution is optimized for binary erasure channel.
AB - Massive Machine Type Communication (mMTC) is one key usage scenario in future 5G. To fulfill the massive connection requirement in mMTC, and reduce the signaling overhead, a novel grant free Random Non-Orthogonal Multiple Access (RNOMA) scheme is proposed in this paper, inspired by the concept of conventional NOMA. In RNOMA, one physical resource area is reserved and divided into orthogonal resource units (RU), where each user is allowed to persuade-randomly transmit the same packet on each RU according to optimized probability. At the receiver, inter- and intra-RU Successive Interference Cancelation (SIC) is applied for multi-user receiving. A frame structure is also designed to enable RNOMA, where signaling overhead on informing each UE with assigned resources is reduced. Simulation results show, the proposed method is robust and is able to achieve significantly better performance than novel random access method, i.e. irregular repetition slotted aloha, where its access degree distribution is optimized for binary erasure channel.
KW - Grant-free
KW - Massive MTC
KW - NOMA
KW - Random Non-Orthogonal Multiple Access
KW - Resource reserved access
UR - http://www.scopus.com/inward/record.url?scp=85040574934&partnerID=8YFLogxK
U2 - 10.1109/VTCSpring.2017.8108485
DO - 10.1109/VTCSpring.2017.8108485
M3 - Conference contribution
AN - SCOPUS:85040574934
T3 - IEEE Vehicular Technology Conference
BT - 2017 IEEE 85th Vehicular Technology Conference, VTC Spring 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 85th IEEE Vehicular Technology Conference, VTC Spring 2017
Y2 - 4 June 2017 through 7 June 2017
ER -