Comparative analysis of attack detection methods in Delay Tolerant Network

Delay Tolerant Network is a new kind of wireless network which includes Radio Frequency (RF) and acoustic (sonar) technologies. DTN developed for an interplanetary network where the speed of light is slow. DTN is derived from deep space communication. DTN is distinguished as long delay and intermittent connectivity. The Delay Tolerant Network is more vulnerable to different kinds of attacks like flooding attack, blackhole and greyhole attacks, due to limited connectivity. There is no end-to-end connectivity between source & destination in DTN. So that it uses a store, carry and forward mechanism to transfer the data from one node to another node. The Delay Tolerant Network was developed to solve technical problems in the end-to-end network. DTN is becoming more and more important because communication networks are ubiquitous today. It provides automotive communication solutions. DTN is a decentralized and self-managed system with unique network attributes; however, attributes such as high mobility nodes, network uplinks and downlinks, and separate routing can cause network vulnerabilities. These vulnerabilities include the host being compromised, which in turn will bring security risks, because the compromised host may destroy the routing protocol in the network. This article analyses the various types of attack detection methods

Comparative analysis of attack detection methods in Delay Tolerant Network

Delay Tolerant Network is a new kind of wireless network which includes Radio Frequency (RF) and acoustic (sonar) technologies. DTN developed for an interplanetary network where the speed of light is slow. DTN is derived from deep space communication. DTN is distinguished as long delay and intermittent connectivity. The Delay Tolerant Network is more vulnerable to different kinds of attacks like flooding attack, blackhole and greyhole attacks, due to limited connectivity. There is no end-to-end connectivity between source & destination in DTN. So that it uses a store, carry and forward mechanism to transfer the data from one node to another node. The Delay Tolerant Network was developed to solve technical problems in the end-to-end network. DTN is becoming more and more important because communication networks are ubiquitous today. It provides automotive communication solutions. DTN is a decentralized and self-managed system with unique network attributes; however, attributes such as high mobility nodes, network uplinks and downlinks, and separate routing can cause network vulnerabilities. These vulnerabilities include the host being compromised, which in turn will bring security risks, because the compromised host may destroy the routing protocol in the network. This article analyses the various types of attack detection methods

A Taxonomy on Misbehaving Nodes in Delay Tolerant Networks

Delay Tolerant Networks (DTNs) are type of Intermittently Connected Networks (ICNs) featured by long delay, intermittent connectivity, asymmetric data rates and high error rates. DTNs have been primarily developed for InterPlanetary Networks (IPNs), however, have shown promising potential in challenged networks i.e. DakNet, ZebraNet, KioskNet and WiderNet. Due to unique nature of intermittent connectivity and long delay, DTNs face challenges in routing, key management, privacy, fragmentation and misbehaving nodes. Here, misbehaving nodes i.e. malicious and selfish nodes launch various attacks including flood, packet drop and fake packets attack, inevitably overuse scarce resources (e.g., buffer and bandwidth) in DTNs. The focus of this survey is on a review of misbehaving node attacks, and detection algorithms. We firstly classify various of attacks depending on the type of misbehaving nodes. Then, detection algorithms for these misbehaving nodes are categorized depending on preventive and detective based features. The panoramic view on misbehaving nodes and detection algorithms are further analyzed, evaluated mathematically through a number of performance metrics. Future directions guiding this topic are also presented

A Survey on Wireless Sensor Network Security

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.Comment: 24 pages, 4 figures, 2 table

A routing defense mechanism using evolutionary game theory for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) often suffer from intermittent disruption due to factors such as mobility and energy. Though lots of routing algorithms in DTNs have been proposed in the last few years, the routing security problems have not attracted enough attention. DTNs are still facing the threats from different kinds of routing attacks. In this paper, a general purpose defense mechanism is proposed against various routing attacks on DTNs. The defense mechanism is based on the routing path information acquired from the forwarded messages and the acknowledgment (ACK), and it is suitable for different routing schemes. Evolutionary game theory is applied with the defense mechanism to analyze and facilitate the strategy changes of the nodes in the networks. Simulation results show that the proposed evolutionary game theory based defense scheme can achieve high average delivery ratio, low network overhead and low average transmission delay in various routing attack scenarios. By introducing the game theory, the networks can avoid being attacked and provide normal transmission service. The networks can reach evolutionary strategy stable (ESS) under special conditions after evolution. The initial parameters will affect the convergence speed and the final ESS, but the initial ratio of the nodes choosing different strategies can only affect the game process

Blindspot: Indistinguishable Anonymous Communications

Communication anonymity is a key requirement for individuals under targeted surveillance. Practical anonymous communications also require indistinguishability - an adversary should be unable to distinguish between anonymised and non-anonymised traffic for a given user. We propose Blindspot, a design for high-latency anonymous communications that offers indistinguishability and unobservability under a (qualified) global active adversary. Blindspot creates anonymous routes between sender-receiver pairs by subliminally encoding messages within the pre-existing communication behaviour of users within a social network. Specifically, the organic image sharing behaviour of users. Thus channel bandwidth depends on the intensity of image sharing behaviour of users along a route. A major challenge we successfully overcome is that routing must be accomplished in the face of significant restrictions - channel bandwidth is stochastic. We show that conventional social network routing strategies do not work. To solve this problem, we propose a novel routing algorithm. We evaluate Blindspot using a real-world dataset. We find that it delivers reasonable results for applications requiring low-volume unobservable communication.Comment: 13 Page