Jamming Game in a Dynamic Slotted ALOHA Network

  • Andrey Garnaev
  • Yezekael Hayel
  • Eitan Altman
  • Konstantin Avrachenkov
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 75)


In this paper we suggest a development of the channel capacity concept for a dynamic slotted ALOHA network. Our object is to find maxmin successful transmissions of an information over a dynamic communication channel. To do so, we analyze an ALOHA-type medium access control protocol performance in the presence of a jammer. The time is slotted and the system is described as a zero-sum multistage matrix game. Each player, the sender and the jammer, have different costs for respectively sending their packets and jamming, and the jammer wants to minimize the payoff function of the sender. For this case, we found explicit expression of the equilibrium strategies depending on the costs for sending packets and jamming. Properties of the equilibrium are investigated. In particular we have found a simple linear correlation between the probabilities to act for both players in different channel states which are independent on the number of packets left to send. This relation implies that increasing activity of the jammer leads to reducing activity of the user at each channel state. The obtained results are generalized for the case where the channel can be in different states and change according to a Markov rule. Numerical illustrations are performed.


Saddle Point Channel State Mixed Strategy Successful Transmission Transmission Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Owen, G.: Game Theory. W.B.Sanders, Philadelphia (1982)zbMATHGoogle Scholar
  2. 2.
    Zander, J.: Jamming in Slotted ALOHA Multihop Packet Radio Networks. IEEE Trans. on Comm. 39(10) (1991)Google Scholar
  3. 3.
    Ma, R., Misra, V., Rubenstein, D.: An Analysis of Generalized Slotted-Aloha Protocols. IEEE/ACM Trans. on Networking 17(3) (2009)Google Scholar
  4. 4.
    Abramson, N.: The Aloha-system-another alternative for computer communications. In: AFIPS Conf. Proc., vol. 36, pp. 295–298 (1970)Google Scholar
  5. 5.
    Roberts, L.: Aloha Packet System with and without slots and capture. ACM SIGCOMM Comput. Comm. Rev. 5(2) (1975)Google Scholar
  6. 6.
    Jin, Y., Kesidis, G.: Equilibria of a Noncooperative Game for Heterogeneous Users of an ALOHA Network. IEEE Communications Letters 6(7) (2002)Google Scholar
  7. 7.
    Altman, E., ELAzouzi, R., Jimenez, T.: Slotted Aloha as a game with partial information. Computer Networks 45(6) (2004)Google Scholar
  8. 8.
    Menache, I., Shimkin, N.: Efficient Rate-Constrained Nash Equilibrium in Collision Channels with State Information. In: Proc. of INFOCOM 2008 (2008)Google Scholar
  9. 9.
    Menache, I., Shimkin, N.: Fixed-Rate Equilibrium in Wireless Collision Channels. In: Chahed, T., Tuffin, B. (eds.) NET-COOP 2007. LNCS, vol. 4465, pp. 23–32. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Sagduyu, Y.E., Ephremides, A.: A game-theoretic analysis of denial of service attacks in wireless random access. Journal of Wireless Networks 15, 651–666 (2009)CrossRefGoogle Scholar
  11. 11.
    Xu, X., Trappe, W., Zhang, Y., Wood, T.: The Feasibility of Launching and Detecting Jamming Attacks in Wireless Networks. In: Proc. MobiHoc 2005, Urbana-Champaign, IL (May 2005)Google Scholar
  12. 12.
    Sagduyu, Y.E., Berry, R.A., Ephremides, A.: Wireless Jamming Attacks under Dynamic Traffic Uncertainty. In: Proc. of WiOpt 2010 (2010)Google Scholar
  13. 13.
    Sagduyu, Y.E., Berry, R.A., Ephremides, A.: Jamming Games for Power Controlled Medium Access with Dynamic Traffic. In: Proc. of ISIT 2010 (2010)Google Scholar
  14. 14.
    Altman, E., Avrachenkov, K., Garnaev, A.: A Jamming Game in Wireless Networks with Transmission Cost. In: Chahed, T., Tuffin, B. (eds.) NET-COOP 2007. LNCS, vol. 4465, pp. 1–12. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Altman, E., Avratchenkov, K., Garnaev, A.: Jamming Game with Incomplete Information about the Jammer. In: Proc. of GameComm 2009 (2009)Google Scholar
  16. 16.
    Alpcan, T., Basar, T.: A Game Theoretic Analysis of Intrusion Detection in Access Control Systems. In: Proc. of IEEE Conference on Decision and Control, Paradise Island, Bahamas (2004)Google Scholar
  17. 17.
    Altman, E., Hordijk, A.: Zero-sum Markov games and worst-case optimal control of queueing systems. QUESTA 21, 415–447 (1995), Special issue on optimization of queueing systemsGoogle Scholar
  18. 18.
    Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proc. of SIGCOMM 2003, pp. 27–34 (2003)Google Scholar
  19. 19.
    Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., Diot, C.: Pocket switched networks and the consequences of human mobility in conference environments. In: Proceedings of ACM SIGCOMM First Workshop on Delay Tolerant Networking and Related Topics (2005)Google Scholar
  20. 20.
    Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw. 10(4), 477–486 (2002)CrossRefGoogle Scholar
  21. 21.
    Sharma, G., Mazumdar, R., Shroff, N.B.: Delay and capacity trade-offs in mobile ad hoc networks: A global perspective. In: Proc. of INFOCOM (2006)Google Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2012

Authors and Affiliations

  • Andrey Garnaev
    • 1
  • Yezekael Hayel
    • 2
  • Eitan Altman
    • 3
  • Konstantin Avrachenkov
    • 3
  1. 1.Saint Petersburg State UniversitySt PetersburgRussia
  2. 2.University of AvignonAvignonFrance
  3. 3.INRIA Sophia AntipolisSophia AntipolisFrance

Personalised recommendations