Recurrent Neural Network-based Anti-jamming Framework for Defense
Against Multiple Jamming Policies
- URL: http://arxiv.org/abs/2208.09518v1
- Date: Fri, 19 Aug 2022 19:12:38 GMT
- Title: Recurrent Neural Network-based Anti-jamming Framework for Defense
Against Multiple Jamming Policies
- Authors: Ali Pourranjbar, Georges Kaddoum, and Walid Saad
- Abstract summary: 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)
- Score: 77.53658708277409
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Conventional anti-jamming methods mainly focus on preventing single jammer
attacks with an invariant jamming policy or jamming attacks from multiple
jammers with similar jamming policies. These anti-jamming methods are
ineffective against a single jammer following several different jamming
policies or multiple jammers with distinct policies. Therefore, this paper
proposes an anti-jamming method that can adapt its policy to the current
jamming attack. Moreover, for the multiple jammers scenario, an anti-jamming
method that estimates the future occupied channels using the jammers' occupied
channels in previous time slots is proposed. In both single and multiple
jammers scenarios, the interaction between the users and jammers is modeled
using recurrent neural networks (RNN)s. The performance of the proposed
anti-jamming methods is evaluated by calculating the users' successful
transmission rate (STR) and ergodic rate (ER), and compared to a baseline based
on Q-learning (DQL). Simulation results show that for the single jammer
scenario, all the considered jamming policies are perfectly detected and high
STR and ER are maintained. Moreover, when 70 % of the spectrum is under jamming
attacks from multiple jammers, the proposed method achieves an STR and ER
greater than 75 % and 80 %, respectively. These values rise to 90 % when 30 %
of the spectrum is under jamming attacks. In addition, the proposed
anti-jamming methods significantly outperform the DQL method for all the
considered cases and jamming scenarios.
Related papers
- AdvQDet: Detecting Query-Based Adversarial Attacks with Adversarial Contrastive Prompt Tuning [93.77763753231338]
Adversarial Contrastive Prompt Tuning (ACPT) is proposed to fine-tune the CLIP image encoder to extract similar embeddings for any two intermediate adversarial queries.
We show that ACPT can detect 7 state-of-the-art query-based attacks with $>99%$ detection rate within 5 shots.
We also show that ACPT is robust to 3 types of adaptive attacks.
arXiv Detail & Related papers (2024-08-04T09:53:50Z) - Self-Evaluation as a Defense Against Adversarial Attacks on LLMs [20.79833694266861]
We introduce a defense against adversarial attacks on LLMs utilizing self-evaluation.
Our method requires no model fine-tuning, instead using pre-trained models to evaluate the inputs and outputs of a generator model.
We present an analysis of the effectiveness of our method, including attempts to attack the evaluator in various settings.
arXiv Detail & Related papers (2024-07-03T16:03:42Z) - 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) - Robust Network Slicing: Multi-Agent Policies, Adversarial Attacks, and
Defensive Strategies [11.308544280789016]
We present a multi-agent deep reinforcement learning (deep RL) framework for network slicing in a dynamic environment with multiple base stations and users.
We develop a deep RL based jammer with limited prior information and limited power budget.
We show that the proposed jammer can significantly reduce the victims' performance without direct feedback or prior knowledge on the network slicing policies.
arXiv Detail & Related papers (2023-11-19T03:07:29Z) - Query Efficient Cross-Dataset Transferable Black-Box Attack on Action
Recognition [99.29804193431823]
Black-box adversarial attacks present a realistic threat to action recognition systems.
We propose a new attack on action recognition that addresses these shortcomings by generating perturbations.
Our method achieves 8% and higher 12% deception rates compared to state-of-the-art query-based and transfer-based attacks.
arXiv Detail & Related papers (2022-11-23T17:47:49Z) - Jamming Pattern Recognition over Multi-Channel Networks: A Deep Learning
Approach [88.72160601701937]
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.
arXiv Detail & Related papers (2021-12-19T04:29:23Z) - 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)
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.