A Grant-Free Random Access Scheme for M2M Communication in Massive MIMO Systems

被引：29

作者：

Han, Huimei ^{[1
,2
]}

Li, Ying ^{[1
]}

Zhai, Wenchao ^{[2
]}

Qian, Liping ^{[2
]}

机构：

[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China

[2] Zhejiang Univ Technol, Coll Informat Engn, Hangzhou 310032, Peoples R China

来源：

IEEE INTERNET OF THINGS JOURNAL | 2020年 / 7卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Uplink; Decoding; Machine-to-machine communications; Estimation; Massive MIMO; Delays; Internet of Things; Grant-free; independent component analysis (ICA); machine-to-machine (M2M) communication; massive multiple-input-multiple-output (MIMO); PROTOCOL;

D O I：

10.1109/JIOT.2020.2973274

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A novel grant-free random access scheme is proposed to support massive connectivity with low access delay and overhead for machine-to-machine communication in massive multiple-input-multiple-output systems. This scheme allows all active user equipments (UEs) to transmit their pilots and uplink messages via the same time-frequency resource and performs the joint active UEs detection and uplink message decoding without channel estimation in one shot by utilizing the proposed ensemble independent component analysis (EICA) decoding algorithm. We call the proposed scheme the EICA-based pilot random access (EICA-PA). We analyze the successful access probability, probability of missed detection, and uplink throughput of the EICA-PA scheme. Numerical results show that the EICA-PA scheme significantly improves the successful access probability and uplink throughput, decreases missed detection probability and provides low-frame error rate at the same time.

引用

页码：3602 / 3613

页数：12

共 50 条

[41] Interference Cancellation Algorithms for Grant-Free Multiple Access With Massive MIMO
Valentini, Lorenzo
Chiani, Marco
Paolini, Enrico
IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (08) : 4665 - 4677
[42] An Architecture for Grant-Free Random Access Massive Machine Type Communication Using Coordinate Descent
Henriksson, Mikael
Gustafsson, Oscar
Ganesan, Unnikrishnan Kunnath
Larsson, Erik G.
2020 54TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2020, : 1112 - 1116
[43] On Throughput Improvement Using Immediate Re-Transmission in Grant-Free Random Access With Massive MIMO
Choi, Jinho
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (12) : 8341 - 8350
[44] Pilot-Hopping Sequence Detection Architecture for Grant-Free Random Access using Massive MIMO
Sarband, Narges Mohammadi
Becirovic, Ema
Krysander, Mattias
Larsson, Erik G.
Gustafsson, Oscar
2020 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2020,
[45] A Novel Dynamically Differentiated Access Scheme for Massive Grant-Free NOMA
Wang, Yitian
Zheng, Meng
Yu, Haibin
Liang, Wei
2022 IEEE 96TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2022-FALL), 2022,
[46] Massive M2M Access with Reliability Guarantees in LTE Systems
Madueno, German Corrales
Pratas, Nuno K.
Stefanovic, Cedomir
Popovski, Petar
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, : 2997 - 3002
[47] Grant-free Random Access for smart
Rivas, Angel Esteban Labrador
Abrao, Taufik
COMPUTER NETWORKS, 2023, 229
[48] Massive Access in the Random Access Channel of LTE for M2M Communications: an Energy Perspective
Laya, Andres
Alonso, Luis
Chatzimisios, Periklis
Alonso-Zarate, Jesus
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP (ICCW), 2015, : 1452 - 1457
[49] Grant-Free Code-Domain Random Access for Massive Access in Internet of Things
Rao, Zhigang
Jiao, Jian
Wu, Shaohua
Lu, Rongxing
Zhang, Qinyu
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 4492 - 4497
[50] Clustering-Based Activity Detection Algorithms for Grant-Free Random Access in Cell-Free Massive MIMO
Ganesan, Unnikrishnan Kunnath
Bjornson, Emil
Larsson, Erik G.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (11) : 7520 - 7530

← 1 2 3 4 5 →