Abstract
In this paper enhanced the AODV routing protocol for the prevention of black hole attack. The enhanced AODV routing protocol based on the principle of thresholding. The thresholding using the concept of reference node selection process. The reference node selection process creates two group of node one is path altered group and other is stable path with sensibility. The sensibility path estimates the hop count and packet sequence number. If the number of hop count is not changed or the sequence of packet is also not lost is called sensitivity path of network. The function of threshold generated by the node distance formula based on the Euclidean distance derivation. The enhanced AODV protocol simulate in NS2.34 simulators and measure some standard parameter such as PDR, throughput, overload and E2E delivery ratio.
Highlights
The malicious software attack such as black-hole attack and black-hole attack degraded the performance of mobile adhoc network and theft the information of user
The prevention of black hole attack depends on the process of threshold based function
Threshold is an important part of the proposed technique
Summary
The malicious software attack such as black-hole attack and black-hole attack degraded the performance of mobile adhoc network and theft the information of user. The detection and prevention of black-hole attack is various critical tasks. Various authors used various techniques such as threshold based function and reference based model for the detection of black-hole attack. In this dissertation improved the AODV routing protocol for the secured communication for the prevention of black hole attack. The prevention of black hole attack depends on the process of threshold based function. In the technique a black-hole tunnel present in the network or not, is decided by the threshold. If the value of alternate path is greater than the threshold, the black-hole is detected. After that the algorithm consider the highest number of hop count which is comes from these various alternate paths in the whole network and consider highest hop count + 2 as a threshold.
Sign-in/Register to view highlights & summary 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 callMore From: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
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.
