Computational Intelligence Aided BlackHole Detection for Secure Data Dissemination Based on PRP Routing in WSN

Security and Energy restriction are of most concern in pushing the success of Wireless Sensor Networks (WSNs) for their wide deployment. Despite years of much intensive research, deploying secure communication between wireless nodes remains the cumbersome setup process. Due to the deprived physical layout of sensor nodes, it is generally assumed that an adversary can capture and compromise a small number of sensors in the network. The key attack identified in such a network is Compromised Node (CN) attack which has the ability to create black hole, thereby intercepting the active information delivery. In this paper, we develop an effective routing mechanism that can with high probability, circumvent the black hole formed by this attack. The Purely Random Propagation (PRP) algorithm developed generates randomized dispersive routes so that the routes taken by the shares of different packets changes over time. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of bypassing black hole. Also, the energy constraint is highly optimized in the entire routing mechanism leading to minimal energy consumption. Extensive simulations are conducted to investigate the security and energy performance of our mechanism. Keywords— CN attack, PRP, Randomized routing, black hole, shares I.INTRODUCTION Our focus is on routing security in wireless sensor networks. Current proposals for routing mechanisms in sensor networks optimize for the limited capabilities of the nodes and the application specific nature of the networks, but do not consider security. Sensor networks are highly susceptible to denial of service attacks due to their inherent characteristics i.e., low computational power, limited memory and communication bandwidth coupled with use of insecure wireless channel. A black hole attack can be easily launched by an adversary node in the sensor network. The malicious node starts advertising very attractive routes to data sink. The neighbor nodes select the malicious node as the next hop for message forwarding considering it a high quality route and propagate this route to other nodes. Almost all traffic is thus attracted to the malicious node that can either drop it, selectively forward it based on some malicious filtering mechanism or change the content of the messages before relaying it. This malicious node has thus formed a sink hole with itself at the center. Of the various possible security threats encountered in a wireless sensor network (WSN), in this paper, we are specifically interested in combating the attack, compromised node (CN). In the CN attack, an adversary physically compromises a subset of nodes to eavesdrop information. This attack generates black hole: area within which the adversary can either passively intercept or actively block information delivery. Due to the unattended nature of WSNs, adversaries can easily produce such black holes [5]. Severe CN attack can disrupt normal data delivery between sensor nodes and the sink, or even partition the topology. One remedial solution to this attack is to exploit the network’s routing functionality. Specifically, if the locations of the black holes are known a priori, then data can be delivered over paths that circumvent (bypass) these holes, whenever possible. In this paper, we propose a randomized multipath routing algorithm that can overcome the above problems. In this algorithm, multiple paths are computed in a randomized way each time an information packet needs to be sent, such that the set of routes taken by secret shares[3] of different packets keep changing over time. As a result, a large number of routes can be potentially generated for each source and destination. To intercept different packets, the adversary has to compromise or jam all possible routes from the source to the destination, which is practically not possible. Because routes are now randomly generated, they may no longer be node-disjoint. However, the algorithm ensures that the randomly generated routes are as dispersive as possible, i.e., the routes are geographically separated as far as possible such that they have high likelihood of not simultaneously passing through a black hole. In addition, for efficiency purposes, we also require that the randomized routing algorithm only incurs a small amount of communication overhead. J.Preetheswari et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3575-3581