Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Robust Routing in Wireless Ad Hoc Networks
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Black hole attack in mobile Ad Hoc networks
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
The handbook of ad hoc wireless networks
The handbook of ad hoc wireless networks
Cryptography and Network Security (4th Edition)
Cryptography and Network Security (4th Edition)
Routing security in wireless ad hoc networks
IEEE Communications Magazine
Hi-index | 0.00 |
Mobile ad hoc networks are vulnerable to various security attacks due to the fact that a mobile node not only has a freedom of joining or leaving the network but also acts as a router. In this paper, we propose a bullet-proof verification (BPV) method to detect the black hole attack, either single or cooperative, in mobile ad hoc networks. The BPV method consists of two steps: every node first examines suspicious nodes using local neighborhood information and secondly, if a node receives RREP from a suspicious node, it sends an encrypted (bullet-proof) test message to the destination to confirm whether the suspicious node is black hole or not. The two-step approach not only pins down the black hole nodes, but also contributes to reducing control overhead. We prove by resorting to simulation that the BPV can be applied to the AODV without degrading performance notably and also is highly dependable against the black hole attack.