Detection and Suppression of Blackhole Attack in Leach based Sensor Network

Detection and Suppression of Blackhole Attack in Leach based Sensor Network Vipul Sharma Kirti Patil Ashish Tiwari M. Tech. Scholar Asst. Prof. HOD CS Department V.I.T.S. V.I.T.S. V.I.T.S. Indore, India Indore, India Indore, India vipulsharmamit@gmail.com patilkirti52@gmail.com ashishtiwari205@gmail.com Abstract Wireless sensor networks are broadly cast-off in numerous applications like battlefield monitoring, environment monitoring. Nodes in sensor network works cooperatively for a single goal with whose objective is to forward the data packets to the base station. However, it requires different resources of a sensor node such as battery power, storage, and processing power. In order to conserve its own resources a node may not forward the data to the others. Such sort of attack has serious consequences if the attacker node is the cluster head. In the presence of BlackHole attack the base station will not be able to get the data from the persecuted cluster head while resources of the cluster are being consumed. In this paper we recommend a scheme to detect this kind of misconduct in WSN. Our recognition mechanism is energy efficient since most computations parts are assigned to the base station. 1. Introduction A wireless sensor network (WSN) is a selforganizing network consisting of sensor nodes which can vary from hundreds to thousands in numbers [1]. Each sensor node has restricted processing, storage capacity, computational power. Sensor node are deployed to sense various parameters like temperature, pressure, humidity, motion, vibration, and so on. As per the requirement of WSN application, the sense data get convert into appropriate signal, and forwards the signal to a centralize information centre known as base station (BS) or sink through the wireless medium [2]. Again the BS may again send it to another BS or can take the decision based on its own on the basis of acquired data. Such networks are extensively used in numerous applications like battlefield surveillance, environmental monitoring, wildlife monitoring, and so forth [3]. Generally in most of the applications the WSN is deployed in adverse environment in, which makes them more susceptible to several types of security threats. In-order to enhance the life of WSN, security envelopes such as encryption, access control, etc. have been used by the researcher [4]. However, due to restricted capabilities complex security mechanism cannot be applied to prevent misbehaviour of nodes. A compromised node may misbehave in several ways such as not forwarding the data (blackhole attack). The attacker node do it either due to any benefit or to conserve its own resources. Such behaviour of the attacker affect the data transmission to the BS. Another impact of such sort of attack is the wastage of resources of all the member of the cluster which are victimized. They dissipate their energy in sensing as well as in signal processing to the BS, but ultimately their data is unreachable to the destination [5]. In this paper a mechanism is proposed to detect the Blackhole attack. Our aim for this research work is to advance a mechanism that can detect and overcome the effect of blackhole attack in sensor network. We have used the cluster-based routing because as compared to flat routing, cluster-based routing is efficient in terms of load balancing and lifetime of network [6]. We have used LEACH as routing protocol. In leach protocol the cluster head is selected in each round, which are responsible for data aggregation and to forward the aggregated data to the base station. The blackhole attack may cause serious consequences due to the malicious act of an attacker node. So the problem is to identify the attacker node from the set of the sensor nodes. In comparison to the selective forwarding attack, blackhole attack have severe consequences and catastrophic results to sensor network because the data transmitted is raw (sensed data). In our work we have used a topology which is illustrated through figure 1 given below: 1873

Figure1. Illustration of blackhole attack in Leach using depicted topology. In our proposed mechanism we are using topology which is given in above figure which is having four cluster with sensor nodes having yellow colour, Cluster Head (CH) having white colour and blackhole CH having black colour and a BS which is surrounded by four cluster. Our proposal has two main contributions. First we have concentrated on the detection part of blackhole attack. Second, we have proposed a mechanism that detects the node misbehaviour. Our mechanism does not put any extra overhead on sensor nodes as most of the processing is assigned to the base station, which has abundant resources. 2. RELATED WORK Base Packet Drop by Cluster Numerous techniques are mentioned in the literature to enhance the security of sensor network. Some of the techniques given in this survey. Numerous vulnerabilities in sensor network was first described in Karlof et al [7]. They described numerous possible attacks like Sybil attack, HELLO FLOOD, Black Hole, Gray Hole attack in LEACH. Due to the limited energy resources, low computing power and other restriction, complex security mechanism cannot be applied to the sensor network which become a headache for the researcher to create a secure network [11, 10]. Hence malicious node can easily mess up the normal functioning process. In paper [9] suggested the detection and removal of adversaries by midway nodes through routing. 3. CLUSTER BASED ROUTING PROTOCOLS FOR WSN In sensor network all the sensor nodes works for a common goal to forward their data to the base station in order to process that data so that information can be drawn. This could be done using flat routing or clusterbased routing protocol. In flat routing protocols all the nodes have same rudimentary functionality, but in case of cluster-based routing some of the nodes have some special functionality like aggregation or fusion of data collected from several other nodes. Flooding [7], rumor routing [8], and directed diffusion [9] are some of the flat routing protocols used in sensor networks. Compare to other routing protocol, Cluster-based routing protocols are efficient in terms of energy consumption and network survivility as compared to the flat routing protocol [10]. In Cluster based routing protocols a nodes form a cluster and all the nodes have a common task of forwarding the data to their CH only. Afterwards it is the concern of the head to aggregate the data compress it and forward it either to the base station or to another cluster head. LEACH [11], TEEN [12], PEGASIS [13] are examples of cluster-based routing protocols for sensor network. Our research proposal revolve round the LEACH protocol which is a simple and efficient clustered based protocol for sensor network. LEACH Protocol is a typical example of hierarchical routing protocols. It is a self-adaptive and a self-organized cluster based routing protocol. LEACH protocol uses round as unit, in each round there is a cluster set-up stage and a steady-state stage, in order to reduce unnecessary energy costs, therefore the steady state stage must be as much longer than the set-up stage. The process of its functioning is shown in Figure 2. Set-up Clusters form Steady-state Slot for Slot for node I node I Time Frame Fig.2 LEACH Protocol process. At the stage of cluster forming, a node randomly picks a Number between 0 to 1, compare this number to the Threshold values t (n), if the number is less than t (n), then It became cluster head in this round, otherwise it will become Common node. Threshold t (n) of the leach protocol is determined by the Following algorithm given below: 1874

Figure 3. Algorithm for Leach protocol. Here p is the percentage of the cluster head nodes in all the cluster, r is the number of the round, G is the collections of the nodes that have not yet been head nodes in the first 1/P rounds. Using this threshold, all nodes will be able to be head nodes after 1/P rounds. The analysis is as follows: Each node becomes a cluster head with probability p when the round begins, the nodes which have been head nodes in this round will not be head nodes in the next 1/P rounds, because the number of the nodes which is capable of head node will gradually reduce, so, for these remain nodes, the probability of being head nodes must be increased. After 1/P-1 round, all nodes which have not been head nodes will be selected as head nodes with probability 1, when 1/P rounds finished, all nodes will return to the same starting line [14]. When clusters have formed, the nodes start to transmit the inspection data. Cluster heads receives data sent from the other nodes, the received data was sent to the gateway after fused. This is a frame data transmission. In order to reduce unnecessary energy cost, steady stage is composed of multiple frames and the steady stage is much longer than the set-up stage. 4. MECHANISM : FOR PACKET DROP AND COUNTERMEASURE In our proposal we assume that base station is aware about sensor nodes location by using global positioning system or using another device. After deployment phase all the nodes remain static in terms of position. Each nodes have same communication and calculation competences. In case if the battery of any of the node is drained it is considered dead. Our proposal is totally dependent on the information extracted from the packet sent by the node to the base station. In our mechanism we are not considering any packet modification attacks. The base station is the main system which monitor the whole process of communication. So our mechanism does not put any extra communication overhead on the resource constraint sensor nodes of the network. A base station is having high resources as compared to the sensor nodes so in our mechanism most of the computations are done at base station only. In sensor network an attacker may capture an authentic node and may force it to behave badly through some malicious code or may introduce some compromised bad node in the network. Communications are taking in air so an attacker can easily eavesdrop and can bypass basic security mechanisms. In our mechanism we are using leach protocol, so as per the mechanism of the leach protocol the nodes having higher residual energy as compared to other nodes will be selected as the cluster head, the concept here is that a node which act as cluster head consume most of its energy in data sending to the base station and in the cluster-based algorithm, this task is accomplished by cluster heads only. Therefore the residual energy of a CH will always remain higher as compared to other CHs, if the CH is not transmitting the data at all. The criterion to turn into CH is reliant on the residual energy of a node, therefore the node which have higher energy will have a high probability to become a cluster head. On the Basis of the extent of data received by a node and the number of times it becomes cluster head in the past due to high residual energy base station will help to identify the blackhole attack. Proposed mechanism can be better understood by the algorithm described below. 5. ALGORITHM The proposed algorithm is described below: During the deployment of the sensor nodes we consider that the network is not compromised by attacker. As soon as the nodes deploys, following steps are followed. 1. Cluster formation by nodes on the basis of signal strength. 2. Simply the leach protocol initiate. 3. Base station maintain the ids of the CH at each round. 4. If CH repeats: network under Blackhole attack. { Base station sends alert packet to the sensor nodes BS Sensor nodes (alert) } Else { Data transmission across network successfully } 5.Repeat step 2 to 4 after omitting same CH In our proposed mechanism by simply keeping the track of the CH IDs we can easily rectify the Blackhole 1875

node from the sensor network. This mechanism can be easily implemented in real life as the complexity of algorithm is quiet simple. 6. FLOWCHART START Cluster Formation Leach Initiation CH Repeat Data Sent Successfully Figure 4. Flowchart of the proposed mechanism. 7. CONCLUSION In sensor networks security is always a major issue of concern for the researchers. In this paper we have proposed a mechanism to defend blackhole attack in sensor network using leach protocol. In order to save power consumption we have imparted most of the calculation part to the base station. Once the blackhole attack is detected it can be easily suppressed by the proposed mechanism. Future work can be continued by securing the base station from the attackers. 8. REFERENCES No Yes Omit CH from network Stop [1] M. Aslam, N. Javaid, A. Rahim, U. Nazir, A. Bibi, Z. A. Khan, Survey of Extended LEACH-Based Clustering Routing Protocols for Wireless Sensor Networks, in 11 july, 2011, arxiv:1207.2609v1 [cs.ni]. [2] NEETIKA & SIMARPREET KAUR, Rreview on Hierarchical Routing in Wireless Sensor Networks, in International Journal of Smart Sensors and Ad- Hoc Networks (IJSSAN), Vol. 2, Issue 3, 4, 2012, pp. 85-90. [3] Ravneet Kaur, Deepika Sharma and Navdeep Kaur, Comparative Analysis Of Leach And Its Descendant Protocols In Wireless Sensor Network, in International Journal of P2P Network Trends and Technology, Vol. 3, Issue 1, 2013, pp. 51-55. [4] Mian Ahmad Jan, Muhammad Khan, A Survey of Cluster-based Hierarchical Routing Protocols, in IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), Vol.3, April 2013, pp. 138-143. [5] Amit Bhattacharjee, Balagopal Bhallamudi and Zahid Maqbool, Energy-Efficient Hierarchical Cluster Based Routing Algorithm in Wsn: A Survey, in International Journal of Engineering Research & Technology (IJERT), Vol. 2 Issue 5, May, 2013, pp. 302-311. [6] Sandeep Verma, Richa Mehta, Divya Sharma, Kanika Sharma, Wireless Sensor Network and Hierarchical Routing Protocols: A Review, in International Journal of Computer Trends and [7] C. Karlof and D. Wagner, Secure routing in wireless sensor networks: attacks and countermeasures, Special Issue on Sensor Network Applications and Protocols, vol. 1, no. 2-3, pp. 1293 1303, 2003. [8] W. R. Heinzelman, J. Kulik, and H. Balakrishnan, Adaptive protocols for information dissemination in wireless sensor networks, in Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 174 185, Seattle, Wash, USA, 1999. [9] D. Braginsky and D. Estrin, Rumor routing algorithm for sensor networks, in Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA '02), pp. 22 31, Atlanta, Ga, USA, September 2002. View at Scopus [10] C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 56 57, New York, NY, USA, August 2000. View at Scopus [11] C. Qing, T. Abdelzaher, H. Tian, and R. Kravets, Cluster-based forwarding for reliable end-to-end delivery in wireless sensor networks, in Proceedings of the 26th IEEE International Conference on 1876

Computer Communications (INFOCOM '07), pp. 1928 1936, San Diego, Calif, USA, May 2007. View at Publisher View at Google Scholar View at Scopus [12] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in Proceedings of the 33rd Annual Hawaii International Conference on System Siences, pp. 3005 3014, January 2000. View at Scopus [13] A. Manjeshwar and D. P. Agrawal, A protocol for enhanced efficiency in wireless sensor networks, in Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, in Conjunction with 2001 IPDPS, San Francisco, Calif, USA, 2001. [14] S. Pal, D. Bhattacharyya, G. S. Tomar, and T. Kim, Wireless sensor networks and its routing protocols: a comparative study, in Proceedings of the International Conference on Computational Intelligence and Communication Networks (CICN '10), pp. 314 319, November 2010. View at Publisher View at Google Scholar View at Scopus. 1877