Optimal Zero-Delay Jamming Over an Additive Noise Channel
Authors:
Open Access
- 15 June 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (8) , 4331-4344
Abstract
This paper considers the problem of optimal zero-delay jamming over an additive noise channel. Building on a sequence of recent results on conditions for linearity of optimal estimation, and of optimal mappings in source-channel coding, the saddle-point solution to the jamming problem is derived for general sources and channels, without recourse to Gaussianity assumptions. The linearity conditions are shown to play a pivotal role in jamming, in the sense that the optimal jamming strategy is to effectively force both the transmitter and the receiver to default to linear mappings, i.e., the jammer ensures, whenever possible, that the transmitter and the receiver cannot benefit from non-linear strategies. This result is shown to subsume the known result for Gaussian source and channel. The conditions and general settings where such unbeatable strategy can indeed be achieved by the jammer are analyzed. Moreover, a numerical procedure is provided to approximate the optimal jamming strategy in the remaining (source-channel) cases where the jammer cannot impose linearity on the transmitter and the receiver. Next, the analysis is extended to vector sources and channels. This extension involves a new aspect of optimization: the allocation of available transmit and jamming power over source and channel components. Similar to the scalar setting, the saddle-point solution is derived using the linearity conditions in vector spaces. The optimal power allocation strategies for the jammer and the transmitter have an intuitive interpretation as the jammer allocates power according to water-filling over the channel eigenvalues, while the transmitter performs water-pouring (reverse water-filling) over the source eigenvalues.Keywords
All Related Versions
Funding Information
- NSF (CCF-1016861, CCF-1111342, CCF-1118075, CCF-1320599)
- Air Force Office of Scientific Research through MURI (FA9550-10-1-0573)
This publication has 32 references indexed in Scilit:
- Gaussian sensor networks with adversarial nodes2013
- On Communication over Gaussian Sensor Networks with Adversaries: Further ResultsLecture Notes in Computer Science, 2013
- On linear transforms in zero-delay Gaussian source channel coding2012
- Convex Optimization2004
- Joint tx-rx beamforming design for multicarrier mimo channels: a unified framework for convex optimizationIEEE Transactions on Signal Processing, 2003
- Uniform power allocation in MIMO channels: a game-theoretic approachIEEE Transactions on Information Theory, 2003
- Arbitrarily varying channels with states sequence known to the senderIEEE Transactions on Information Theory, 1986
- A trace minimization problem with applications in joint estimation and control under nonclassical informationJournal of Optimization Theory and Applications, 1980
- Performance bounds and optimal linear coding for discrete-time multichannel communication systems (Corresp.)IEEE Transactions on Information Theory, 1980
- A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error CapacityThe Annals of Mathematical Statistics, 1970