An Anti-jamming Strategy When it Is Unknown Which Receivers Will Face with Smart Interference

The paper considers a communication system consisting of a communication node utilizing multiple antennas in order to communicate with a group of receivers, while potentially facing interference from one or more jammers. The jammers impact the scenario by possibly interfering some of the receivers. The objective of the jammers is to reduce the throughput of nearby receivers, while taking into account the cost/risk of jamming. The fact that jammers face a cost implies that they might not choose to interfere, and thus the communication node faces uncertainty about which of its receivers will be jammed. This uncertainty is modeled by the communicator having only a priori probabilities about whether each receiver will face hostile interference or not, and if he does face such jamming, whether the jamming attack is smart or not. The goal of the communication node is to distribute total power resources to maximize the total throughput associated with communicating with all of the receivers. The problem is formulated as a Bayesian game between the communication system and the jammers. A waterfilling equation to find the equilibrium is derived, and its uniqueness is proven. The threshold value on the power budget is established for the receivers to be non-altruistic.