An efficient algorithm for Neighbor Discovery and wormhole attack detection in WANET

Neighbor discovery is a basic and imperative step for the initialization of a wireless ad hoc network. In Neighbor Discovery process each and every node has to find out the best neighbor which will forward the packet efficiently. An efficient algorithm allows nodes to begin execution at different time instants and discover neighbors without making any collisions while transmitting the packet. In this paper, we propose a new idea for neighbor discovery process by introducing prehandshaking strategy. A prehandshaking strategy will analyze the activities of neighboring node and help to reduce collision during data transmission and help to reach each packet to the correct receiver without dropping. The wormhole attack is one of the most severe attacks in WANET which can significantly disrupt the communications across the network. Moreover, it is a type of replay attack and launched by one or more malicious node. The challenges of this attack is hard to defend against and easy to implement. This paper presents a novel approach for neighbor discovery and mitigating the effect of wormhole attack. The proposed system does not require any special hardware or expensive mechanisms added to the wireless nodes.