Skip to main content

Dynamic Security Games with Extra Information

  • Chapter
  • First Online:
Dynamic Games for Network Security

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSELECTRIC))

  • 436 Accesses

Abstract

In the previous chapter, we have reviewed existing applications of SG in addressing different dynamic security problems. Nonetheless, most existing works assume equal knowledgeable defender and attacker, whereas, in practice, the defender and the attacker are likely to hold different information about the ongoing security rivalries. Conventional SG based methods developed in existing literature do not fit well to such dynamic security games with information asymmetry. To achieve the best possible defense in such scenarios, new techniques that can adequately manage the information asymmetry are needed. In this chapter, we will focus on scenarios where the defender has extra information and present two novel algorithms, termed minimax-PDS and WoLF-PDS, to solve the corresponding dynamic security games with extra information. After establishing the theoretical basis, we will provide two exemplary applications to illustrate how these two new algorithms can be leveraged to handle dynamic security games with extra information. The first application is concerned with anti-jamming and the second application is concerned with a cloud-based security game.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In the rest part of this chapter, superscripts (m), (w), (mp) and (wp) will be used for the quality and value functions in the conventional minimax-Q and WoLF, and the proposed minimax-PDS and WoLF-PDS algorithms, respectively.

  2. 2.

    Note that similar performance gain can be observed when the jammer adopts other multi-agent reinforcement algorithms but the corresponding results are omitted here.

References

  1. N. Mastronarde, M. van der Schaar, Fast reinforcement learning for energy-efficient wireless communication. IEEE Trans. Signal Process. 59(12), 6262–6266 (2011)

    Article  MathSciNet  Google Scholar 

  2. S. Sudevalayam, P. Kulkarni, Energy harvesting sensor nodes: survey and implications. IEEE Commun. Surv. Tutorials 13(3), 443–461 (2011)

    Article  Google Scholar 

  3. R. Prasad, S. Devasenapathy, V. Rao, J. Vazifehdan, Reincarnation in the ambiance: devices and networks with energy harvesting. IEEE Commun. Surv. Tutorials 16(1), 195–213 (2014)

    Article  Google Scholar 

  4. A. Mpitziopoulos, D. Gavalas, C. Konstantopoulos, G. Pantziou, A survey on jamming attacks and countermeasures in WSNs. IEEE Commun. Surv. Tutorials 11(4), 42–56 (2009)

    Article  Google Scholar 

  5. M. Strasser, S. Capkun, C. Popper, M. Cagalj, Jamming-resistant key establishment using uncoordinated frequency hopping, in Proceedings of IEEE SP (Oakland) (2008)

    Google Scholar 

  6. C. Li, H. Dai, L. Xiao, P. Ning, Communication efficiency of anti-jamming broadcast in large-scale multi-channel wireless networks. IEEE Trans. Signal Process. 60(10), 5281–5292 (2012)

    Article  MathSciNet  Google Scholar 

  7. W. Xu, W. Trappe, Y. Zhang, Anti-jamming timing channels for wireless networks, in Proceedings of ACM WiSec (2008)

    Google Scholar 

  8. Y. Liu, P. Ning, BitTrickle: defending against broadband and high-power reactive jamming attacks, in Proceedings of IEEE INFOCOM (2012)

    Google Scholar 

  9. P. Tague, Improving anti-jamming capability and increasing jamming impact with mobility control, in Proceedings of IEEE MASS (2010)

    Google Scholar 

  10. X. He, H. Dai, P. Ning, Dynamic adaptive anti-jamming via controlled mobility, in Proceedings of IEEE CNS, National Harbor, MD (2013)

    Google Scholar 

  11. A. György, T. Linder, G. Lugosi, G. Ottucsák, The on-line shortest path problem under partial monitoring. J. Mach. Learn. Res. 8, 2369–2403 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Q. Wang, P. Xu, K. Ren, X.Y. Li, Towards optimal adaptive UFH-based anti-jamming wireless communication. IEEE J. Sel. Areas Commun. 30(1), 16–30 (2012)

    Article  Google Scholar 

  13. H. Li, Z. Han, Dogfight in spectrum: combating primary user emulation attacks in cognitive radio systems, Part I: known channel statistics. IEEE Trans. Wirel. Commun. 9(11), 3566–3577 (2010)

    Google Scholar 

  14. M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  15. J. Oberheide, K. Veeraraghavan, E. Cooke, J. Flinn, F. Jahanian, Virtualized in-cloud security services for mobile devices, in ACM Workshop on Virtualization in Mobile Computing, Breckenridge, CO, June 2008

    Google Scholar 

  16. V. Varadharajan, U. Tupakula, Security as a service model for cloud environment. IEEE Trans. Netw. Serv. Manag. 11(1), 60–75 (2014)

    Article  Google Scholar 

  17. W. Yassin, N.I. Udzir, Z. Muda, A. Abdullah, M.T. Abdullah, A cloud-based intrusion detection service framework, in Proceedings of IEEE CyberSec, Kuala Lumpur, June 2012

    Google Scholar 

  18. Y. Meng, W. Li, L. Kwok, Design of cloud-based parallel exclusive signature matching model in intrusion detection, in Proceedings of IEEE PHCC and EUC, Hunan, Nov 2013

    Google Scholar 

  19. X. He, H. Dai, P. Ning, Faster learning and adaptation in security games by exploiting information asymmetry. IEEE Trans. Signal Process. 64(13), 3429–3443 (2016)

    Article  MathSciNet  Google Scholar 

  20. T. He, S. Chen, H. Kim, L. Tong, K. Lee, Scheduling parallel tasks onto opportunistically available cloud resources, in Proceedings of IEEE CLOUD, Honolulu, HI, June 2012

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 The Author(s)

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

He, X., Dai, H. (2018). Dynamic Security Games with Extra Information. In: Dynamic Games for Network Security. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-75871-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75871-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75870-1

  • Online ISBN: 978-3-319-75871-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics