Implementation of Real-Time Adversarial Attacks on DNN-based Modulation Classifier
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we provide a hardware implementation for over-the-air (OTA) adversarial attack on a deep neural network (DNN)-based modulation classifiers. Although Automatic modulation classification (AMC) using the DNN-based method outperforms the traditional classification, it has been proven that the machine learning (ML) approaches lack robustness against adversarial attacks. Therefore, the adversarial attacks cause the loss of accuracy for the DNN-based AMC by injecting a well-designed perturbation to the wireless channels. The case study presented evaluates the adversarial attack performance and its effects on the accuracy of the DNN-classifier OTA using a universal software radio peripheral (USRP) B210. Firstly, we develop an intelligent AMC system using USRPs to classify four digitally modulated signals, namely, BPSK, QPSK, 8PSK, and 16QAM, in real-time. We consider a wireless communication system that consists of three software-defined radios (SDRs), namely, transmitter, receiver, and adversarial attack. While the Rx classifies the received signal, using a DNN-based classifier, the adversarial attack node intends to misclassify the DNN-based classifier by perturbing the input data of with an adversarial example. The developed adversarial node implements the Fast-Gradient Sign method (FGSM) to generate the needed perturbation. The results of the conducted experiment show that the DNN-based classifier achieves 97% accuracy in the absence of an adversarial node. However, after deploying the adversarial attack the classifier accuracy drops to 42%.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it