Capacity of Multiple Access Channels with Correlated Jamming

Abstract

We investigate the behavior of two users and one jammer in an AWGN channel with and without fading when they participate in a non-cooperative zero-sum game, with the channel's input/output mutual information as the objective function. We assume that the jammer can eavesdrop the channel and can use the information obtained to perform correlated jamming. Under various assumptions on the channel characteristics, and the extent of information available at the users and the jammer, we show the existence, or otherwise nonexistence of a simultaneously optimal set of strategies for the users and the jammer. Whenever the game has a solution, we find the corresponding user and jammer strategies, and whenever the game does not admit a solution, we find the max-min user strategies and the corresponding jammer strategy.

Jamming a TDD Point-to-Point Link Using Reciprocity-Based MIMO

“…As opposed to other multi-antenna jammers using perfect CSI or knowledge of the legitimate signal in order to device a potent jamming strategy [15], [17], [18], [20], [21], [29]- [31], our proposed jammer does not rely on prior knowledge of the channel state, or of the legitimate signal, but is able leverage the reciprocity inherent to TDD-systems to estimate the channel to the target, outperforming an omnidirectional barrage jammer. The jammer only has limited knowledge of the legitimate link: an upper bound on the maximum excess delay (number of taps) of the frequency-selective channel, the carrier frequency of the legitimate link, and the time duration of each transmission slot (all of which could be estimated, but are assumed to be known here).…”

Mutual Information Games in Multiuser Channels With Correlated Jamming

“…From the users' perspective the channel becomes an AWGN multiple-access channel, where the effective noise is the sum of the ambient Gaussian noise and the jammer Gaussian signal. The best user strategy in this case is a straightforward extension of the results in [16] where only one user transmits at a time [1], [2]. Next, we assume that the uncorrelated jammer has the CSI as well.…”

“…If at a pair of fading levels, both users transmit with nonzero powers, (45) results in (46) which happens with zero probability if the fading probability density function (pdf) is continuous. Therefore, similar to the system without a jammer in [16], only one user transmits at any given channel state [1], [2]. Define as where and are found by using power constraints on the users and the jammer [1], [2].…”

“…The AWGN channel with two users and one jammer is modeled as (1) where is the th user's signal, is the attenuation of the th user's channel, is the jammer's signal, is the attenuation of the jammer's channel ,and is a zero-mean Gaussian random variable with variance . To model fading in the received powers, we consider and as fading random variables, and to further model the phase of the channel coefficients, we substitute the real attenuations and with complex fading random variables for the amplitude fading coefficient of the th user's channel, and for the amplitude fading coefficient of the jammer's channel (2) All fading random variables are assumed to be independent and identically distributed (i.i.d.) in time and independent across the transmitters.…”

Jamming games for power controlled medium access with dynamic traffic

“…The model has been extended as a non-cooperative game to MIMO fading channels [2] and to MAC channels with two users in the presence of a jammer [3]. The energy cost has been incorporated into jamming games over multiple Gaussian channels in [4], where the jammer signal is treated as noise, and the effects of random channels on jamming games have been analyzed in [5].…”