Cronbach Alpha Reliability Factor Based Reputation Mechanism for Mitigating Byzantine Attack in MANETs

Abstract

In MANETs, co-operation is considered as a potential factor required for reliable delivery of data the mobile nodes. But, byzantine mobile nodes pose devastating influence over the degree of so-operation attributed in the network. Hence, an estimation model that assesses the co-operation through reliability factor derived from node’s behavior becomes essential. This paper proposes a Cronbach Alpha Reliability Factor based Reputation Mitigation Mechanism (CARFRMM) that investigates and quantifies the impact of byzantine behavior towards the co-ordination of the network. This CARFRMM approach incorporates a distributed mitigation mechanism that manipulates reputation of each and every mobile using Cronbach Alpha Reliability Factor. This Reliability based estimation model also aids in framing a lower and upper bound for network survivability. Extensive simulations were carried out through ns-2 and the results indicates that, CARFRMM show better performance than the existing benchmark mitigation mechanisms like Cohen Kappa Reliability Coefficient based Reputation Mechanism (CKRCRM), Cooperation Of Nodes Fairness In Dynamic Ad hoc NeTworks (CONFIDANT), Packet Conservation Monitoring Algorithm (PCMA) proposed for byzantine nodes. Further, CARFRMM isolates the byzantine nodes rapidly at the rate of 28% than the considered benchmark mitigation mechanisms. Furthermore, this approach computes the mean transition time incurred by a mobile node to transit from cooperative to byzantine node as 7.89 s and also identifies the minimum and maximum byzantine behavior detection time as 120 and 160 s respectively.