Secure Data Aggregation in WSN using Iterative

Filtering algorithm
Ekta Choudhari Ketan D. Bodhe Snehal M. Mundada
Dept. Of Computer Enginerring Dept. Of Computer Technology Dept. of Computer Engineering
DYPCOE Akurdi, PIET DYPCOE Akurdi,
Pune India Nagpur, India Pune, India
ektachoudhari5@gmail.com ketanbodhe@gmail.com Snehalmundada89@gmail.com

Abstract— In WSN Aggregation is considered as the most

susceptible to node compromising attacks, as wireless sensor
networks are not more secured so they are more vulnerable to
this type of attacks. For WSN it is essential to check the
trustworthiness of the data & reputation of sensor nodes. To
handle this issue Iterative Filtering acts as a best option. In
Iterative filtering algorithm (IF) the data is aggregated
concurrently from multiple sources & IF also render trust
assessment of these sources. The trust assessment is in the form of
similar weight factors assigned to data supplied by each source.
Considering the security as major issue in WSN, In this paper we
proposed an advancement for IF method by providing
approximation which will make them collusion robust and is
converging fast. Advancement in the Iterative Filtering algorithm
will enhance the performance of the system with good potential
for implementation in WSN, IF algorithm is stretched with Fig. 1: A data aggregation process in theWSN[1].
novel method for collusion detection & revocation based on an
initial approximation of the aggregate values as well as In these years, various IF algorithms have been proposed for
distribution of differences of each sensor readings. The proposed trust & reputation systems those algorithms demonstrate richer
system performance is checked through extensive simulation in robustness equated to the simple averaging methods; however,
C#. The simulation demonstrates the improved results. The RMS those algorithms have not been designed by conceiving more
value in the graphs for series 2(0.1, 0.18, 0.22, 0.22, 0.22, 0.3, 0.36, sophisticated collusion attack scenarios. Attacker can launch
0.38) with standard deviation ranging from 0.5 to 4 shows that more savvy attacks on the WSNs if they have the idea about
the proposed system performance is better as compare to existing
system.
the aggregation algorithm and its parameters. They can launch
the attack on WSN by exploiting false data injection through a
number of compromised nodes.
Keywords— Iterative Filtering, Data aggregation, Wireless sensor
network, Collusion attack . In Wireless Sensor Networks (WSNs) Trust & reputation
I. INTRODUCTION have been proposed as an efficient security mechanism.
Assessing trustworthiness of reported data from distributed
Currently, wireless sensor networks (WSNs) have been used sensors is a challenging task as sensor networks are being
in many applications, like military target tracking & more and more deployed in many application domains.
surveillance, wildlife monitoring & natural disaster relief.In a Iterative Filtering (IF) algorithms is the best alternative for
normal wireless sensor network, the sensor nodes have WSN as they render answers for data aggregation & data
determined resources such as battery power, computing trustworthiness assessment & using single iterative procedure.
capability, and memory. Communication is a rife source of This differs importantly from such estimate are assigned less
energy ingestion in the WSNs. Hence, the general method is to trustworthiness & accordingly in the aggregation procedure in
collectively process the sensor data, yielded by the various the current iteration their values are given a lower weight.
sensor nodes while carrying it to the base station. This
procedure is known as a data aggregation process. By suing, In this paper we proposed a novel advanced collusion
adding, & filtering the sensor data, the data aggregation attack scenario against a number of existing IF algorithms
process cuts a number of data transmissions & mends the based on false data injection. Due to the initial estimation of
bandwidth energy utilization in the WSNs. the IF algorithms is robust against such a sophisticated
WSN are usually redundant as need for robustness of collusion attack. We believe, more robust under significantly
monitoring & low cost of nodes. Multiple sensor sends the more general circumstances. This contrast to the conventional
data which is aggregated at an aggregator node & which then non iterative statistical sample estimation technique which is
is forwarded to the base station only the aggregate values.
not robust against false data injection by a number of
compromised nodes & severely skewed in presence of
complete sensor failure. IF algorithm with a novel approach
for collusion detection & sensor node revocation is added.
The remainder of this paper is organized as follows. We
provide an deep literature survey on the existing methods of IF
for data aggregation in Section II. Section III describes the
architecture of the proposed system and working of the
proposed system with the implementation details is explain in
Section IV and Conclusion is then given in Section V.
II. RELATED WORK
Aggregating data is a concern in WSNs and there are a
number of papers investigating data injection by taking with
the help of adversary models. There are three parts of work:
Filtering algorithms, trust and reputation systems for WSNs,
and securing data aggregation in WSNs. Increasing amount of
work has been done on iterative filtering technique and
reputation based systems.
The Basic idea of the algorithm proposed in [2] is to calculate
correlation coefficients between users and objects, which
gives credence to users whose ratings correlate properly with
the estimated ratings of objects. An Filtering algorithm based
on a weighted averaging technique which the weights are
computed by examining its distance of value generated from
the actual or expected value is proposed in[3]. Authors in [4]
proposed six algorithms, which are all iterative and are of
same kind. Only the aggregation function is changed. A
different algorithm iterative in nature is shown in [5]. In which
1) the importance or significance of ratings decreased with
time and 2) all the bad raters are saved in a black list. Authors
in [6] proposed an iterative algorithm which is not only using
the rating matrix, also uses the social network of users.
The main objective of author in [6] is to bring in a “Bias-
smoothed tensor model", which is instead a too complexity
Bayesian model. A trust framework for nodes in networks in
which each node develops a trust estimation for neighbor
nodes which make a reputed community for nodes in that
network is shown in [8]. Author in [9] proposed PRESTO, a
model based architecture for Hierarchical nodes. PRESTO is a
two tier framework for managing nodes in sensor networks.
Authors in [10] proposed an relationship in nodes and data for
assessing their reputation scores based on a framework.
Systematic methodology for assessing the trustiness of
knowledge things. Their approach uses the information
beginning further as their values in computing trust scores,
that is, quantitative measures of trustiness. to get trust scores,
they need propose a cyclic framework that well reflects the
inter-dependency property: the trust score of the information
affects the trust score of the network nodes that created and
manipulated the information, and vice-versa
The main contribution of authors in [11] is to propose a
system which collectively combines trust mechanism,
aggregation of data, and tolerance of faults to increase
trustworthiness of data in Wireless Multimedia Sensor
Networks (WMSNs). Author [12] proposed a framework to
discover attacked or faulty nodes in WSN. They stated that the
revocation of discovered nodes cannot be done due to danger
of false positive in the proposed scheme.
The main idea of detecting faulty aggregator in the scheme
proposed in [13] is to use multiple monitoring nodes which are
used for aggregation and providing a MAC value of their
results as a part of MAC in the value calculated by the cluster
aggregator. Authors in [14] proposed a game-theoretical
strategy to sensor guard nodes and to assure a high level of
trustworthiness for the data sensed . Author designed a game-
theoretic defense strategy to defend detector nodes from
attacks & to confirm a high level of trait for detected
information. we have a tendency to use a distinct time model,
and that we take into account that there's a restricted attack
budget that bounds the potential of the assailant in every
spherical. The defense strategy objective is to confirm that
adequate detector nodes area unit protected in every spherical
such the discrepancy between price accepted and also the
truthful detected value is below a particular threshold. They
have a tendency to model the attack-defense interaction as a
Stackelberg game, and that we derive the equilibrium
condition that's adequate to confirm that the detected
information area unit truthful inside a nominal error sure.
Moreover, there is much more research published in the area
of secure aggregation in WSNs [15], [16], [17].
In the WSN First, trust & reputation systems play
vital role as a approach of settling a number of important
problems, like secure routing, false data detection,
compromised node detection, secure data aggregation, cluster
head election, outlier detection, [18]. Second, sensors those
are spread in unfriendly & neglected environments are
extremely liable to node compromising attacks [19]. While
offering better protection than the simple averaging, our
simulation results demonstrate that indeed current IF
algorithms are vulnerable to such new attack strategy. A
systematic method Provenance-based trustworthiness
assessment in sensor networks for assessing the
trustworthiness of data items is shown in [20]. This approach
uses the data provenance as well as their values in computing
trust scores, that is, quantitative measures of trustworthiness.
Authors in [21] proposed IF algorithm for computing
reputation of objects and raters in a rating system. Also a
correlation based ranking algorithm proposed in [22], in
which, trustworthiness of each sensor is gained depending on
the correlation coefficient among the sensors readings & the
current estimate of the true value of the signal. In other words,
this method gives credit to sensor nodes whose readings
correlate well with the estimated true value of the signal.
The literature survey lights on detecting false aggregation
operations by a foe, i.e., on data aggregator nodes acquiring
data from source nodes & giving wrong aggregated values.
Accordingly, they cover neither the problem of false data
being furnished by the data sources nor the problem of
collusion. Still, when an adversary adds false data by a
collusion attack scenario, it can strikes the results of the honest
aggregators & hence the base station will get inclined
aggregate value. In this case, the compromised nodes will
manifest their false data & therefore the base station thinks
that all reports are from true sensor nodes. Although the
aforementioned research take into account false data injection
for a number of simple attack scenarios, & work addresses
emerge in the case of a collusion attack by compromised
nodes in a way which apply high level knowledge about data
aggregation algorithm. Although using the initial reputation
results given by our approach makes IF algorithms more
robust than their master version, the attacker can still change
well the reputation results of the IF algorithms. Thus, in this
section we propose a unique attacker detection method in
order to advance lessen the impact of the compromised nodes.
III. PROPOSED SYSTEM
We have considered the network model show in fig 2 for our
wireless sensor network. The sensor nodes in the network
make clusters, & every cluster has a cluster head which is an
aggregator. The aggregator collects the data after certain time
period and aggregates the collected data. Our aim is to focus
on algorithms which will make the aggregation process more
secure when the single node might be compromised & which
can inject false data in to the aggregator. In our model we
considered that each data aggregator is has plenty
computational power to run IF algorithm for data aggregation.
A node posing highest energy is selected as cluster head
whereas base station has no energy constrain and is stationary.
Fig. 2: Network model
A. Methodology
Our proposed method renders a robust initial estimation of the
trustworthiness of sensor nodes to be used in the first iteration
of the IF algorithm which will improve the functioning of IF
algorithms against the aforementioned attack scenario. Sample
mean is use in most of the formal statistical estimation
methods for variances. And hence suggesting a robust
variance estimation approach in the case of skewed sample
mean is essential part of our methodology.
1. Finding a new powerful and complicated attack
against IF based reputations systems which brings out
a stark exposure in IF algorithms;
2. A new approach for error estimation of sensors nodes
which is efficient in a wide range of sensor faults &
not susceptible to the described attack;
3. Inspired by MLE we have design an effective &
robust aggregation approach which employs an
estimate of the noise parameters gained using the
second point;
4. Our proposed enhanced IF approach is capable of
dealing against the collusion attack by rendering
initial estimate of trustworthiness of sensors
employing inputs from second & third contributions
above;
5. A novel collusion detection & revocation technique
based on an initial approximation of the aggregate
values as well as distribution of differences of each
sensor readings.
Fig. 3: Architecture
Algorithm
Input : X,n,m.
Output : Reputation vector r.

1. For every sensor Si (i=1… n) do, check energy

level
If (Esi > Esj)
Si is selected as CH
Else Si acts as normal Sensor nodes.
2. Calculate the initial reputation vector using MLE
3. Calculate Weight based on distance of reading to
initial reputation vector.
4. Iterative filtering with initial weights.
a. l<-0 Fig. 5: Biased Sensor node
b. Compute r(l+1)
c. Compute d
d. Compute w(l+1)
Where l is number of iteration
5. The nodes have less weight are considered as
compromised.
es = xs - r ;
where es is error xs sensor reading and r is the
estimated reputation vector.
6. Reapply step 2 to 4 to produce more accurate
readings.
7. Stop.

IV. RESULTS
As per the proposed system, we have implemented the design
in c# and to test the efficiency of the proposed system we have
carried our extensive simulation & the obtained results are as
follow.
For the unbiased nodes Series 2 represent the values without
collusion detection and series 3 represent the accuracy with
collusion detection module. Here X axis represents the
Variance and Y axis represents RMS (Root Mean Square
Error). Here the results won’t vary because there is no attack
and the sensors are not biased.
Fig. 6: Biased sensor node
Series 2 represent the values without collusion detection and
series 3 represent the accuracy with fault detection module i.e
the proposed architecture. Results are calculated on the basis
of how much the value of the sensor differs from the mean
value. Therefore graph is plotted as standard deviation vs.
RMS (Root Mean Square Error). RMS is a frequently used
Measure of the Differences between values predicted by an
estimator and values actually observed. Filtering with and
without Fault detection is shown and it clearly explains that
RMS is minimized by this filtering technique with Fault
detection. From the graphs we can see that 0.1, 0.18, 0.22,
0.22, 0.22, 0.3, 0.36, 0.38 is the obtain RMS for our proposed
system with respect to the standard deviation which shows the
performance of our proposes system is better than the existing
system.

V. CONCLUSION AND FUTURE SCOPE

Fig. 4: Unbiased Sensor node
In this paper we proposed a secure data aggregation technique
in WSN in which we have done an advancement in IF
algorithms by providing an initial approximation of the
trustworthiness of sensor nodes. The IF algorithms with a
novel approach for collusion detection & revocation depends
on an initial approximation of the aggregate values as well as
differences of each sensor readings are presented. Extensive
simulation is carried out in C# to test out proposed approach.
We have tested our system on biased and unbiased nodes, and [16] Y. Yang, X. Wang, S. Zhu, and G. Cao, “SDAP: a secure hopby- hop
data aggregation protocol for sensor networks,” in MobiHoc, 2006, pp.
the results obtained shows that RMS is minimized by our 356–367.
advancement in the IF with the fault detection. This depicts [17] S. Roy, M. Conti, S. Setia, , and S. Jajodia, “Secure data aggregation in
results generated are better than the existing system wireless sensor networks,” Information Forensics and Security, IEEE
approaches which we studied in the literature survey. The Transactions on, vol. 7, no. 3, pp. 1040–1052, 2012.
main aim of this paper was to make the wireless sensor [18] Y.Yu, Li, w Trust mechanisms in wireless sensor networks: Attack
network more secure. analysis and countermeasures,” Journal of Network and Computer
Applications
In future, more advancement can be done in IF to
[19] K. Hoffman, D. Zage, and C. Nita-Rotaru, “A survey of attack and
enhance the security of data aggregation. Iterative filtering defense techniques for reputation systems,” ACM Comput. Surv., vol.
algorithm is best way to make the WSN secure, so while 42, no. 1, pp. 1:1–1:31, Dec. 2009.
altering this algorithm efficiency should be considered as [20] H.-S. Lim, Y.-S. Moon, and E. Bertino, “Provenance-based
important parameter. trustworthiness assessment in sensor networks,” in Proceedings of the
REFERENCES Seventh International Workshop on Data Management for Sensor
Networks, ser. DMSN 10, 2010, pp. 27.
[21] C. de Kerchove and P. Van Dooren, “Iterative filtering in reputation
[1] Nasridinov, Aziz, Sun-Young Ihm, and Young-Ho Park. "Skyline-based
systems,” SIAM J. Matrix Anal. Appl., vol. 31, no. 4, pp. 18121834, ar.
aggregator node selection in wireless sensor networks." International
2010.
Journal of Distributed Sensor Networks 2013 (2013).
[22] Y. Zhou, T. Lei, and T. Zhou, “A robust ranking algorithm to
[2] Yanbo Zhou, Ting Lei, and Tao Zhou. A robust ranking algorithm to
spamming,” CoRR, vol. abs/1012.3793, 2010.
spamming. CoRR, abs/1012.3793, 2010.
[3] P. Laureti, L. Moret, Y.-C. Zhang, and Y.-K. Yu. Information _ltering
via Iterative Re_nement. EPL (Europhysics Letters), 75:1006{1012,
September 2006.
[4] Rong-Hua Li, Je_rey Xu Yu, Xin Huang, and Hong Cheng. Robust
reputation-based ranking on bipartite rating networks. In SDM'12, pages
612{623, 2012.
[5] Erman Ayday, Hanseung Lee, and Faramarz Fekri. An iterative
algorithm for trust and reputation management. In Proceedings of the
2009 IEEE international conference on Symposium on Information
Theory – Volume 3, ISIT'09, pages 2051{2055, 2009.
[6] H. Liao, G. Cimini, and M. Medo. Measuring quality, reputation and
trust in online communities. ArXiv e-prints, August 2012.
[7] Bee-Chung Chen, Jian Guo, Belle Tseng, and Jie Yang. User reputation
in a comment rating environment. In Proceedings of the 17th ACM
SIGKDD international conference on Knowledge discovery and data
mining, KDD '11, pages 159{167, 2011.
[8] Saurabh Ganeriwal, Laura K. Balzano, and Mani B. Srivastava.
Reputation-based framework for high integrity sensor networks. ACM
Trans. Sen. Netw., 4(3):15:1{15:37, June 2008.
[9] Ming Li, Deepak Ganesan, and Prashant Shenoy. PRESTO: feedback-
driven data management in sensor networks. In Proceedings of the 3 rd
conference on Networked Systems Design & Implementation - Volume
3, NSDI'06, pages 23{23, 2006.
[10] Hyo-Sang Lim, Yang-Sae Moon, and Elisa Bertino. Provenance-based
trustworthiness assessment in sensor networks. In Proceedings of the
Seventh In- ternational Workshop on Data Management for Sensor
Networks, DMSN '10, pages 2{7, 2010.
[11] Yan Sun, Hong Luo, and Sajal K. Das. A trust-based framework for
fault- tolerant data aggregation in wireless multimedia sensor networks.
IEEE Trans. Dependable Secur. Comput., 9(6):785{797, November
2012.
[12] J.-W. Ho, M. Wright, and S. Das, “ZoneTrust: Fast zone-based node
compromise detection and revocation in wireless sensornetworks using
sequential hypothesis testing,” Dependable and Secure Computing,
IEEE Transactions on, vol. 9, no. 4, pp. 494–511, july-aug. 2012.
[13] S. Ozdemir and H. C¸ am, “Integration of false data detection with data
aggregation and confidential transmission in wireless sensor networks,”
IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 736–749, Jun. 2010.
[14] H.-S. Lim, G. Ghinita, E. Bertino, and M. Kantarcioglu, “A game-
theoretic approach for high-assurance of data trustworthiness in sensor
networks,” in Data Engineering (ICDE), 2012 IEEE 28th International
Conference on, april 2012, pp. 1192 –1203.
[15] H. Chan, A. Perrig, and D. Song, “Secure hierarchical innetwork
aggregation in sensor networks,” in Proceedings of the 13th ACM
Conference on Computer and Communications Security, ser. CCS ’06.
New York, NY, USA: ACM, 2006, pp. 278–287.