Anti-Jamming Path Selection Method in a Wireless Communication Network Based on Dyna-Q

Citations Over TimeTop 21% of 2022 papers

Abstract

Aiming at efficiently establishing the optimal transmission path in a wireless communication network in a malicious jamming environment, this paper proposes an anti-jamming algorithm based on Dyna-Q. Based on previous observations of the environment, the algorithm selects the optimal sequential node by searching the Q table to reduce the packet loss rate. The algorithm can accelerate the updating of the Q table based on previous experience. The Q table converges to the optimal value quickly. This is beneficial for the optimal selection of subsequent nodes. Simulation results show that the proposed algorithm has the advantage of faster convergence speed compared with the model-free reinforcement learning algorithm.

Related Papers

• Q-decomposition for reinforcement learning agents(2003)
• → MazeCov-Q: An Efficient Maze-Based Reinforcement Learning Accelerator for Coverage(2023)5 cited
• → A reinforcement learning approach to power system stabilizer(2009)16 cited
• RESEARCH ON MARKOV GAME-BASED MULTIAGENT REINFORCEMENT LEARNING MODEL AND ALGORITHMS(2000)
• → Customized Dynamic Pricing for Air Cargo Network via Reinforcement Learning(2020)1 cited