This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: A Bayesian Game Approach for Intrusion Detection in Wireless Ad Hoc Networks * Yu Liu Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken, NJ 07030, USA [email protected] Cristina Comaniciu Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken, NJ 07030, USA Cristina.Comaniciu@ stevens.edu Hong Man Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken, NJ 07030, USA [email protected] ABSTRACT In wireless ad hoc networks, although defense strategies such as intrusion detection systems (IDSs) can be deployed at each mobile node, significant constraints are imposed in terms of the energy expenditure of such systems. In this pa- per, we propose a game theoretic framework to analyze the interactions between pairs of attacking/defending nodes us- ing a Bayesian formulation. We study the achievable Nash equilibrium for the attacker/defender game in both static and dynamic scenarios. The dynamic Bayesian game is a more realistic model, since it allows the defender to con- sistently update his belief on his opponent’s maliciousness as the game evolves. A new Bayesian hybrid detection ap- proach is suggested for the defender, in which a lightweight monitoring system is used to estimate his opponent’s ac- tions, and a heavyweight monitoring system acts as a last resort of defense. We show that the dynamic game produces energy-efficient monitoring strategies for the defender, while improving the overall hybrid detection power. Categories and Subject Descriptors H.5 [ Information Interfaces and Presentation ]: Mis- cellaneous General Terms Security, Design Keywords ad hoc network, noncooperative game, Bayesian game, at- tacker/defender game * This work was supported in part by the ONR grant number N00014-06-1-0063. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Valuetools ’06, October 11-13, 2006, Pisa, Italy. Copyright 2006 ACM 1-59593-507-X ... $ 5.00. 1. INTRODUCTION Ad hoc networks are infrastructure-free, self-organized sys- tems, for which the network operation is based on cooper- ation of nodes within the neighborhood. In an open envi- ronment (i.e. no pre-existing trusted authority), each node agrees to perform network functions such as forwarding and routing. Besides selfishness, ad hoc network misbehavior may be inflicted by malicious nodes, each of which inten- tionally aims at harming the network operation. A malicious node can mount attacks against different network layers to either compromise individual node(s) or degrade the perfor- mance of the overall network. Moreover, existing protocolsmance of the overall network....
View Full Document
This note was uploaded on 03/19/2012 for the course COMPUTER S 2143 taught by Professor Singh during the Spring '12 term at Punjab Engineering College.
- Spring '12