The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Anti-Jamming Games in Multi-Channel Cognitive Radio Networks
Abstract
Crucial to the successful deployment of cognitive radio networks, security issues have begun to receive research interests recently. In this paper, we focus on defending against the jamming attack, one of the major threats to cognitive radio networks. Secondary users can exploit the flexible access to multiple channels as the means of anti-jamming defense. We first investigate the situation where a secondary user can access only one channel at a time and hop among different channels, and model it as an anti-jamming game. Analyzing the interaction between the secondary user and attackers, we derive a channel hopping defense strategy using the Markov decision process approach with the assumption of perfect knowledge, and then propose two learning schemes for secondary users to gain knowledge of adversaries to handle cases without perfect knowledge. In addition, we extend to the scenario where secondary users can access all available channels simultaneously, and redefine the anti-jamming game with randomized power allocation as the defense strategy. We derive the Nash equilibrium for this Colonel Blotto game which minimizes the worst-case damage. Finally, simulation results are presented to verify the performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Cited by
Deep reinforcement learning for cyber security
Nguyen, T. T., & Reddi, V. J. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3121870 · Cited by 620
Anti-Jamming Communications Using Spectrum Waterfall: A Deep Reinforcement Learning Approach
Liu, X., Xu, Y., Jia, L., Wu, Q., & Anpalagan, A. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2815018 · Cited by 258
Security in Mobile Edge Caching with Reinforcement Learning
Xiao, L., Wan, X., Dai, C., Du, X., Chen, X., & Guizani, M. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2018.1700291 · Cited by 228
Reinforcement learning for iot security: A comprehensive survey
Uprety, A., & Rawat, D. B. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3040957 · Cited by 214
Metadata
- Authors
- Wu, Y., Wang, B., Liu, K. J. R., & Clancy, T. C.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2012-01
- Volume
- 30
- Issue
- 1
- Pages
- 4-15
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2122311135
- Cited by
- 242
- References
- 1
- FWCI
- 22.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Anti-Jamming Games in Multi-Channel Cognitive Radio Networks. https://app.cochat.ai/papers/10.1109/jsac.2012.120102
- The paper
- Wu, Y., Wang, B., Liu, K. J. R., & Clancy, T. C. (2012). Anti-Jamming Games in Multi-Channel Cognitive Radio Networks. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2012.120102
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.