Abstract

In Mobile Ad hoc Network, reliable communication during multicasting depends on the root node or the rendezvous point of the multicast tree. But, any compromised root node poses a significant threat to the network that affects the reliability of packet delivery as the packets relayed from the upstream nodes to the downstream nodes are dropped in large numbers. A Markov based prediction model that forecasts the possibility of a mobile node to get infected by a rendezvous point attack is examined.This paper presents a Hyper-geometric Trust Factor based Markov Prediction Mechanism (HTFMPM) for mitigating rendezvous point attack that quantifies the influence of this attack in the context of multicast routing activity. This HTFMPM mechanism utilizes a Markov process for predicting the possibility of a mobile node getting compromised through rendezvous point attack using hyper-geometric distribution. Extensive simulations were conducted using ns-2 simulator and the results indicate that the rate of detection of rendezvous point attack using HTFMPM is 32% more rapid than that of the existing three benchmark mitigation mechanisms like Co-operation Of Nodes Fairness In Dynamic Ad-hoc NeTworks, Correlated Node Behavior Model and Probabilistic Behavior Model. In addition, the proposed hyper-geometric approach identifies that a co-operative mobile node gets converted into a compromised rendezvous point node within an average time of 6.23 s.

Full Text
Paper version not known

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 call

Disclaimer: 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.