Channel Decontamination Based Pilot Contamination Attack Resistance for GF-mMTC Emergency Networks
Bibliographic record
Abstract
Grant-free massive machine-type communication (GF-mMTC) is effective to support emergency services due to its ability to manage high-density device connectivity and provide immediate communications without grant or scheduling. However, owing to the lack of authentication, GF-mMTC emergency networks are vulnerable to the pilot contamination attack (PCA), which will cause serious degradation of channel estimation and critical data reception and further pose a significant threat to the emergency communications. To resist PCA, we utilize the mmWave communication technique and establish a three-dimensional channel model in angle-delay-slot domain for mmWave GF-mMTC networks, where the sparsity of mmWave channels in both virtual angular domain and delay domain and the temporal correlation of legitimate user carrying emergency services are jointly exploited. Based on the established model, we propose a channel decontamination based PCA resistance scheme to improve the security of GF-mMTC emergency networks. Specifically, we formulate the PCA resistance problem into a multidimensional sparse recovery problem and develop a multidimensional dictionary based sparsity adaptive matching pursuit (MD-SAMP) algorithm to solve the formulated problem. Simulation results show that the proposed scheme can efficiently reconstruct the contaminated channel and improve the receiver performance for emergency communications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".