Multiband Transmission Under Jamming: A Game Theoretic Perspective

  • Tongtong Li
  • Tianlong Song
  • Yuan Liang


In this chapter, we consider optimal multiband transmission under hostile jamming, where both the authorized user and the jammer are power-limited and operate against each other. The strategic decision-making of the authorized user and the jammer is modeled as a two-party zero-sum game, where the payoff function is the capacity that can be achieved by the authorized user in the presence of the jammer. First, we investigate the game under AWGN channels. It is found that either for the authorized user to maximize its capacity or for the jammer to minimize the capacity of the authorized user, the best strategy for both of them is to distribute the transmission power or jamming power uniformly over all the available spectrum. The minimax capacity can be calculated based on the channel bandwidth and the signal-to-jamming and noise ratio, and it matches with the Shannon channel capacity formula. Second, we consider frequency selective fading channels. We characterize the dynamic relationship between the optimal signal power allocation and the optimal jamming power allocation in the minimax game and then present an iterative water-filling algorithm to find the optimal power allocation schemes for both the authorized user and the jammer.


  1. 1.
    R. B. Myerson, Game Theory: Analysis of Conflict. Cambridge, MA: Harvard University Press, 2007.zbMATHGoogle Scholar
  2. 2.
    S. Lasaulce and H. Tembine, Game Theory and Learning for Wireless Networks: Fundamentals and Applications, 1st ed. Cambridge, MA: Academic Press, 2011.Google Scholar
  3. 3.
    T. Basar and Y.-W. Wu, “Solutions to a class of minimax decision problems arising in communication systems,” in The 23rd IEEE Conference on Decision and Control, Dec 1984, pp. 1182–1187.Google Scholar
  4. 4.
    M. Medard, “Capacity of correlated jamming channels,” in Allerton Conference on Communications, Computing and Control, 1997.Google Scholar
  5. 5.
    S. Farahmand, G. Giannakis, and X. Wang, “Max-min strategies for power-limited games in the presence of correlated jamming,” in 41st Annual Conference on Information Sciences and Systems, March 2007, pp. 300–305.Google Scholar
  6. 6.
    T. Ericson, “The noncooperative binary adder channel,” IEEE Transactions on Information Theory, vol. 32, no. 3, pp. 365–374, 1986.MathSciNetCrossRefGoogle Scholar
  7. 7.
    L. Zhang, H. Wang, and T. Li, “Anti-jamming message-driven frequency hopping-part i: System design,” IEEE Transactions on Wireless Communications, vol. 12, no. 1, pp. 70–79, Jan. 2013.CrossRefGoogle Scholar
  8. 8.
    T. Song, Z. Fang, J. Ren, and T. Li, “Precoding for OFDM under disguised jamming,” in 2014 IEEE Global Communications Conference, Dec 2014, pp. 3958–3963.Google Scholar
  9. 9.
    T. Song, K. Zhou, and T. Li, “CDMA system design and capacity analysis under disguised jamming,” IEEE Transactions on Information Forensics and Security, vol. PP, no. 99, pp. 1–1, 2016.Google Scholar
  10. 10.
    K. Zhou, T. Song, J. Ren, and T. Li, “Robust CDMA receiver design under disguised jamming,” in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), March 2016, pp. 2179–2183.Google Scholar
  11. 11.
    J. Chiang and Y.-C. Hu, “Cross-layer jamming detection and mitigation in wireless broadcast networks,” IEEE/ACM Transactions on Networking, vol. 19, no. 1, pp. 286–298, Feb 2011.CrossRefGoogle Scholar
  12. 12.
    R. Di Pietro and G. Oligeri, “Jamming mitigation in cognitive radio networks,” IEEE Network, vol. 27, no. 3, pp. 10–15, May 2013.CrossRefGoogle Scholar
  13. 13.
    T. Basar, “The Gaussian test channel with an intelligent jammer,” IEEE Transactions on Information Theory, vol. 29, no. 1, pp. 152–157, Jan 1983.CrossRefGoogle Scholar
  14. 14.
    S. Diggavi and T. Cover, “The worst additive noise under a covariance constraint,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 3072–3081, Nov 2001.MathSciNetCrossRefGoogle Scholar
  15. 15.
    W. Stark and R. McEliece, “On the capacity of channels with block memory,” IEEE Transactions on Information Theory, vol. 34, no. 2, pp. 322–324, Mar 1988.MathSciNetCrossRefGoogle Scholar
  16. 16.
    J. Borden, D. Mason, and R. McEliece, “Some information theoretic saddlepoints,” SIAM Journal on Control and Optimization, vol. 23, no. 1, pp. 129–143, 1985.MathSciNetCrossRefGoogle Scholar
  17. 17.
    R. Mallik, R. Scholtz, and G. Papavassilopoulos, “Analysis of an on-off jamming situation as a dynamic game,” IEEE Transactions on Communications, vol. 48, no. 8, pp. 1360–1373, Aug 2000.CrossRefGoogle Scholar
  18. 18.
    G. Scutari, D. Palomar, and S. Barbarossa, “Optimal linear precoding strategies for wideband noncooperative systems based on game theory-part i: Nash equilibria,” IEEE Transactions on Signal Processing, vol. 56, no. 3, pp. 1230–1249, March 2008.MathSciNetCrossRefGoogle Scholar
  19. 19.
    Z. Han, Z. Ji, and K. Liu, “Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions,” IEEE Transactions on Communications, vol. 53, no. 8, pp. 1366–1376, Aug 2005.CrossRefGoogle Scholar
  20. 20.
    A. Garnaev, Y. Hayel, and E. Altman, “A bayesian jamming game in an OFDM wireless network,” in 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, May 2012, pp. 41–48.Google Scholar
  21. 21.
    R. Gohary, Y. Huang, Z.-Q. Luo, and J.-S. Pang, “A generalized iterative water-filling algorithm for distributed power control in the presence of a jammer,” IEEE Transactions on Signal Processing, vol. 57, no. 7, pp. 2660–2674, July 2009.MathSciNetCrossRefGoogle Scholar
  22. 22.
    Z. Han, N. Marina, M. Debbah, and A. Hjørungnes, “Physical layer security game: Interaction between source, eavesdropper, and friendly jammer,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, no. 1, pp. 1–10, 2010.Google Scholar
  23. 23.
    J. Neel, R. Buehrer, J. Reed, and R. P. Gilles, “Game theoretic analysis of a network of cognitive radios,” in 45th Midwest Symposium on Circuits and Systems, vol. 3, Aug 2002, pp. III–409–III–412 vol.3.Google Scholar
  24. 24.
    Z. Ji and K. Liu, “Dynamic spectrum sharing: A game theoretical overview,” IEEE Communications Magazine, vol. 45, no. 5, pp. 88–94, May 2007.CrossRefGoogle Scholar
  25. 25.
    R. El-Bardan, S. Brahma, and P. Varshney, “A game theoretic power control framework for spectrum sharing in competitive environments,” in Asilomar Conference on Signals, Systems and Computers, Nov 2013, pp. 1493–1497.Google Scholar
  26. 26.
    V. Nadendla, H. Chen, and P. Varshney, “Minimax games for cooperative spectrum sensing in a centralized cognitive radio network in the presence of interferers,” in MILITARY COMMUNICATIONS CONFERENCE, Nov 2011, pp. 1256–1260.Google Scholar
  27. 27.
    R. Menon, A. MacKenzie, R. Buehrer, and J. Reed, “A game-theoretic framework for interference avoidance in ad hoc networks,” in IEEE Global Telecommunications Conference, Nov 2006, pp. 1–6.Google Scholar
  28. 28.
    S. Wei, R. Kannan, V. Chakravarthy, and M. Rangaswamy, “Csi usage over parallel fading channels under jamming attacks: A game theory study,” IEEE Transactions on Communications, vol. 60, no. 4, pp. 1167–1175, April 2012.CrossRefGoogle Scholar
  29. 29.
    A. Garnaev, W. Trappe, and A. Petropulu, “Equilibrium strategies for an ofdm network that might be under a jamming attack,” in 2017 51st Annual Conference on Information Sciences and Systems (CISS), March 2017, pp. 1–6.Google Scholar
  30. 30.
    P. D. Straffin, Game Theory and Strategy, 1st ed. Washinton, DC: The Mathematical Association of America, 1993.zbMATHGoogle Scholar
  31. 31.
    R. Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels,” Z. Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 44, no. 2, pp. 159–175, 1978.MathSciNetCrossRefGoogle Scholar
  32. 32.
    A. Lapidoth and P. Narayan, “Reliable communication under channel uncertainty,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2148–2177, 1998.MathSciNetCrossRefGoogle Scholar
  33. 33.
    L. Zhang and T. Li, “Anti-jamming message-driven frequency hopping-part ii: Capacity analysis under disguised jamming,” IEEE Transactions on Wireless Communications, vol. 12, no. 1, pp. 80–88, Jan. 2013.CrossRefGoogle Scholar
  34. 34.
    S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.Google Scholar
  35. 35.
    Q. Qi, A. Minturn, and Y. Yang, “An efficient water-filling algorithm for power allocation in OFDM-based cognitive radio systems,” in 2012 International Conference on Systems and Informatics (ICSAI), May 2012, pp. 2069–2073.Google Scholar
  36. 36.
    T. Song, W. E. Stark, T. Li, and J. K. Tugnait, “Optimal multiband transmission under hostile jamming,” IEEE Transactions on Communications, vol. 64, no. 9, pp. 4013–4027, Sept 2016.CrossRefGoogle Scholar
  37. 37.
    W. Yu, W. Rhee, S. Boyd, and J. M. Cioffi, “Iterative water-filling for Gaussian vector multiple-access channels,” IEEE Transactions on Information Theory, vol. 50, no. 1, pp. 145–152, Jan 2004.MathSciNetCrossRefGoogle Scholar
  38. 38.
    W. Yu and J. M. Cioffi, “On constant power water-filling,” in IEEE International Conference on Communications, vol. 6, 2001, pp. 1665–1669.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Tongtong Li
    • 1
  • Tianlong Song
    • 2
  • Yuan Liang
    • 1
  1. 1.Department of Electrical and Computer EngineeringMichigan State UniversityEast LansingUSA
  2. 2.Zillow IncSeattleUSA

Personalised recommendations