Intrusion Detection System Resiliency to Byzantine Attacks: The Case Study of Wormholes in OLSR
Source: University of Maryland
This paper proposes a mathematical framework for obtaining performance bounds of Byzantine attackers and the Intrusion Detection System (IDS) in terms of detection delay. It formulates the problem of distributed collaborative defense against coordinated attacks in MANET as a dynamic game problem. In this formulation on the one hand there is a group of attackers that observe what is going on in the network and coordinate their attack in an adaptive manner. On the other side, there is a group of defending nodes that collaboratively observe the network and coordinate their actions against the attackers. The paper provides a mathematical framework for efficient identification of the worst attacks and damages that the attackers can achieve, as well as the best response of the defenders.