Digital Repository

Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation

Show simple item record

dc.contributor.author Weerasinghe, K.G.H.D. en_US
dc.contributor.author Fu, H. en_US
dc.date.accessioned 2014-11-19T04:50:49Z
dc.date.available 2014-11-19T04:50:49Z
dc.date.issued 2008
dc.identifier.uri http://repository.kln.ac.lk/handle/123456789/4224
dc.description.abstract A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route requests without having active route to specified destination and drops all the receiving packets. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. In [9], we proposed a solution to identifying and preventing the cooperative black hole attack. Our solution discovers the secure route between source and destination by identifying and isolating cooperative black hole nodes. In this paper, via simulation, we evaluate the proposed solution and compare it with other existing solutions in terms of throughput, packet loss percentage, average end-toend delay and route request overhead. The experiments show that (1) the AODV greatly suffers from cooperative black holes in terms of throughput and packet losses, and (2) our solution proposed in [9] presents good performance in terms of better throughput rate and minimum packet loss percentage over other solutions, and (3) our solution proposed in [9] can accurately prevent the cooperative black hole attacks. en_US
dc.publisher International Journal of Software Engineering and Its Applications en_US
dc.title Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation
dc.type article en_US
dc.identifier.department Information Technology en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account