Joint Low-Rank Factor and Sparsity for Detecting Access Jamming in Massive MTC Networks

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Due to the weak security protection capabilities of the low-cost and low-complexity massive access of machine-type devices, massive machine-type communications (mMTC) networks are extremely vulnerable to the access jamming, which can affect the correctness of activity and data detection of legitimate devices and even leads to the paralysis of the mission-critical mMTC applications. This paper studies detection problem of the access jamming in the uplink of mMTC (AJ-UM), and we propose to exploit the characteristics of the joint low-rank factor and sparsity (JLFS) to detect the AJ-UM. Our detection method is motivated by the fact that the JLFS-based feature will be significantly impacted if the AJ-UM happens. We first extract the JLFS-based feature by solving a low-rank maximum likelihood factor analysis problem with sparsity constraint, and then perform the AJ-UM detection in a sequential manner. Moreover, the proposed JLFS-based method does not need to know the accurate prior information of the JLFS-based feature in the presence or absence of the AJ-UM, which can determine the AJ-UM exists as long as there is an abrupt change in the JLFS-based feature. Numerical results are finally presented to confirm the effectiveness of the proposed JLFS-based method.

Original languageEnglish
Pages (from-to)4063-4068
Number of pages6
JournalProceedings - IEEE Global Communications Conference, GLOBECOM
DOIs
StatePublished - 2022
Event2022 IEEE Global Communications Conference, GLOBECOM 2022 - Rio de Janeiro, Brazil
Duration: 4 Dec 20228 Dec 2022

Keywords

  • Physical layer security
  • access jamming detection
  • low-rank factor
  • mMTC network
  • sparsity

Fingerprint

Dive into the research topics of 'Joint Low-Rank Factor and Sparsity for Detecting Access Jamming in Massive MTC Networks'. Together they form a unique fingerprint.

Cite this