On Optimal Antijamming Strategies in 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
Physical layer radio jamming is a serious security threat to a wireless sensor network since the network relies on open wireless radio channels. A radio jammer is typically strategic and chooses its jamming strategy in response to the possible defense strategy taken by the sensor network. In this paper we model the interaction between the sensor network and the attacker as a noncooperative nonzero-sum static game. In such a game, the sensor network has a set of strategies of controlling its probability of wireless channel access and the attacker manipulates its jamming by controlling its jamming probability after sensing a transmission activity. We propose an algorithm for computing the optimal strategies for jamming attack and network defense. A critical issue is that there may exist a number of possible strategy profiles of Nash equilibria. To address this issue, we further propose to choose realistic Nash equilibria by applying the Pareto dominance and risk dominance. Our numerical results demonstrate that the strategies chosen by the Pareto dominance and risk dominance achieve the expected performance. Our results presented in the paper provide valuable defense guidance for wireless sensor networks against jamming attacks.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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