Joint Adaptation of Frequency Hopping and Transmission Rate for Anti-Jamming Wireless Systems

被引:96
作者
Hanawal, Manjesh K. [1 ]
Abdel-Rahman, Mohammad J. [2 ]
Krunz, Marwan [3 ]
机构
[1] Indian Inst Technol, Dept Ind Engn & Operat Res, Bombay, Maharashtra, India
[2] Virginia Polytech Inst & State Univ, Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
[3] Univ Arizona, Dept Elect & Comp Engn, Tucson, AZ 85721 USA
基金
美国国家科学基金会;
关键词
Dynamic frequency hopping; jamming; Markov decision processes; Markov games; rate adaptation; POWER-CONTROL; GAMES;
D O I
10.1109/TMC.2015.2492556
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless transmissions are inherently vulnerable to jamming attacks. Frequency hopping (FH) and transmission rate adaptation (RA) have been separately used to mitigate jamming. When RA is used alone, it has been shown that a jammer who randomizes its power levels can force the transmitter to always operate at the lowest rate, by maintaining the average jamming power above a certain threshold. On the other hand, when only FH is used, a high throughput overhead is incurred due to frequent channel switching. In this paper, we propose to mitigate jamming by jointly optimizing the FH and RA techniques. This way, the transmitter can escape the jammer by changing its channel, adjusting its rate, or both. We consider a power-constrained "reactive-sweep" jammer who aims at degrading the throughput of the wireless link. The jammer sweeps through the set of channels, jamming a subset of them at a time, using the optimal jamming power. We model the interactions between the legitimate transmitter and jammer as a constrained zero-sum Markov game. The transmitter's optimal defense strategy is derived by obtaining the equilibria of the constrained Markov game. This policy informs the transmitter when to hop to another channel and when to stay on the current channel. Furthermore, it gives the best transmission rate to use in both cases (hop or stay). The structure of the transmitter's optimal policy is shown to be threshold type, whereby the transmitter stays on the same channel up to a certain number of time slots after which it hops. We analyze the "constrained Nash equilibrium" of the Markov game and show that the equilibrium defense strategy of the transmitter is deterministic. Numerical investigations show that the new scheme improves the average throughput and provides better jamming resiliency.
引用
收藏
页码:2247 / 2259
页数:13
相关论文
共 39 条
[1]  
Abdel-Rahman MJ, 2014, IEEE INT SYMP DYNAM, P248, DOI 10.1109/DySPAN.2014.6817801
[2]  
Altman E, 2000, ANN INT SOC DYN GAME, V5, P213
[3]  
[Anonymous], 2005, P 6 ACM INT S MOB AD, DOI DOI 10.1145/1062689.1062697
[4]  
[Anonymous], 2006, ANT PROP EM THEOR 20
[5]  
[Anonymous], THESIS
[6]  
Bayraktaroglu E, 2008, IEEE INFOCOM SER, P1939
[7]  
Broustis I, 2009, L N INST COMP SCI SO, V19, P21
[8]   Wormhole-based antijamming techniques in sensor networks [J].
Cagalj, Mario ;
Capkun, Srdjan ;
Hubaux, Jean-Pierre .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (01) :100-114
[9]   Modulation Rate Adaptation in Urban and Vehicular Environments: Cross-layer Implementation and Experimental Evaluation [J].
Camp, Joseph ;
Knightly, Edward .
MOBICOM'08: PROCEEDINGS OF THE FOURTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2008, :315-326
[10]  
Filar J., 1997, Competitive Markov Decision Processes