eprintid: 4695
rev_number: 7
eprint_status: archive
userid: 328
dir: disk0/00/00/46/95
datestamp: 2022-03-21 00:41:38
lastmod: 2022-03-21 00:41:38
status_changed: 2022-03-21 00:41:38
type: conference_item
metadata_visibility: show
creators_name: Tran, Huu Ha
creators_name: Duong, Chu Huy
creators_name: Trinh, Anh Vu
creators_name: Vu, Xuan Thang
creators_name: Hoang, Gia Hung
creators_id: huuha.tran306@gmail.com
creators_id: duongch.hyn@gmail.com
creators_id: vuta@vnu.edu.vn
creators_id: thang.vu85@gmail.com
creators_id: hunghg@vnu.edu.vn
title: A Random Access Protocol for Massive MIMO: 
The Adaptive ACB based Collision Resolution
ispublished: inpress
subjects: Communications
divisions: fac_fet
abstract: mMTC (massive Machine Type 
Communications) is one of the key components in beyond 5G 
networks for smart manufactures and the fourth industrial 
revolution. Due to the massive connectivity in mMTC, it is vital 
to have an efficient random access protocol. In the paper, we 
propose a new random access technique called the Adaptive 
ACB (A-ACB) to minimize collisions. We show that, in terms of 
successfully resolved probability, the proposed A-ACB always 
outperforms the ACBPC protocol [1] and surpasses the SUCRe 
protocol [2] when the number of collisions per preamble is large. 
In addition, the proposed protocol achieves better fairness than 
the SUCRe but less than the ACBPC. Finally, numerical results 
are provided to demonstrate the effectiveness of the proposed 
random access protocol.
date: 2021-12-21
date_type: published
official_url: http://nafosted-nics.org
full_text_status: none
pres_type: speech
pagerange: 1-5
event_title: NICS 2021
event_location: Le Qui Don University, Hanoi, Viet nam
event_dates: 21-12-2021
event_type: conference
refereed: FALSE
citation:   Tran, Huu Ha and Duong, Chu Huy and Trinh, Anh Vu and Vu, Xuan Thang and Hoang, Gia Hung  (2021) A Random Access Protocol for Massive MIMO: The Adaptive ACB based Collision Resolution.  In: NICS 2021, 21-12-2021, Le Qui Don University, Hanoi, Viet nam.    (In Press)