Abstrait

Thwarting Flood Attacks in Disruption Tolerant Networks Based On Claim and Key Verification

G.Pushpa Rega, S.Hasan Hussain

Disruption Tolerant Networks (DTNs) make the most of the mobility of nodes and the opportunistic contacts among nodes for data communications. Owing to the restriction in network resources such as contact prospect, buffer space and bandwidth, DTNs are open to flood attacks. To guard against flood attacks in DTNs, Rate limiting based on certificate was proposed. In Rate limiting, every node has a bound over the number of packets that it can generate in each time interval and a bound over the number of replicas that it can generate for each packet. The main objective is to detect the node who send the packets more than their limit and to mark limit exceeding nodes as attackers .Here detection adopted claim-carry-check technique, where every node counts the number of packets or replicas that it has sent and send that count to other nodes, a particular node after receiving the counts from the contacted nodes, just carry that claims when they travel across the network, and cross-check if their carried claims are conflicting when they communicate with other nodes. Using Rate limit certificate only the flood attacker who exceeds the rate limit was identified. To overcome this, the proposed approach uses key. Key will be generated for the node who wish to send packets less than the rate limit. In addition to rate limit certificate, key also be checked at every contact. AES and MAC algorithm will be used for key generation. Based on keys, attackers who sends packet within the rate limit can also be easily identified.