Anti-Jamming Games in Multi-Band Wireless Ad Hoc Networks
Not on the map. Why?
Abstract (arXiv)
For multi-band wireless ad hoc networks of multiple users, an anti-jamming game between the users and a jammer is studied. In this game, the users (resp. jammer) want to maximize (resp. minimize) the expected rewards of the users taking into account various factors such as communication rate, hopping cost, and jamming loss. We analyze the arms race of the game and derive an optimal frequency hopping policy at each stage of the arms race based on the Markov decision process (MDP). It is analytically shown that the arms race reaches an equilibrium after a few rounds, and a frequency hopping policy and a jamming strategy at the equilibrium are characterized. We propose two kinds of collision avoidance protocols to ensure that at most one user communicates in each frequency band, and provide various numerical results that show the effects of the reward parameters and collision avoidance protocols on the optimal frequency hopping policy and the expected rewards at the equilibrium. Moreover, we discuss about equilibria for the case where the jammer adopts some unpredictable jamming strategies.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 45 references that are in the map. First posted on arXiv 11 Nov 2021.
Builds on
4 of 45 references.
References · 4
- 2018A Collaborative Multi-agent Reinforcement Learning Anti-jamming Algorithm in Wireless Networkscited by 10
- 2020Multi-stage Jamming Attacks Detection using Deep Learning Combined with Kernelized Support Vector Machine in 5G Cloud Radio Access Networkscited by 8
- 2019"Jam Me If You Can'': Defeating Jammer with Deep Dueling Neural Network Architecture and Ambient Backscattering Augmented Communicationscited by 7
- 2019"Borrowing Arrows with Thatched Boats": The Art of Defeating Reactive Jammers in IoT Networkscited by 1
Built on by
Not cited yet.