Performance improvement of intrusion detection with fusion of multiple sensors

The technological advancement in computer network system and its related infrastructure is the reason for an increased occurrence rate of computer intrusions. An intrusion is defined as any set of actions to violate the security protocol of a computer network system [8]. Intrusion detection system is a classifier which collects evidences for the presence of intrusion and raises an alarm for any abnormalities present [7]. There is tremendous research going on to improve the efficiency of an intrusion detection system. The major research in [2, 4, 9, 12] shows that intrusion detection system encounters two major drawbacks: higher false alarm rate and lower detection rate. A prospective approach to improve the detection rate and to reduce the false alarm rate is through the use of distributed IDS systems.

The distributed IDS systems consist of multiple intrusion detection systems which are dissimilar in nature. The dissimilarity is by the fact that they extract different features of network traffic or might have completely different detection algorithms, viz., signature-based IDS or anomaly-based IDS [6]. Authors in [14] present the alert fusion process and show that when anomaly detection techniques and signature recognition techniques are applied simultaneously to the same observed activities of computer and network systems, anomaly detection techniques and signature recognition techniques complement one another for achieving a high detection rate and a low false alarm rate. However, along with the potential benefits of distributed IDS system, deciding an efficient fusion rule to combine evidences from diverse IDS systems is still a loophole. Also, there is a concern on finding the reliability value of an IDS. The work in this paper proposes a new fusion rule that incorporates reliability of evidence and also efficiently handles the information for diverse IDS.

Evidence theory is a mathematical theory used to combine the evidence from multiple sources of information to calculate the probability of an event. The Dempster–Shafer theory proposed by Arthur Dempster and modified by Glenn Shafer in [11] is the first mathematical theory proposed to combine uncertain information of sources to make an inference. The fusion rule proposed under Dempster–Shafer framework is called as Dempster–Shafer rule. Dempster–Shafer rule has been a topic of debate for researchers working in the field of information fusion.

The fusion theory is used to combine masses from n evidence sources and outputs a fused decision. For number of evidence sources \(n \ge 2\), let \(\varTheta = \{ \theta _1, \theta _2, \theta _3, \ldots , \theta _n \}\) be the frame of discernment for the fusion problem under consideration having n exclusive and exhaustive hypothesis. The sets of all subsets of \(\varTheta \) is called as power-set of \(\varTheta \) and is denoted by \(2^\varTheta \). In Shafer’s framework [11], the basic belief assignment (bba) is a function m from \(2^\varTheta \), the power set of \(\varTheta \) to [0, 1]. The mass assignment will satisfy the propertyLet \(m_1(B)\) and \(m_2(C)\) be two independent masses from two sources of evidence; then the combined mass m(A) obtained by combining \(m_1(B)\) and \(m_2(C)\) through the rule:

The purpose of designing a fusion-based distributed intrusion detection system is to detect intrusion which was rather not detected by single IDS system. The success of fusion depends upon the accuracy of evidence provided by the individual IDS. Majority of fusion rules proposed in the literature along with DS rule assume all evidences to be equally reliable and assign the same weightage during the fusion process. However, it is often the case that some IDS are completely reliable, while others are completely unreliable for a particular frame of discernment. Reliability of IDS is defined as the level of trust about the evidence provided by the IDS for the presence of an intrusion [10]. Reliability indicates the relative stability of IDS whose value lies between 0 and 1 [10].

Within the framework of distributed IDS, the evidence provided by IDS with zero reliability should be completely ignored and the evidence provided by IDS with higher reliability should be given more weightage. This calls for a fusion rule that effectively handles the reliability of each evidence while making the decision. However, one major concern in incorporating reliability of IDS into the fusion rule is the problem of obtaining reliability values. The problem of finding reliability can be related to the problem of conflict between various intrusion detection systems. The mere existence of conflict between the evidences provided by intrusion detection systems indicates the presence of an unreliable IDS which may cause the fusion result to be complementary from reality.

Another approach for finding reliability is to relate reliability with the true alert rate of IDS. In this approach, it is assumed that the IDS having highest true alert rate and lowest false alert rate will be assigned highest reliability and, thereby, given highest weightage in fusion process, while all other IDS is assigned relative reliability value based on their true alert rate and false alert rate. The approach of assigning reliability based on true alert rate requires the ground truth knowledge. While the approach of assigning reliability based on conflict between the IDS can work without the knowledge of ground truth.

A distributed IDS is a framework where multiple heterogeneous IDS systems are deployed to sniff the incoming network traffic. Each IDS while sniffing the incoming network traffic raises an alert for the presence of an attack. The alerts can be positive alerts or negative alerts. Positive alerts are the alerts favouring the occurrence of an intrusion/attack and negative alerts are alerts opposing the presence of an intrusion/attack. The alerts generated by IDS are converted to a mass value. Alert-to-mass conversion is done using the formula proposed by Jøsang [5]. If we denote the hypothesis that attack is present by H and attack not present by \(-H\), then, according to [5], we have, where P is the positive evidence in favour of hypothesis H, N is negative evidence opposing the hypothesis H or favouring hypothesis \(-H\), and C is constant which is equal to 2 for binary frame of hypothesis. m(H) is the mass value for hypothesis H. \(m(H \hbox { or }-H)\) is mass value for hypothesis H or H and can be called \(m(\hbox {uncertain})\) i.e., mass value for uncertainty between H and \(-H\). The converted mass is then fused using fusion rule to make an inference.

The Dempster–Shafer rule as defined by Eq. (2) has the following limitations:To overcome the limitations of Dempster–Shafer rule, we propose a new fusion rule which is the modification of Shafer’s framework [11]. The proposed rule is defined as below:where Here, \(R_n\) is the reliability value of nth source of evidence. \(\hbox {CRF}(A)\) is conjunctive reliability value about A, and \(\hbox {DRF}(A)\) is disjunctive reliability value about A. \(\hbox {CRF}\) and \(\hbox {DRF}\) values act as weighting factors to compromise between conjunctive mass and disjunctive mass. The complete flow diagram of the proposed alert fusion method is as shown in Fig. 1.

For alert fusion of multiple intrusion detection systems, four heterogeneous intrusion detection systems namely, Snort, Suricata, packet header anomaly detector (PHAD) and network anomaly detector (NETAD) have been selected. The reason behind such selection is that snort and suricata are signature-based intrusion detectors, while PHAD and NETAD are anomaly detectors. Thus, both types are complementary to one another which enhances the performance of fused IDS. The simulation environment consists three third-generation Intel Core i5 processors (1.6 GHz); Operating system installed is Linux Ubuntu with 4 GB RAM. One machine is deployed with signature-based IDS such as snort and suricata. Another machine is deployed with anomaly detectors such as PHAD and NETAD. Third machine acts as an attacker machine having KDD99 Dataset. The packets of the dataset are being replayed with TCPREPLAY tool [13].

KDD is the abbreviation of knowledge discovery in databases. KDD refers to the overall process of recovering knowledge from data. Specifically, KDD99 is designed for evaluation of intrusion in computer networks [1]. It is like a benchmark on which many researchers have tested their methodologies. The dataset is available in tcpdump format. The original tcpdump files were preprocessed for utilization of intrusion detection benchmark. KDD99 dataset consists of 4,900,000 single connection vectors, each of which contains 41 features and is labeled as either normal or an attack. The attack falls in one of the types and subtypes shown in Table 1. The list of 41 features of dataset is shown in appendix as Table 4. The KDD99 was preprocessed, and then, total 3456 packets containing attack and non-attacks packets in various types were loaded on the network and are replayed using TCPREPLAY [13].

The evaluation of proposed rule against KDD99 [1] is done by considering two different approaches of reliability. The experiment focuses on detection of smurf attack. Hence, the frame of discernment is \(\varTheta = \{ \hbox {smurf},-\hbox {smurf}, \theta \}\). In KDD99 dataset [1], total 1944 smurf attack is present. Table 2 shows the results of true positive rate (TPR), false positive rate (FPR), positive prediction value (PPV) and negative prediction value (NPV) of Snort, Suricata, NETAD and PHAD as an individual IDS. Table 2 also shows the result of alert fusion of Snort, Suricata, NETAD and PHAD using Dempster–Shafer rule and the proposed rule. The results of fusion are derived by considering conflict between IDS evidence as a reliability factor. It can be observed from Fig. 2 that with alert fusion using proposed rule, the number of true negatives are higher compared to individual IDS, while there is a drastic reduction in the number of false positives. Figure 3 shows that the alert fusion with proposed rule drastically reduces the false positive rate (FPR) without affecting the true positive rate.

Table 3 shows the results of true positive rate (TPR), false positive rate (FPR), positive prediction value (PPV) and negative prediction value (NPV) of Snort, Suricata, NETAD and PHAD as an individual IDS. Table 3 also shows the result of alert fusion of Snort, Suricata, NETAD and PHAD using Dempster–Shafer rule and the proposed rule. The results of fusion are derived by considering true positive rate of an IDS as a reliability factor. Figures 4 and 5 show the comparison of individual IDS systems with fusion using DS and fusion using proposed rule in terms of true positives, true negatives, false negatives and false positives and FPR and TPR, respectively.

Distributed alert fusion can be achieved with Dempster–Shafer rule. The proposed alert fusion system described here improves the performance of detection by reducing the ad hoc created by high amount of false alerts. The reduction in false alerts is achieved by the fact that the DS rule assumes all evidence sources to be equally reliable, while the proposed rule incorporates variable reliability of IDS measured either from conflict between IDS or from true positive rate of IDS.