Radio Communications Interdiction Problem under deterministic and probabilistic jamming

Abstract

The Radio Communications Interdiction Problem (RCIP) seeks to identify the locations of transmitters on the battlefield that will lead to a robust radio communications network by anticipating the effects of intentional radio jamming attacks used by an adversary during electronic warfare. RCIP is a sequential game defined between two opponents that target each other's military units in a conventional warfare. First, a defender locates a limited number of transmitters on the defender's side of the battlefield to optimize the relay of information among its units. After observing the locations of radio transmitters, an attacker locates a limited number of radio jammers on the attacker's side to disrupt the communication network of the defender. We formulate RCIP as a binary bilevel (max-min) programming problem, present the equivalent single level formulation, and propose an exact solution method using a decomposition scheme. We enhance the performance of the algorithm by utilizing dominance relations, preprocessing, and initial starting heuristics. To reflect a more realistic jamming representation, we also introduce the probabilistic version of RCIP where a jamming probability is associated at each receiver site as a function of the prevalent jamming to signal ratios leading to an expected coverage of receivers as an objective function. We approximate the nonlinearity in the jamming probability function using a piecewise linear convex function and solve this version by adapting the decomposition algorithm constructed for RCIP. Our extensive computational results on realistic scenarios show the efficacy of the solution approaches and provide valuable tactical insights. (C) 2019 Elsevier Ltd. All rights reserved.