抽象的な

Handling Flood Attacks in Disruption Tolerant Networks Based On Claim Verification

G. Pushpa Rega

Disruption Tolerant Networks (DTNs) utilize the mobility of nodes and the opportunistic contacts among nodes for data communications. Due to the limitation in network resources such as contact opportunity and buffer space, DTNs are vulnerable to flood attacks. Rate limiting was proposed to defend against flood attacks in DTNs, such that each node has a limit over the number of packets that it can generate in each time interval and a limit over the number of replicas that it can generate for each packet. Here detection adopted claim-carry-and check: each node itself counts the number of packets or replicas that it has sent and claims the count to other nodes; the receiving nodes carry the claims when they move and cross-check if their carried claims are inconsistent when they contact. Using Rate limit certificate only the flood attacker who exceeds the rate limit was identified. To overcome this proposed approach uses key. Key will be generated for the node who wishes to send packets less than the rate limit. The key Generation based on AES algorithm. Based on keys, attackers who sends packet within the rate limit can also be easily identified.