Jamming Pattern Recognition over Multi-Channel Networks: A Deep Learning
Approach
- URL: http://arxiv.org/abs/2112.11222v1
- Date: Sun, 19 Dec 2021 04:29:23 GMT
- Title: Jamming Pattern Recognition over Multi-Channel Networks: A Deep Learning
Approach
- Authors: Ali Pourranjbar, Georges Kaddoum and Walid Saad
- Abstract summary: An intelligent jammer is able to change its policy to minimize the probability of being traced by legitimate nodes.
Existing anti-jamming methods are not applicable here because they mainly focus on mitigating jamming attacks with an invariant jamming policy.
This paper proposes a jamming type recognition technique working alongside an anti-jamming technique.
- Score: 88.72160601701937
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the advent of intelligent jammers, jamming attacks have become a more
severe threat to the performance of wireless systems. An intelligent jammer is
able to change its policy to minimize the probability of being traced by
legitimate nodes. Thus, an anti-jamming mechanism capable of constantly
adjusting to the jamming policy is required to combat such a jammer.
Remarkably, existing anti-jamming methods are not applicable here because they
mainly focus on mitigating jamming attacks with an invariant jamming policy,
and they rarely consider an intelligent jammer as an adversary. Therefore, in
this paper, to employ a jamming type recognition technique working alongside an
anti-jamming technique is proposed. The proposed recognition method employs a
recurrent neural network that takes the jammer's occupied channels as inputs
and outputs the jammer type. Under this scheme, the real-time jammer policy is
first identified, and, then, the most appropriate countermeasure is chosen.
Consequently, any changes to the jammer policy can be instantly detected with
the proposed recognition technique allowing for a rapid switch to a new
anti-jamming method fitted to the new jamming policy. To evaluate the
performance of the proposed recognition method, the accuracy of the detection
is derived as a function of the jammer policy switching time. Simulation
results show the detection accuracy for all the considered users numbers is
greater than 70% when the jammer switches its policy every 5 time slots and the
accuracy raises to 90% when the jammer policy switching time is 45.
Related papers
- Improved Generation of Adversarial Examples Against Safety-aligned LLMs [72.38072942860309]
Adversarial prompts generated using gradient-based methods exhibit outstanding performance in performing automatic jailbreak attacks against safety-aligned LLMs.
In this paper, we explore a new perspective on this problem, suggesting that it can be alleviated by leveraging innovations inspired in transfer-based attacks.
We show that 87% of the query-specific adversarial suffixes generated by the developed combination can induce Llama-2-7B-Chat to produce the output that exactly matches the target string on AdvBench.
arXiv Detail & Related papers (2024-05-28T06:10:12Z) - Systematic Use of Random Self-Reducibility against Physical Attacks [10.581645335323655]
This work presents a novel, black-box software-based countermeasure against physical attacks including power side-channel and fault-injection attacks.
The approach uses the concept of random self-reducibility and self-correctness to add randomness and redundancy in the execution for protection.
An end-to-end implementation of this countermeasure is demonstrated for RSA-CRT signature algorithm and Kyber Key Generation public key cryptosystems.
arXiv Detail & Related papers (2024-05-08T16:31:41Z) - Token-Level Adversarial Prompt Detection Based on Perplexity Measures
and Contextual Information [67.78183175605761]
Large Language Models are susceptible to adversarial prompt attacks.
This vulnerability underscores a significant concern regarding the robustness and reliability of LLMs.
We introduce a novel approach to detecting adversarial prompts at a token level.
arXiv Detail & Related papers (2023-11-20T03:17:21Z) - Adaptive White-Box Watermarking with Self-Mutual Check Parameters in
Deep Neural Networks [14.039159907367985]
Fragile watermarking is a technique used to identify tampering in AI models.
Previous methods have faced challenges including risks of omission, additional information transmission, and inability to locate tampering precisely.
We propose a method for detecting tampered parameters and bits, which can be used to detect, locate, and restore parameters that have been tampered with.
arXiv Detail & Related papers (2023-08-22T07:21:06Z) - Recurrent Neural Network-based Anti-jamming Framework for Defense
Against Multiple Jamming Policies [77.53658708277409]
This paper proposes an anti-jamming method that can adapt its policy to the current jamming attack.
In both single and multiple jammers scenarios, the interaction between the users and jammers is modeled using recurrent neural networks (RNNs)
arXiv Detail & Related papers (2022-08-19T19:12:38Z) - Reinforcement Learning for Deceiving Reactive Jammers in Wireless
Networks [76.82565500647323]
A novel anti-jamming strategy is proposed based on the idea of deceiving the jammer into attacking a victim channel.
Since the jammer's channel information is not known to the users, an optimal channel selection scheme and a sub optimal power allocation are proposed.
Simulation results show that the proposed anti-jamming method outperforms the compared RL based anti-jamming methods and random search method.
arXiv Detail & Related papers (2021-03-25T18:12:41Z) - Robust Spammer Detection by Nash Reinforcement Learning [64.80986064630025]
We develop a minimax game where the spammers and spam detectors compete with each other on their practical goals.
We show that an optimization algorithm can reliably find an equilibrial detector that can robustly prevent spammers with any mixed spamming strategies from attaining their practical goal.
arXiv Detail & Related papers (2020-06-10T21:18:07Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.