IEEE Sensors Journal · 2024 · 11 citations · 43 references
ComputingComputational EngineeringComputer ScienceMachine LearningMarkov Decision ProcessesWireless CommunicationsInterference ManagementReinforcement LearningSensor NetworksSpread Spectrum CommunicationWireless NetworksWireless Sensor NetworksDeep Reinforcement LearningFrequency HoppingFrequency-hopping Spread SpectrumJammingJamming ResistanceLong Short-term Memory NetworksMarkov Decision ModelsRadio Frequency Jamming Mitigation
Jamming against frequency-hopping spread spectrum (FHSS) in wireless sensor networks (WSNs) has been primarily investigated with the follower jamming mode. However, implementing follower jamming in practical applications encounters manifold challenges, such as stringent requirements on hardware performance and difficulties in attaining accurate synchronization with signals. Diverging from existing works, in this article, we propose a novel partial-band noise jamming (PBNJ) decision-making algorithm based on asynchronous deep reinforcement learning (DRL), which can allocate central jamming frequency and bandwidth more efficiently in FHSS jamming. First, we model the problem of allocating jamming resource of PBNJ to disrupt the FHSS communication in WSNs as a Markov decision process (MDP). Next, considering the interrelationship among decisions made by different jamming nodes (JNs), we construct a multistep decision framework in a time-division manner, and the long short-term memory (LSTM) network is leveraged to fully extract decision features from historical data, capturing correlations between jamming strategies of the deployed JNs, and guides future jamming decisions and enhances collaboration among different JNs in jamming resources allocation. Furthermore, to accelerate the convergence, we adopt the asynchronous advantage actor–critic (A3C) algorithm to optimize the allocation of central jamming frequency and bandwidth of JNs, utilizing the architecture of multithreaded parallel training, and update the actor network and critic network in an asynchronous gradient descent manner. Simulation results show that the proposed LSTM-A3C algorithm converges fast and outperforms various baselines in terms of the convergence speed, jamming success rate, and the total reward.
43
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
Reinforcement Learning: An Introduction
Richard S. Sutton, Andy Barto · IEEE Transactions on Neural Networks · 1998 · 27.1K citations
Mastering Atari, Go, chess and shogi by planning with a learned model
A Survey of Actor-Critic Reinforcement Learning: Standard and Natural Policy Gradients
I. Grondman, Lucian Buşoniu, Gabriel A. D. Lopes et al. · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · 2012 · 1K citations · Full text
Computing, Computer Science, Finance +13