A cooperative rintrusion detection algorithm based on trusted voting for mobile ad hoc network

In this paper we will propose a cooperative intrusion detection algorithm based on trusted voting on the basis of the security requirements of intrusion detection systems in mobile ad hoc networks. To run our algorithm, the network is divided into clusters and three types of nodes called header, monitor and general node are defined in each cluster. Header node initiate intrusion detection process by sending start packet for general nodes in its cluster, Based on the messages that it receives during the detection process, each monitor node determines the general nodes it suspects to be malicious and sends his vote to the header node, finally header node detect malicious nodes by analyzing these votes. This algorithm is independent of any routing protocol. Using trust-worthy nodes in voting process, defining three confidence levels for the general nodes, also taking into account the traffic rate, remaining energy and speed of general nodes in the decision making phase, considerably reduces the negative impact of natural limitation of these networks on accuracy detection, increasing the number of malicious nodes will not have any effect in accuracy of this algorithm and it is possible to detect all malicious nodes simultaneously.