On the Capacity of Rate-Adaptive Packetized Wireless Communication Links under Jamming

2012/02/29 by Koorosh Firouzbakht, Guevara Noubir, Firouzbakht, Koorosh +3
Computer Science · Engineering · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Security in Wireless Sensor Networks #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1202.6669

openalex publication_date 2012/02/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

We formulate the interaction between the communicating nodes and an adversary within a game-theoretic context. We show that earlier information-theoretic capacity results for a jammed channel correspond to a pure Nash Equilibrium (NE). However, when both players are allowed to randomize their actions (i.e., coding rate and jamming power) new mixed Nash equilibria appear with surprising properties. We show the existence of a threshold (J_TH) such that if the jammer average power exceeds J_TH, the channel capacity at the NE is the same as if the jammer was using its maximum allowable power, J_Max, all the time. This indicates that randomization significantly advantages powerful jammers. We also show how the NE strategies can be derived, and we provide very simple (e.g., semi-uniform) approximations to the optimal communication and jamming strategies. Such strategies are very simple to implement in current hardware and software.

Related

• Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
• A Resource-Competitive Jamming Defense
• Static and Dynamic Jamming Games Over Wireless Channels With Mobile Strategic Players
• Anti-Jamming Games in Multi-Band Wireless Ad Hoc Networks
• Optimal Strategies for Gaussian Jamming in Block-Fading Channels under Delay and Power Constraints