Abstract
Frequency hopping (FH) technique is usually used to anti-jamming communication. Frequency dwell time is an important parameter for FH communication. Short dwell time will reduce the communication efficiency due to frequency switching time, while long dwell time will increase the time to be jammed after the sensing of a smart jammer. The dwell time of the cognitive user and the sensing time of the jammer are interactive. We formulate the interactions between the user and the jammer as a Stackelberg game. The jammer first senses the user’s operating frequency and then jams the user based on the sensing result. The user determines its dwell time according to the reward under the jamming. A tiered reinforcement learning algorithm is proposed to solve the game. The optimal dwell time of the user is given when the Stackelberg Equilibrium is achieved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sharma, R.K., Rawat, D.B.: Advances on security threats and countermeasures for cognitive radio networks: a survey. IEEE Commun. Surv. Tutorials 17(2), 1023–1043 (2015)
Zou, Y., Zhu, J., Wang, X., Hanzo, L.: A survey on wireless security: technical challenges, recent advances, and future trends. Proc. IEEE 104(9), 1727–1765 (2016)
Hanawal, M.K., Abdel-Rahman, M.J., Krunz, M.: Joint adaptation of frequency hopping and transmission rate for anti-jamming wireless systems. IEEE Trans. Mob. Comput. 15(9), 2247–2259 (2016)
Yu, L., Xu, Y., Wu, Q., et al.: Self-organizing hit avoidance in distributed frequency hopping multiple access networks. IEEE Access 5, 26614–26622 (2017)
Simon, M., Polydoros, A.: Coherent detection of frequency-hopped quadrature modulations in the presence of jamming—Part I: QPSK and QASK modulations. IEEE Trans. Commun. 29(11), 1644–1660 (1981)
Choi, K., Cheun, K.: Maximum throughput of FHSS multiple-access networks using MFSK modulation. IEEE Trans. Commun. 52(3), 426–434 (2004)
Peng, K.-C., Huang, C.-H., Li, C.-J., Horng, T.-S.: High-performance frequency-hopping transmitters using two-point delta-sigma modulation. IEEE Trans. Microw. Theory Techn. 52(11), 2529–2535 (2004)
Ling, Q., Li, T.: Message-driven frequency hopping: design and analysis. IEEE Trans. Wirel. Commun. 8(4), 1773–1782 (2009)
Zhang, L., Wang, H., Li, T.: Anti-jamming message-driven frequency hopping—Part I: system design. IEEE Trans. Wirel. Commun. 12(1), 70–79 (2013)
Cho, J., Kim, Y., Cheun, K.: A novel frequency-hopping spread spectrum multiple-access network using M-ary orthogonal Walsh sequence keying. IEEE Trans. Commun. 51(11), 1885–1896 (2003)
Bao, J., Ji, L.: Frequency hopping sequences with optimal partial Hamming correlation. IEEE Trans. Inf. Theory 62(6), 3768–3783 (2016)
Yang, D., et al.: Coping with a smart jammer in wireless networks: a Stackelberg game approach. IEEE Trans. Wirele. Commun. 12(8), 4038–4047 (2013)
Xiao, L., et al.: Anti-jamming transmission stackelberg game with observation errors. IEEE Commun. Lett. 19(6), 949–952 (2015)
Jia, L., et al.: Bayesian Stackelberg game for anti-jamming with incomplete information. IEEE Commun. Lett. 20(10), 1991–1994 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Yu, L., Zhu, Y., Li, Y. (2019). Optimal Dwell Time for Frequency Hopping in a Stackelberg Game with a Smart Jammer. In: Zhai, X., Chen, B., Zhu, K. (eds) Machine Learning and Intelligent Communications. MLICOM 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 294. Springer, Cham. https://doi.org/10.1007/978-3-030-32388-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-32388-2_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32387-5
Online ISBN: 978-3-030-32388-2
eBook Packages: Computer ScienceComputer Science (R0)