Абстрактный

Cache Consistency and IDS for Handling Attacks in Routing Ad-hoc networks

P.Preethi Monolin, Dr.J. Amutharaj

Ad-hoc networks are composed of autonomous nodes that are self-managed without any infrastructure. Due to their dynamic topology, wireless Ad-hoc networks are vulnerable to Denial of Service (DoS) attacks—an instance of a resource depletion attack, with battery power as the resource of interestw. This type of attack is termed as “Vampire” attacks. Such attacks are encountered in two phases: Topology Discovery and Packet forwarding phase where a cache consistency scheme is proposed. In the topology discovery phase, nodes are discovered by the neighbors by building a tree of Neighbor relationship and Grouping membership used for addressing and routing. The PLGP (Parno, Luk, Gaustad, and Perrig) routing protocol which is responsible to perform the no-backtracking property is enhanced with the Ad-hoc routing protocols such as DSR (Dynamic Source Routing) and AODV (Ad-hoc On- demand Distance Vector) such that it ensures malicious node prevention during the packet forwarding phase. The topology is discovered along with the attack description by means of Intrusion Detection Scheme such that attacker has minimum possibilities to get involved in the succeeding packet forwarding phase. However, the PLGP with attestation of a history table is enhanced with Ad-hoc routing protocols depending upon the attack identified in the previous phase. Finally, a performance evaluation statistics is compared with the existing results.