2019Unpublished venueRequires access

Q-Learning Based Adaptive Frequency Hopping Strategy Under Probabilistic Jamming

Yutao Wang, Yingtao Niu, Jianzhong Chen, Fang Fang, Chen Han

Open publisher page 16 citations

Abstract

It is difficult to ensure stability and communication efficiency of traditional anti-jamming frequency hopping communication system in the frequency domain probabilistic jamming environment. Therefore, this paper proposes an adaptive frequency hopping communication scheme under probabilistic jamming. Based on the probabilistic jamming model, the practical frequency hopping (FH) strategy and average payoff is obtained using Q-Learning algorithm and is compared with the theoretical optimal average payoff obtained by the greedy algorithm. Simulation results show that our proposed algorithm is fast to converge, has fewer frequency hops compared with existing anti-jamming FH strategy, and the average payoff is close to the theoretical optimal frequency hopping strategy.

About this research paper

What this paper is about

It is difficult to ensure stability and communication efficiency of traditional anti-jamming frequency hopping communication system in the frequency domain probabilistic jamming environment. Therefore, this paper proposes an adaptive frequency hopping communication scheme under probabilistic jamming. Based on the probabilistic jamming model, the practical frequency hopping (FH) strategy and average payoff is obtained using Q-Learning algorithm and is compared with the theoretical optimal average payoff obtained by the greedy algorithm. Simulation results show that our proposed algorithm is fast to converge, has fewer frequency hops compared with existing anti-jamming FH strategy, and the average payoff is close to the theoretical optimal frequency hopping strategy.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is difficult to ensure stability and communication efficiency of traditional anti-jamming frequency hopping communication system in the frequency domain probabilistic jamming environment. Therefore, this paper proposes an adaptive frequency hopping communication scheme under probabilistic jamming. Based on the probabilistic jamming model, the practical frequency hopping (FH) strategy and average payoff is obtained using Q-Learning algorithm and is compared with the theoretical optimal average payoff obtained by the greedy algorithm. Simulation results show that our proposed algorithm is fast to converge, has fewer frequency hops compared with existing anti-jamming FH strategy, and the average payoff is close to the theoretical optimal frequency hopping strategy.

Key concepts: Jamming, Frequency-hopping spread spectrum, Probabilistic logic, Stochastic game, Computer science, Frequency domain, Stability (learning theory), Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Q-Learning Based Adaptive Frequency Hopping Strategy Under Probabilistic Jamming — Research Paper | ScholarLens