TY - GEN
T1 - Group Paging for Massive Machine-Type Communications with Diverse Access Requirements
AU - Cao, Wei
AU - Dytso, Alex
AU - Feng, Gang
AU - Poor, H. Vincent
AU - Chen, Zhi
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China Major Project under Grant 61631004, and in part by the U.S. National Science Foundation under Grants CNS-1702808 and ECCS-1647198.
Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - Massive machine-type communication (mMTC) has been identified as one of the three generic 5G services, with the aim of providing connectivity to a large number of devices. The concurrent massive access may lead to congestions due to limited access resources. Group paging (GP) has emerged as one of the promising solutions to alleviate network congestion by controlling access load. However, the performance of GP deteriorates drastically with the number of devices per paging group. This paper explores GP with pre-backoff strategy for a general mMTC scenario in which devices are allowed to have diverse access success probability (ASP) requirements, and proposes an ASP requirement guaranteed GP scheme with specific pre-backoff times (GPSP), with the aim of maximizing the total access rate. To fully adapt to mMTC applications, an efficient heuristic algorithm is designed. Numerical results demonstrate that the proposed GPSP scheme can effectively improve system performance in terms of average ASP, average access delay, and the average number of preamble transmissions.
AB - Massive machine-type communication (mMTC) has been identified as one of the three generic 5G services, with the aim of providing connectivity to a large number of devices. The concurrent massive access may lead to congestions due to limited access resources. Group paging (GP) has emerged as one of the promising solutions to alleviate network congestion by controlling access load. However, the performance of GP deteriorates drastically with the number of devices per paging group. This paper explores GP with pre-backoff strategy for a general mMTC scenario in which devices are allowed to have diverse access success probability (ASP) requirements, and proposes an ASP requirement guaranteed GP scheme with specific pre-backoff times (GPSP), with the aim of maximizing the total access rate. To fully adapt to mMTC applications, an efficient heuristic algorithm is designed. Numerical results demonstrate that the proposed GPSP scheme can effectively improve system performance in terms of average ASP, average access delay, and the average number of preamble transmissions.
UR - http://www.scopus.com/inward/record.url?scp=85063468679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063468679&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2018.8647767
DO - 10.1109/GLOCOM.2018.8647767
M3 - Conference contribution
AN - SCOPUS:85063468679
T3 - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -