Enhanced techniques to strengthening DTN against flood attacks

Abstract

The intermittent connectivity between nodes to transfer data is exploited using Disruption tolerant networks (DTNs). DTNs are susceptible to flood attacks which limit the network resources. Various methods were used to defend these attacks based on distributed schemes with certain difficulties to count the packets or duplicates sent by a node. This is due to lack of communication infrastructure. Two limits are used to mitigate packet flood and replica flood attacks, respectively. Violation of both the limits can be easily noticed by claim-carry-and-check. The inconsistency check against full claims is trivial. This is designed to work in a distributed system. Moreover, it allows tolerating a little amount of attackers for collision. Proposed algorithm is learning automata. It uses the feedback mechanism. The feedback from the previous nodes is collected and thereby reduces the limitation for the successor nodes. The goal is to detect the attacker by approximate counting and discard the flooded packets.