Novel Cooperative Automatic Modulation Classification Using Vectorized Soft Decision Fusion for Wireless Sensor Networks
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
Cooperative automatic modulation classification (CAMC) using a swarm of sensors is intriguing nowadays as it would be much more robust than the conventional single-sensing-node automatic modulation classification (AMC) method. We propose a novel robust CAMC approach using vectorized soft decision fusion in this work. In each sensing node, the local Hamming distances between the graph features acquired from the unknown target signal and the training modulation candidate signals are calculated and transmitted to the fusion center (FC). Then, the global CAMC decision is made by the indirect vote which is translated from each sensing node's Hamming-distance sequence. The simulation results demonstrate that, when the signal-to-noise ratio (SNR) was given by η ≥ 0dB, our proposed new CAMC scheme's correct classification probability Pcc could reach up close to 100%. On the other hand, our proposed new CAMC scheme could significantly outperform the single-node graph-based AMC technique and the existing decision-level CAMC method in terms of recognition accuracy, especially in the low-SNR regime.
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.001 | 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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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