Migrating Packet Dropping in Adhoc Network Based on Modified ACK- based Scheme Using FSA
Satyendra Tiwari, Anurag Kumar Jain, Gajendra Singh Chowhan · 2011
ABSTRACT: Dynamic topology and without infrastrure provide a great facility for adhoc network. Such facility generates easy installation of adhoc network and provides node mobility without loss of connection. In such facility packet dropping is a serious challenge for quality performance of adhoc network. Adhoc network suffered some security attack such attacks are black hole attack, malicious attack and worm hole attack that attack occurred a packet dropping problem in adhoc network. For the minimization of attack and packet droping various authors built various method such method is node authentication, passive feedback scheme, ack-based scheme, reputation based scheme and incentive based scheme, ack-based scheme suffered a problem of huge overhead due to extra Acknowledgment packet and also suffered decision ambiguity if the requested node refuse to send back Acknowledgment. In this paper we modified ack-based scheme for decision ambiguity for requested node on the basis of finite state machine. Finite state machine is a automata of theory of computation here we used deterministic finite automate for the decision making of node and improved node authentication and minimize packet dropping in adhoc network.