FRID: Flood Attack Mitigation Using Resources Efficient Intrusion Detection Techniques in Delay Tolerant Networks

Abstract

Delay tolerant networks (DTNs) are a special type of intermittently connected networks (ICN) featured by variable delay, frequent disruption, asymmetric data rates, and high-error rates. The DTNs have been primarily developed for interplanetary networks (IPNs), however, it shows applicability to challenged networks. Thus, solutions devised for security and routing for traditional networks do not apply to DTNs due to its unique nature. Moreover, this paper shows less attention particularly in security and its related strings. In DTNs, malicious nodes launch various attacks that include packet drop, a fake packet, and flood attack. These attacks inevitably overuse scarce resources (bandwidth, buffer, and energy) in DTNs, which leads to low packet delivery ratio and high packet loss ratio. Flood attack is listed in top among the challenging attacks in DTNs. The existing techniques to confront flood attack suffered from high-detection time and low-detection accuracy. This paper proposed novel resources efficient (distributed and intrusion detection system-based) algorithms to mitigate flood attack. The simulation results show considerable improvement in detection time, detection accuracy, and resource consumption, and also show enhanced packet delivery ratio and reduced packet loss ratio. INDEX TERMS Delay tolerant networks (DTNs), flood attack, misbehaving nodes, packet delivery ratio, packet loss ratio and resources consumption.

FAPMIC: Fake Packet and Selective Packet Drops Attacks Mitigation by Merkle Hash Tree in Intermittently Connected Networks

“…Consider an attack scenario in which malicious nodes overloaded the buffer of the TA by flooding attacks [8], [9]. In this case, the TA will not detect attacks because our proposed algorithm FAPMIC detects attacks when the TA collects encounter history from all nodes (TA buffer is full, which cannot collects encounter history information (Single point of failure, all centralized based algorithms have this issue) this attack is quite possible (in the future we will propose an algorithm which handles this issue).…”

“…Due to the specific characteristics of DTNs mentioned earlier in this article, DTNs face huge number of challenges [9]. These challenges includes, scarce-network-resources [8], bundle-routing [9], privacy [10], bundle-reliability [11], key management [12], packet-synchronization [9], bundlesecurity [9], and misbehaving-nodes [8], [9] particularly. Even though bundle-forwarding protocols in DTNs have been investigated adequately [13].…”

“…That is why researchers put forward a special protocol known as bundle Protocol (BP) for DTNs. BP is used to routes/forwards a bundle in the network [8]. Moreover, BP countermeasures the challenging issues such as long/variable-delay, frequent-disruption, reliability, and communication among heterogeneous networks, by using permanent memory, custodian transfer, and convergence layer.…”

“…However, in DTNs, nodes are vulnerable to large numbers of catastrophic security attacks. This includes, BlackHole/GrayHole [9], WormHole [14], DistributedDe-nialOfService [8], [9], [15], and malicious/selfish nodes attacks.…”

“…Malicious/Selfish nodes are one of the key challenging security issue in DTNs [16], [17]. Malicious/Selfish nodes introduce variously attacks such as Packet-Flooding [8], [9], [18], [19], Packet-Drooping (there are various categories of Packet-Dropping attacks. Such as, some misbehavior nodes drop all packets, or few misbehavior nodes drop selective packets, not all ) [9], [20], and Fake-Packet attacks (FPA) [21]- [25] to overuse limited resources of networks.…”