Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 15, Issue 9, Pages 2247-2259Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2015.2492556
Keywords
Dynamic frequency hopping; jamming; Markov decision processes; Markov games; rate adaptation
Funding
- US National Science Foundation (NSF) [IIP-1265960, IIP-1432880, CNS-1409172]
- Army Research Office [W911NF-13-1-0302]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [1265960, 1409172] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available