Differentiated service-aware group paging for massive machine-type communication

Wei Cao, Alex Dytso, Gang Feng, H. Vincent Poor, Zhi Chen

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


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 in mMTC may lead to congestion due to limited access resources. Group paging (GP) is emerging 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 a pre-backoff strategy for a general mMTC scenario in which devices are allowed to have diverse access success probability (ASP) requirements, and proposes a differentiated service-aware GP scheme with specific pre-backoff times (GPSP), with the aim of maximizing the total access rate while guaranteeing the ASP requirements for individual devices. An optimal solution to the GPSP problem is derived to provide a performance upper bound. As low-complexity algorithms are of key importance for mMTC applications, an efficient heuristic algorithm is further designed. Numerical results demonstrate that the proposed GPSP scheme can effectively improve the system performance in terms of average ASP, average access delay, and the average number of preamble transmissions.

Original languageEnglish (US)
Article number8388222
Pages (from-to)5444-5456
Number of pages13
JournalIEEE Transactions on Communications
Issue number11
StatePublished - Nov 2018

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


  • Massive MTC
  • differentiated services
  • group paging
  • pre-backoff
  • random access


Dive into the research topics of 'Differentiated service-aware group paging for massive machine-type communication'. Together they form a unique fingerprint.

Cite this