Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs

In mobile ad hoc networks, cooperation among active mobile nodes is considered to play a vital role in reliable transmission of data. But, the selfish mobile nodes present in an ad hoc environment refuse to forward neighbouring nodes’ packet for conserving its own energy. This intentional selfish behaviour drastically reduces the degree of cooperation maintained between the mobile nodes. Hence, a need arises for devising an effective mechanism which incorporates both energy efficiency and reputation into account for mitigating selfish behaviour in MANETs. In this paper, we propose an Exponential Reliability Coefficient based reputation Mechanism (ERCRM) which isolates the selfish nodes from the routing path based on Exponential Reliability Coefficient (ExRC). This reliability coefficient manipulated through exponential failure rate based on moving average method highlights the most recent past behaviour of the mobile nodes for quantifying its genuineness. From the simulation results, it is evident that, the proposed ERCRM approach outperforms the existing Packet Conservation Monitoring Algorithm (PCMA) and Spilt Half Reliability Coefficient based Mathematical Model (SHRCM) in terms of performance evaluation metrics such as packet delivery ratio, throughput, total overhead and control overhead. Further, this ERCRM mechanism has a successful rate of 28% in isolating the selfish nodes from the routing path. Furthermore, it also aids in framing the exponential threshold point of detection as 0.4, where a maximum number of selfish nodes are identified when compared to the existing models available in the literature.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.