You are on page 1of 5

e-ISSN (O): 2348-4470

Scientific Journal of Impact Factor (SJIF): 4.72

p-ISSN (P): 2348-6406

International Journal of Advance Engineering and Research

Volume 4, Issue 2, February -2017

Secure Data Aggregation Technique for Wireless Sensor Networks in the

Presence of Collusion Attacks
Priyadarshini Patil, 2Jui Harmalkar, 3Sonali Kumari, 4Amol Patil
Department Computer Engineering D.Y.Patil College of Engineering

Abstract--- Due to restricted procedure power and energy resources, aggregation of knowledge from multiple detector
nodes done at the aggregating node is typically accomplished by straightforward ways like averaging. But such
aggregation is understood to be extremely susceptible to node compromising attacks. Since WSN are typically
unattended and while not tamper resistant hardware, they're extremely liable to such attacks. Thus, ascertaining trait of
knowledge and name of detector nodes is crucial for WSN. Because the performance of terribly low power processors
dramatically improves, future individual nodes are capable of activity a lot of subtle information aggregation algorithms,
so creating WSN less vulnerable. Unvaried filtering algorithms hold nice promise for such a purpose. Such algorithms at
the same time mixture information from multiple sources and supply trust assessment of those sources, typically during a
style of corresponding weight factors allotted to information provided by every supply. During this paper we have a
tendency to demonstrate that many existing unvaried filtering algorithms, whereas considerably a lot of strong against
collusion attacks than the easy averaging ways, are notwithstanding susceptive to a unique subtle collusion attack we
have a tendency to introduce. to deal with this security issue, we have a tendency to propose an improvement for
unvaried filtering techniques by providing AN initial approximation for such algorithms that makes them not solely
collusion strong, however conjointly a lot of correct and quicker convergence.

Keywords--- Wireless Sensor Networks, Robust Data Aggregation, Collusion Attacks.


Due to a wish for strength of observation and occasional worth of the nodes, wireless detector networks (WSNs) square
measure usually redundant. info from over one detector is aggregative at AN somebody node that then forwards to all-
time low station solely the mixture values. At present, due to obstacles of the computing strength and electricity helpful
resource of detector nodes, knowledge is aggregative by victimization very simple algorithms which has averaging. But,
such aggregation is assumed to be terribly prone to faults, and bigger significantly, malicious attacks [1]. This cannot be
remedied by suggests that of science methods, as a result of the attackers sometimes gain whole get admission to
statistics hold on at intervals the compromised nodes. For those reason facts aggregation at the somebody node should be
discovered by suggests that of an assessment of trustiness of data from individual detector nodes. For this reason, better,
additional progressive algorithms square measure required for statistics aggregation at intervals the destiny WSN. Such a
collection of rules got to have 2 options. Think about and name systems have an outsized role in supporting operation of
a large type of distributed structures, from Wi-Fi detector networks and e-commerce infrastructure to social networks,
with the help of presenting AN assessment of trustiness of people in such disbursed systems. A trustiness analysis at any
given second represents a mix of the conduct of the members the maximum amount as that moment and should be sturdy
at intervals the presence of various styles of faults and malicious behavior. There square measure variety of incentives for
attackers to govern the believe and recognition several participants during a disbursed system, and such manipulation will
seriously impair the performance of this type of machine [3]. The most goals of malicious attackers is aggregation
algorithms of settle for as true with and name structures [4].


Iterative Filtering (IF) algorithms are a pretty possibility for WSNs as a result of they solve each problemsdata
aggregation and knowledge trustiness assessmentusing one unvarying procedure. Such trustiness estimate of every
detector relies on the gap of the readings of such a detector from the estimate of the proper values, obtained within the
previous spherical of iteration by some sort of aggregation of the readings of all sensors. Such aggregation is sometimes a
weighted average; sensors whose readings considerably take issue from such estimate are appointed less trustiness and
consequently within the aggregation method within the gift spherical of iteration their readings are given a lower weight.

Its notably dangerous once launched against WSNs for 2 reasons. First, trust and name systems play crucial
role in WSNs as a way of breakdown variety of vital issues, like secure routing, fault tolerance, false knowledge
detection, compromised node detection, secure knowledge aggregation, cluster head election, outlier detection Second,
sensors that are deployed in hostile and unattended environments are extremely vulnerable to node compromising attack.

@IJAERD-2017, All rights Reserved 305

International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

Whereas giving higher protection than the easy averaging, our simulation results demonstrate that so current IF
algorithms are prone to such new attack strategy.

2.1. Fast Aggregation Scheduling in Wireless Sensor Networks

Authors: Hamed Yousefi, Marzieh Malekimajd, Majid Ashouri, and Ali Movaghar
Data aggregation could be a key, nevertheless long practicality introduced to conserve energy in wireless device
networks (WSNs). during this paper, to attenuate time latency, we tend to specialize in aggregation programing downside
Associate in nursing propose an economical distributed formula that generates a collision-free schedule with the smallest
amount variety of your time slots. In distinction to others, our approach named quick primarily contributes to each tree
construction, wherever the previous studies use connected 2-hop Dominating Sets, and aggregation programing that was
antecedently addressed through the challenger Sets computation. we tend to prove that the latency of quick below the
protocol interference model is upper-bounded by 12R+ a pair of, wherever R is that the network radius and is that
the most node degree within the communication graph of the first network. Each the theoretical analysis and simulation
results show that quick outperforms the progressive aggregation programing algorithms.

2.2 Paper Name: A Novel Wireless Sensor Network Frame for Urban Transportation
Authors: Xiaoya Hu, Liuqing Yang, and Wei Xiong
The fast progress within the analysis and development of physics, sensing, signal process, and communication networks
has considerably advanced the state of applications of intelligent transportation systems (ITSs). However, economical
and inexpensive strategies for gathering data in large-scale roads square measure lacking. Consequently, wireless
detector network (WSN) technologies that square measure low price, low power, and self-configuring square measure a
key operate in ITS. The potential application situations and style needs of WSN for urban transportation (WSN-UT)
square measure projected during this work. A custom constellation is meant to satisfy the special needs, and WSN-UT is
specifically tailored for UT applications. WSN-UT allows users to get traffic and road data directly from the native WSN
at intervals its wireless scope rather than the remote ITS knowledge center. WSN-UT may be designed in step with
completely different situation needs. A three-level system and a configuration and repair system represent the WSN-UT
network frame, and therefore the service/interface and protocol algorithms for each system level square measure
designed for WSN-UT.

2.3 Paper Name: Data Aggregation and Principal Component Analysis in WSNs
Authors: Antoni Morell, Alejandro Correa, Marc Barcel, and Jos Lpez Vicario
Data aggregation plays a very important role in wireless sensing element networks (WSNs) as way because it reduces
power consumption and boosts the measurability of the network, particularly in topologies that area unit liable to
bottlenecks (e.g. cluster-trees). Existing works within the literature use cluster approaches, principal part analysis (PCA)
and/or compressed sensing (CS) ways. Our contribution is aligned with PCA and explores whether or not a projection
basis that's not the eigenvectors basis is also valid to sustain a normalized mean square error (NMSE) threshold in signal
reconstruction and cut back the energy consumption. We have a tendency to derivate 1st the NSME achieved with the
new basis and elaborate then on the Karl Gustav Jacob Jacobi eigenvalue decomposition concepts to propose a brand new
subspace-based knowledge aggregation methodology. The projected answer reduces transmissions among the sink and
one or a lot of knowledge aggregation nodes (DANs) within the network. In our simulations, we have a tendency to think
about while not loss of generality one cluster network and results show that the new technique succeeds in satisfying the
NMSE demand and gets advance terms of energy consumption to the simplest potential answer using mathematical space
representations. To boot, the projected methodology alleviates the procedure load with relevance an eigenvector-based
strategy (by an element of six in our simulations).

2.4 Paper Name: Secure Cluster based Data Aggregation in Wireless Sensor Networks
Authors: S. Siva Ranjani, Dr. S. Radhakrishna, Dr. C.Thangaraj
Data aggregation is that the best technique for energy conservation in Wireless detector Networks (WSN). as a result of
the open preparation, sensors are vulnerable for security threats. During this paper we tend to address the information
aggregation and security problems along. In our approach, we tend to modify our Energy economical Cluster primarily
based knowledge Aggregation (ECBDA) theme to produce secure knowledge transmission. Since, sensors nodes are low
powered in nature; it's not viable to use normal cryptography strategies. Cluster head performs knowledge aggregation
and Bayesian fusion algorithmic program to change security. Trust is that the directional relationship between 2 detector
nodes. By checking the trait of a node, we will change secure communication. Bayesian fusion algorithmic program
calculates the trust likelihood of a detector supported the behavior of the node. The simulation results show that our
approach effectively detects the unreliable nodes with minimum energy consumption.

@IJAERD-2017, All rights Reserved 306

International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

2.5 Paper Name: Secure Data Aggregation in Wireless Sensor Networks

Authors: V. Vaidehi, R. Kayalvizhi, N. Chandra Sekar
Data aggregation could be a wide used technique in wireless sensing element networks to scale back the ability
consumed in WSN. in a very bid to scale back the ability consumption throughout information gathering, cluster heads
square measure no appointive to assemble information from each node within the WSN. There square measure numerous
challenges that square measure concerned within the method of knowledge aggregation like checking of duplication of
knowledge when encoding, overhead as a result of encoding etc. the protection problems, information confidentiality and
integrity in information aggregation become very important once the sensing element network is deployed in a very
hostile setting (eg, battle field). This paper proposes a completely unique theme to secure the method of knowledge
aggregation by providing a light-weight security theme referred to as Combinatorial Key Distribution (CKD) mechanism
that consumes less power and its performance is improved victimization hashes of knowledge that's sent across the
network. The projected theme minimizes the ability usage and maximizes the secureness of knowledge within the
wireless sensing element network. The projected security theme is compared with alternative existing security solutions
and therefore the results square measure rumored.


Proposes a solution associate for such vulnerability by providing an initial trust estimate that is predicated on a strong
estimation of errors of individual sensors. Once the character of errors is random, such errors basically represent
associate approximation of the error parameters of device nodes in WSN like bias and variance. However, such estimates
additionally convince be sturdy in cases once the error isn't random however as a result of coordinated malicious
activities. Such initial estimation makes IF algorithms sturdy against represented refined collusion attack, and, we
believe, additionally a lot of sturdy below considerably a lot of general circumstances; as an example, it's additionally
effective within the presence of an entire failure of a number of the device nodes.

3.1 Advantages of Proposed System:

1. Proposes a solution for such vulnerability by providing an initial trust estimate that is predicated on a strong estimation
of errors of individual sensors.
2. It is additionally effective within the presence of an entire failure of a number of the device nodes.


Figure 1. System Architecture

@IJAERD-2017, All rights Reserved 307

International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

Figure 2. Block Diagram


Let S be the whole system

A. Input
S= {I,FileP,A,O}

I=Input to the system

P=Processing on the input
O=Output of the system

Node= {nn,ch,an}
nn= normal node
ch= cluster head
an= attacker node

1. Here, nn registers and login in system.

2. nn send all data/file to cluster head.

File= {file1, file2,, file}

3. Attacker node change the file or data

A= {A1, A2,............., An}

4. Here cluster heads work get collects all data and performs aggregation. Here ch applies bloom filtering, to
verify and detect compromised node. Once it detects compromised node, ch blocks the node, and forward all data from
uncompromised node for further processing.

5. Another attack is collusion attack, ch further check that if there exist any colluding attack (two file contain same data),
if then ch ignores the similar data.

Correct data forwarded for further processing.


We introduced a unique collusion attack state of affairs against variety of existing IF algorithms. Moreover, we have a
tendency to planned an improvement for the IF algorithms by providing AN initial approximation of the trait of detector
nodes that makes the algorithms not solely collusion sturdy, however additionally additional correct and quicker

@IJAERD-2017, All rights Reserved 308

International Journal of Advance Engineering and Research Development (IJAERD)
Volume 4, Issue 2, February -2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406


[1] Yousefi, Hamed, et al. "Fast aggregation scheduling in wireless sensor networks." IEEE transactions on wireless
communications 14.6 (2015): 3402-3414.

[2] Hu, Xiaoya, Liuqing Yang, and Wei Xiong. "A novel wireless sensor network frame for urban transportation." IEEE
Internet of Things Journal 2.6 (2015): 586-595.

[3] Morell, Antoni, et al. "Data Aggregation and Principal Component Analysis in WSNs." IEEE Transactions on
Wireless Communications 15.6 (2016): 3908-3919.

[4] Ranjani, S. Siva, S. Radhakrishnan, and C. Thangaraj. "Secure cluster based data aggregation in wireless sensor
networks." Science Engineering and Management Research (ICSEMR), 2014 International Conference on. IEEE,

[5] Vaidehi, V., R. Kayalvizhi, and N. Chandra Sekar. "Secure data aggregation in wireless sensor networks." Computing
for Sustainable Global Development (INDIACom), 2015 2nd International Conference on. IEEE, 2015.

[6] D. Wagner, Resilient aggregation in sensor networks, in Proc. 2nd ACM Workshop Security Ad Hoc Sens. Netw.,
2004, pp. 7887.

[7] Y. Yang, X. Wang, S. Zhu, and G. Cao, SDAP: a secure hopby-hop data aggregation protocol for sensor networks,
in MobiHoc, 2006, pp. 356367.

[8] E. Ayday, H. Lee, and F. Fekri, An iterative algorithm for trust and reputation management, in Proceedings of the
2009 IEEE international conference on Symposium on Information, 2009.

[9] Mohsen Rezvani, Aleksandar Ignjatovic, Elisa Bertino, and Sanjay Jha, Secure Data Aggregation Technique for
Wireless Sensor Networks in the Presence of Collusion Attacks , IEEE Transactions on Dependa-ble and Secure
Computing (TDSC) ,2014

@IJAERD-2017, All rights Reserved 309