Enhancing Resilience Against Jamming Attacks: A Cooperative Anti-Jamming Method Using Direction Estimation
Bibliographic record
Abstract
The inherent vulnerability of wireless communication necessitates strategies to enhance its security, particularly in the face of jamming attacks. This paper uses the collaborations of multiple sensing nodes (SNs) in the wireless network to present a cooperative anti-jamming approach (CAJ) designed to neutralize the impact of jamming attacks. We propose an eigenvector (EV) method to estimate the direction of the channel vector from pilot symbols. Through our analysis, we demonstrate that with an adequate number of pilot symbols, the performance of the proposed EV method is comparable to the scenario where the perfect channel state information (CSI) is utilized. Both analytical formulas and simulations illustrate the excellent performance of the proposed EV-CAJ under strong jamming signals. Considering severe jamming, the proposed EV-CAJ method exhibits only a 0.7 dB degradation compared to the case without jamming especially when the number of SNs is significantly larger than the number of jamming nodes (JNs). Moreover, the extension of the proposed method can handle multiple jammers at the expense of degrees of freedom (DoF). We also investigate the method’s ability to remain robust in fast-fading channels with different coherence times. Our proposed approach demonstrates good resilience, particularly when the ratio of the channel’s coherence time to the time frame is small. This is especially important in the case of mobile jammers with large Doppler shifts.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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".