Volume 119 No. 16 2018, 1563-1567 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ Secure Data Aggregation Algorithms for Sensor Networks in the Presence of Collision Attacks A.AJIN ROCH (1), G.VINOTH KUMAR (2), G.Revathi (3), N.SUREKA SABARI (4) (1,2,3) Assistant Professor (Sr.G),Department of ECE, SRM Institute Of Science And Technology (4) M.Tech-Embedded System. SRM Institute Of Science And Technology,Ramapuram ajinroch.a@rmp.srmuniv.ac.in (1),gvinothece@gmail.com (2), sureka.nss@gmail.com (3) http://www.acadpubl.eu/hub/ Abstract:Sensor nodes are formed by aggregation of multiple inexpensive and unreliable sensors. These sensor nodes communicate with each other and with the base station (BS) or Sink. A cluster is formed with all the sensor having a cluster head (CH) which in turn route the data to the base station. Wireless sensor networks (WSNs) are vulnerable to large number of problems like security,heterogeneity, energy consumption and other disadvantages of which need to be solved. Traditional security mechanisms which require extensive computation, communication and memory are not suitable for WSNs.The major problem was consumption of high energy and congestion during data aggregation. The main objective of such schemes is to make use energy of nodes effectively using LEACH protocol. Then a node within the network is less preferred if its energy becomes less than a pre-set minimum acceptable energy value. Secure data aggregation is achieved by this algorithm. Keywords Wireless Sensor Network; WSN; algorithm;leach protocol; topology; cluster head. I. INTRODUCTION Technology keeps improving day by day making life more dependent on it.the area of research improves the technology where Wireless Sensor Network (WSN) has its own advancements in research. One of the main parameter which is of concern in wireless sensor networks is the energy life of the sensor connected to form nodes. It is found in some studies that TDMA- based MAC protocol (LEACH) can have low energy consumption by nodes and maintain the energy of cluster thereby improve the sensor network lifetime. Wireless sensor nodes generally comprises of number of sensing nodes where few of these sensing nodes in near-by distance are grouped together with the cluster head. The purpose of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is to distribute the load energy to all the wireless sensors by randomized rotation of the cluster head. LEACH protocol comprises of algorithms at each node which is followed by simulation of the nodes. Various parameters are involved in the process of simulation of these nodes which are as follows: During the initial clusters set-up stage, sensors which represents the nodes generate numbers randomly between 0 and 1 (including 0 and 1). A threshold value is defined and if the random number generated is less than the threshold Value T (n), it tends to act as cluster head in the respective round. The Calculation of Threshold T (n) is based on the below formula: According to the above Formula,N is the total number of nodes; r represents the number of current rounds(periods); p refers to the percentage of cluster nodes considered of all in the network that has the probability of becoming cluster heads; G represents the set of nodes that did not become Cluster head in the 1/p rounds. Recent studies show that the cluster head can be optimized based on entry for data aggregation. This adopts the free space model and the multipath fading model according to the distance between the source and the sink. 1563
The main objective of LEACH algorithm is to not only to optimize the energy of the network it also involves increasing the life time of each sensor node and which in turn increase the lifespan of the wireless sensor network. The generation of cluster heads, the formation of clusters and the communication among clusters. Hence, LEACH algorithm also includes these three steps, just merging the first two steps into one that is the establishment of clusters and the communication among clusters. LEACH algorithm reduces the energy consumption, prolongs the lifetime of the network. In the improved LEACH algorithm, we use the same radio communication energy consumption model as used in LEACH protocol. II. ENERGY ANALYSIS Wireless sensor network comprises of many different types of protocols. The most commonly used protocol for energy consumption are the direct communication (DC) with the base station and multi-hop routing (MH). In DC Protocol all the data are sent to the base station using each sensor present in the network whereas in multi-hop protocols intermediate nodes are used as routers for other nodes. Technically DC form, depends of the distance between the node and the base; therefore, this method will drain quickly the battery and the life time of the node if the distance is far and if the distance is short could be an acceptable method. Hence we propose new energy model consisting of two parts, thereby the total energy consumed is according to the following formula: When selecting cluster heads, LEACH protocol selects cluster heads according to the random number the node generates and the threshold, while the threshold did not take the remaining energy into account, which may result in the node with low energy to be a cluster head, thus bringing premature death to clusters and affecting the lifetime of network. We introduce the remaining energy factor based on LEACH protocol, that is: There into, Ei : Residual energy of each node in I round; Er : average energy of rest nodes in I round; ER : total residual energy of rest nodes in I round; Calculating formula of average energy of rest nodes Er: r i : The current round; r max : Maximum rounds of network simulation; In our network simulation environment, providing that all nodes can communicate with sink node directly. All nodes do not have the feature of mobility. All nodes have the same and limited initial energy in the firstroundsymmetric wireless channel, that is energy consumed from node 1 to node 2 equals the energy consumed from node 2 to node 1. The sink node has a fixed position, and has enough energy to supply, and has some distance from the network.when the energy of node is 0, the node dies We adopt C language to write programs and MATLAB to simulation.there are 100 nodes in the Wireless Sensor Network, deployed in the range 100m x 100m randomly. 1564
III. LEACH LEACH is a self-organizing adaptive clustering protocol. We will stimulate using Mat lab the LEACH behaviour, the parameters used are: a population of 100 Sensor Networks distributed aleatory, Sink sensor will be placed in the next coordinate x=0.5*xm and y=ym+50 where Xm and Ym are the field dimensions, the probability of a node to become a cluster head 0.05, package length Fig 4 Comparative Chart Lifetime, Cluster head round 6400b, initial energy 0.5J/b. Starting with the simulation development of the sensor network in Mat lab, was considered a multi-hop topology. We can see the wireless sensor network in Fig. 3. Wireless sensor network works commonly in Ad-hoc. Note that the relation is directly proportional between these parameters. The dead of the sensors is regular, which mean that the behavior of LEACH with those parameters and with a randomized topology. The number of rounds end in932. Using a circular randomized topology with a 100m (h), the behaviour of LEACH is different. LEACH says that the decision to become a cluster head depends on the amount of energy left at the node, in this way, nodes with more energy remaining will perform energy intensive functions of the network. Using the parametersmentioned before the behaviour of the network is shown at Fig.4. Where we can see the how the sensors die and how many number of cluster head per round exist. The waythe protocol works could force to form circles in the sensordeployment and accelerate in a low grade the round last nodedeath. The number of rounds end in 1400. IV. CONCLUSIONS In this paper, we described LEACH protocol as a viable option in clustering a 1565
sensornetwork in a good distribution of the energy in the mesh, based sensing a high energy node to use it as a cluster head. Considering different parameters as dimensions, package length, different energy parameters, data aggregation. LEACHhave the property that include cluster based, random cluster head selection, cluster membership adaptive, data aggregation, communication directly with the sink, TDMA communicationand threshold value. Thus, the energy of nodes is improved. This protocol did not consider residual energy of nodes when choose cluster heads which lead the premature death of clusters and waste network resource. We introduced energy factor. When selecting cluster heads, we consider the rest energy of nodes, thus avoiding nodes with low energy to be cluster heads. Simulation results show that the improved algorithm is superior to LEACH protocol in terms of network lifetime, stability, the amount of data package and energy utilization. Of course, there are some short comings in the algorithm such as the simulation environment is too ideal, whether the selection of cluster heads is optimized and trusted and so on. Microsensor Networks, in Proc. Hawaii International Conference on System Sciences (HICSS), vol. 8, 2000, p. 8020. [5] W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan. An application-specific protocol architecture for wireless microsensor networks. Wireless Communications, IEEE Transactions on, 1(4):660 670, October 2002. [6]. Vinoth Kumar G, Ashish Kumar Pillai A Modified Long Lasting Pacemaker Using Piezoelectric Nanowires For Treating Cardiac Diseases international journal of pure and applied mathematics, Volme 118 (20), Page no.709-717, ISSN: 0974-2115 [7] L. Eschenauer and V. Gligor A keymanagement scheme for distributed sensor networks, Proceedings of the 9th ACM conference on Computer and Communication Security 2002 pp. 56-65, Washington DC, USA REFERENCES [1] Akkaya, K.; Younis, M. A Survey on routing protocols for wireless sensor networks, Elsevier Ad Hoc Network Journal, 2003,vol. 3, no. 3, pp. 325-349. [2] S. Bandyopadhyay and E.J. Coyle. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proc. of 22 Annual Joint Conference of the IEEE Computer and Communications, INFOCOM 03, 2003. [3]. Vinoth Kumar G, Antony Fernandes, Lalith Radhakrishnan, Akhil Goud,. L. Eshwar Prasad Reddy, Ashwin V Occlusion Analysis using T-Scan Technology Journal of Chemical and Pharmaceutical Sciences, Print ISSN 974, 2115 [4] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, EnergyEfficient Communication Protocol for Wireless 1566
1567
1568