A game-theoretic intrusion detection model for mobile ad hoc networks

In this paper, we address the problem of increasing the effectiveness of an intrusion detection system (IDS) for a cluster of nodes in ad hoc networks. To reduce the performance overhead of the IDS, a leader node is usually elected to handle the intrusion detection service on behalf of the whole cluster. However, most current solutions elect a leader randomly without considering the resource level of nodes. Such a solution will cause nodes with less remaining resources to die faster, reducing the overall lifetime of the cluster. It is also vulnerable to selfish nodes who do not provide services to others while at the same time benefiting from such services. Our experiments show that the presence of selfish nodes can significantly reduce the effectiveness of an IDS because less packets are inspected over time. To increase the effectiveness of an IDS in MANET, we propose a unified framework that is able to: (1) Balance the resource consumption among all the nodes and thus increase the overall lifetime of a cluster by electing truthfully and efficiently the most cost-efficient node known as leader-IDS. A mechanism is designed using Vickrey, Clarke, and Groves (VCG) to achieve the desired goal. (2) Catch and punish a misbehaving leader through checkers that monitor the behavior of the leader. A cooperative game-theoretic model is proposed to analyze the interaction among checkers to reduce the false-positive rate. A multi-stage catch mechanism is also introduced to reduce the performance overhead of checkers. (3) Maximize the probability of detection for an elected leader to effectively execute the detection service. This is achieved by formulating a zero-sum non-cooperative game between the leader and intruder. We solve the game by finding the Bayesian Nash Equilibrium where the leader's optimal detection strategy is determined. Finally, empirical results are provided to support our solutions.

[1]  Wenke Lee,et al.  Intrusion Detection Techniques for Mobile Wireless Networks , 2003, Wirel. Networks.

[2]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[3]  Cristina Comaniciu,et al.  A Bayesian game approach for intrusion detection in wireless ad hoc networks , 2006, GameNets '06.

[4]  Tae Woong Yoon,et al.  Proceedings of the 43rd IEEE Conference on Decision and Control , 2004 .

[5]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[6]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[7]  David C. Parkes,et al.  Specification faithfulness in networks with rational nodes , 2004, PODC '04.

[8]  Nicholas R. Jennings,et al.  Computational-Mechanism Design: A Call to Arms , 2003, IEEE Intell. Syst..

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[11]  Songwu Lu,et al.  Self-organized network-layer security in mobile ad hoc networks , 2002, WiSE '02.

[12]  Yih-Chun Hu,et al.  A survey of secure wireless ad hoc routing , 2004, IEEE Security & Privacy Magazine.

[13]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[15]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[16]  Klara Nahrstedt,et al.  iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[17]  M. Willem.  Minimax Theorems , 1997 .

[18]  Refik Molva,et al.  Analysis of coalition formation and cooperation strategies in mobile ad hoc networks , 2005, Ad Hoc Networks.

[19]  T. Basar,et al.  A game theoretic analysis of intrusion detection in access control systems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[20]  Wenke Lee,et al.  A cooperative intrusion detection system for ad hoc networks , 2003, SASN '03.

[21]  Prabir Bhattacharya,et al.  NIS06-3: A Game Theoretic Approach to Detect Network Intrusions: The Cooperative Intruders Scenario , 2006, IEEE Globecom 2006.

[22]  L. Shapley,et al.  The Shapley Value , 1994 .

[23]  Amitabh Mishra,et al.  Intrusion detection in wireless ad hoc networks , 2004, IEEE Wireless Communications.

[24]  P. Morris.  Introduction to Game Theory , 1994 .

[25]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.