Jamming games in fast-fading wireless channels
In this article, we adopt outage probability (λ-capacity) in fastfading channels as a pay-off function in a zero-sum game between a legitimate transceiver pair and an uncorrelated Gaussian jammer. The transmitter aims at minimising the outage probability, while the jammer attempts to maximise the outage probability. We consider both peak (over each codeword) and average (over all codewords) power constraints. For peak power constraints, a transmission rate is either supported by the system, or if too large, causes the whole transmission to fail. By imposing average power constraints, large rates can be supported at the cost of positive probability of codeword error. Maxmin (where the jammer is assumed to play first) and minimax (where the transmitter is assumed to play first) power control strategies are developed under each power constraint, which show that no Nash equilibrium of pure strategies exists under the average power constraint when the follower has perfect knowledge about the randomisation outcome of the first player. Copyright© 2008 Inderscience Enterprises Ltd.
Publication Source (Journal or Book title)
International Journal of Autonomous and Adaptive Communications Systems
Amariucai, G., & Wei, S. (2008). Jamming games in fast-fading wireless channels. International Journal of Autonomous and Adaptive Communications Systems, 1 (4), 411-424. https://doi.org/10.1504/IJAACS.2008.021489