Novel Cooperative Automatic Modulation Classification Using Unmanned Aerial Vehicles
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
Automatic modulation classification (AMC) has been intriguing many researchers as it has many civil and military applications. Recently, cooperative AMC (CAMC) using a dynamic or ad hoc sensor network becomes appealing and challenging. As the unmanned aerial vehicles (UAVs) can facilitate three-dimensional communication/sensor network, we propose a novel CAMC approach based on a dynamic (ad hoc) UAV network. In our proposed new CAMC approach, the local classification decisions, which are made by spatially distributed nodes (UAVs) using our previously proposed graph-based modulation classifier, are gathered to reach an overall decision by a new weighted voting mechanism pertinent to individual received signal qualities. Note that the fusion center does not have to be a fixed UAV and it can be dynamically reassigned to any UAV within the same network in each sensing interval. The corresponding weights to individual UAVs are to be determined according to their cumulative states and the temporal discount factor. As a result, our proposed new CAMC approach can be fully distributed as no control center (or hub) is necessary. Besides, our new CAMC scheme can accommodate realistic ad hoc network variations to allow the existing UAVs to depart and/or the new UAVs to join in any sensing interval. Monte Carlo simulation results demonstrate that our proposed new CAMC scheme is quite robust and outperforms the existing CAMC method.
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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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