Abstract
Reputation is considered to be one of the vital entities for maintaining collaboration among wireless mobile nodes present in an ad hoc environment. The nodes in MANET are dynamic and could change its behaviour drastically, but establishing maximum level of cooperation between these nodes is highly crucial. Moreover, the presence of selfish nodes has a greater impact on the resilience of the network. Hence, a need arises for formulating a mechanism that deals with these selfish nodes. In this paper, we contribute an Erlang distribution based Conditional Reliability Mechanism (ECRCM) that aids in detecting and isolating the selfish nodes present in an ad hoc environment. This mathematical model makes the routing decision with the help of a parameter called Erlang factor based Conditional Reliability Coefficient (ECRC) determined for each and every mobile node present in the ad hoc network. Extensive simulations were carried out through ns-2 simulator and the analysis was based on performance metrics such as packet delivery ratio, throughput, control overhead and total overhead. ECRCM also helps in framing an optimal threshold range for selfish node detection. From the results, it is obvious that the threshold range derived in our study remarkably identifies maximum number of selfish nodes when compared to the selfishness detecting parameters available in the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
