IPASJ International Journal of Computer Science (IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 9, September 2017 ISSN 2321-5992

FILTERING FALSE INJECTED DATA AND

AGGREGATION USING ITERATIVE
FILTERING ALGORITHM IN WIRELESS
SENSOR NETWORK
R. Karthika1, M. Krishnamoorthy2
1
M.Phil Research Scholar, SCSVMV University Enathur, Kanchipuram. TamilNadu , India -631561
2
Assistant Professor, SCSVMV University Enathur, Kanchipuram. TamilNadu , India -631561

ABSTRACT
Data aggregation in case of multiple sensor nodes can be achieved using easy and simple method called as aggregating the
node like averaging. This simple method of aggregation is highly vulnerable to node that can trigger attacks. As we know that
Wireless Sensor Network (WSN) is highly vulnerable to attacks, the credibility of data aggregation and the reputation of sensor
nodes are crucial. A low power processor can improve the performance of WSN and the future aggregator nodes will be able to
perform more complicated data aggregation algorithms. In this paper we demonstrate various existing secure data aggregation
algorithms and consider the most significant approach against collusion attacks. To overcome the various security issues we
propose the modified Iterative Filtering (IF) techniques by providing an initial approximation for algorithms that makes it
collusion robust and also faster converging and accurate.

Keywords:-Data aggregation, Iterative Filtering, WSN, Collusion attacks.

1.INTRODUCTION
Trust & reputation are the two factors been considered as an efficient security mechanism for Wireless Sensor
Networks (WSNs). Though sensor networks are widely used and deployed in many application domains, the collected
data from distributed sensors are still a challenging issue. Iterative Filtering (IF) algorithm is the best option for WSNs
because they eliminate the problem of data aggregation and the data trustworthiness assessment with a single iterative
procedure. There are various IF algorithms in the recent years proposed for trust and reputation systems. These
algorithms show better robustness in their approach than compared to the simple averaging techniques. But these
algorithms do not consider advanced collusion attack scenarios that exist. If the attackers identify the aggregation
algorithm and the parameters involved then the attackers can launch more complicated attacks on WSNs through false
data injected to the compromised nodes. In this paper we research on various collusion attack scenarios against the
existing IF algorithms through false data injection. Through this approach the IF algorithms can become robust against
such complex collusion attacks and we also believe that it can become more robust under other general circumstances
as well. This approach is different from the traditional non iterative statistical sample estimation technique that is non-
robust to false data and can lead to failure of the network. We also propose new approaches for sensor node revocation
and collusion detection.

SECURITY IN WIRELESS SENSOR NETWORK

In the process of transmitting data in wireless sensor networks care must be taken to promise the need of security.
Security is a must for every data and nodes that are required for transferring the data. The below information discusses
on the need for security.
To provide security in sensor networks is complicated due to limited resources.
Security is a must during the design time to make sure about the safety of the operation, privacy of sensitive data and
people involved in the sensor environment.

2.LITERATURE SURVEY
In [2] Chan H., Song D and Perrig A discuss on the secured hierarchical in-network aggregation in case of sensor
networks. This is the first algorithm that to prove a secured hierarchical in network data aggregation. This algorithm

Volume 5, Issue 9, September 2017 Page 1

 IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 9, September 2017 ISSN 2321-5992

guarantees to detect manipulation of the aggregate through adversary and achieve beyond the direct injection of data
values in the compromised nodes. The adversary can never compromise on misrepresenting intermediate
aggregation computations. The algorithm invites only O(Dlog2 n) node congestion, it supports arbitrary tree-based
aggregator topologies and maintains its resistance against aggregation manipulation. The purpose of the main
algorithm is to SUM the aggregation securely by initiating the adversary to commit to its choice of intermediate
aggregation results first and later have the sensor nodes independently verify their contributions to the aggregate are
correct. They also help to reduce secure MEDIAN, COUNT, and AVERAGE along with the objective. In [3] Ho J.-W.,
Das S and Wright M introduced a fast zone-based node compromise detection method in wireless sensor networks
through sequential hypothesis testing. They need each sensor node to be confirmed regularly and hence it leads to
substantial overhead. To overcome the limitations identified in the existing schemes the authors propose a zone-based
node compromise detection and revocation scheme. The main idea of this scheme is to have sequential hypothesis
testing in order to detect the suspect regions where the compromised nodes are likely to be placed. The network
operator performs software attestation against each sensor nodes present in this suspect region and thus leading to
detection and revocation of the compromised nodes. In addition the detection problem is conducted using a game
theoretic analysis. It firstly derives the optimal strategies of the attacker and defender, now it demonstrates the
attackers gain from node compromise is limited by the defender and this happens when both attacker and defender
follow their optimal strategies. H.-S. Lim et al. [7], addresses the most important and challenging problem in WSN that
is trustworthiness of sensor data. The author developed a game theoretic defense strategy in order to protect sensor
nodes from various attacks and also to assure high level of trustworthiness for the sensed data. The main aim of the
defense strategy is to make sure that majority of the sensor nodes are protected in each attack/defense round.
In [5] Yu X., Kim S., Tang L.-A., Hung C.-C., Peng W.-C and Han J. propose a trustworthiness analysis of sensor
networks called the Cyber-Physical System (CPS) that integrates physical devices with cyber components in order to
form a situation-integrated analytical system to respond intelligently in case of dynamic changes in real world
scenarios. The authors propose a method called the True-Alarm that finds out trustworthy alarms and maximizes the
feasibility of CPS. True-Alarm computes the locations of objects that are responsible for the alarm and then constructs
an object-alarm graph to carry out trustworthiness inferences that is based on linked information in the graph.

3.COLLUSION ATTACK SCENARIO

Majority of the IF algorithms have simple assumptions on the initial values of weights for the sensors. Considering our
opponent model, the attacker is capable to cheat the aggregation system by providing side to side cautious range of
report data standards. Consider there are ten sensors to report the values of temperature that are aggregated using the
IF algorithm.
Scenario 1: All the sensors are trustworthy and the result value provided by the IF algorithm is close to the actual
value.
Scenario 2: The adversary consists of two sensor nodes and can modify the reading values so that the simple average of
all sensor readings is altered towards a lower value. Since these two sensor nodes report lower values, IF algorithm
penalize them and gives them lower weights, since their values vary a lot from the values of the sensors.
Scenario 3: In this case the adversary consists of three compromised nodes to launch the collusion attack. It observes
the reports of sensors present in the network and then instructs the two compromised sensor nodes to report values that
are different from the true value. Now it computes the skewed value of the simple average of all sensor readings and
finally instructs the third compromised sensor to report distorted average as its readings.

4.DATA AGGREGATION
A typical wireless sensor network consists of a large number of sensor nodes to collect application specific information
from the given environment and then transfer information to a base station where data is processed, analyzed, and
finally used by the application. In case of resource constrained networks, the generic approach is to process the data
generated by different sensor nodes jointly and forward it to the base station. This is referred as data aggregation and it
involves combining the data that belong to the same phenomenon. The main purpose of data aggregation is to
maximize network lifetime by minimizing resource consumption of sensor nodes (like bandwidth and battery energy).
In the process of increasing network lifetime, the data aggregation protocols might degrade important quality of
services like latency, data accuracy, fault-tolerance, and security. Hence the efficient data aggregation protocol is
required to handle the challenging tasks. Therefore the protocol designer must trade off between data accuracy, energy
efficiency, latency, security and fault-tolerance. To achieve this trade off, data aggregation techniques are very
particular about how the packets are routed through the network. Therefore the formulation of the sensor network plays

Volume 5, Issue 9, September 2017 Page 2

 IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 9, September 2017 ISSN 2321-5992

a vital role in the performance of different data aggregation protocols. There are various protocols that allow routing
and aggregation of data packets simultaneously in a network.

5.OUR CONTRIBUTION
The main agenda of data aggregation algorithm is to collect and aggregate data in the most possible energy efficient
manner in order to extend the network life time. Wireless Sensor Network has an attractive method of data gathering in
case of distributed system architectures. Advanced robust Iterative Filtering technique has the solution for all major
problems in data aggregation in case of WSN. IF is capable of performing simultaneous data aggregation from multiple
sources and can provide trust assessment of these sources as well. Through demonstrations it is revealed that iterative
filtering techniques are robust against collusion attacks and hence to address a novel sophisticated collusion attack we
propose and improved iterative filtering technique by providing the initial approximation. This makes them collusion
robust and also more accurate and faster converging.
Once a user registers in the network a valid user can enter into the existing network topology. The user should register
the login credentials and must assign the weight factors based on the number of data that has to be used. Using the IF
technique the sensor error is computed in a wide range of sensor faults and not prone to the described attack. It uses an
estimate of the noise parameters that are obtained from the sensor nodes. The advanced IF schemes are capable to
protect itself from sophisticated collusion attacks by providing an initial estimate of trustworthiness of sensor using the
input. Our contribution to address this vulnerability present in IF algorithm is to utilize the results of the proposed data
aggregation technique as the initial reputation for these algorithms.
The initial weights for all sensor nodes will be estimated based on the distance of sensors readings to the initial
reputation. The aggregated data performs a filtering operation. If any error is identified on the filtering process, then it
first estimates the errors and computes the new variance of data using MLE and then finally transmits the aggregated
data in a secured way.
The four modules involved for secure data aggregation in IF are: Node Configuration.
Performing data aggregation in multiple sources. To find bias and unbiased readings through IF.
To secure data aggregation using IF with the help of initial values. MLE with known variance.

Fig.1.Show the proposed Work

NODE CONFIGURATION
In this case the nodes are fixed and static. These sensor nodes are divided into disjoint clusters, and then each cluster
has a cluster head that acts as an aggregator. Data is periodically collected and then aggregated through an aggregator.
Here we assume that the aggregator itself is not compromised and thereby we concentrate on the algorithms that make

Volume 5, Issue 9, September 2017 Page 3

 IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 9, September 2017 ISSN 2321-5992

aggregation secure when the individual sensor nodes are compromised and may send false data to the aggregator. We
also assume that each data aggregator has sufficient computational power to run an IF algorithm for data aggregation

DATA AGGREGATION IN MULTIPLE SOURCES

This module considers data aggregation from multiple sources. Data aggregation is the process by which information is
gathered and summarized for some statistical analysis. In general the purpose of an aggregation is to collect more
information about a particular group or groups. The network is formed with these aggregate nodes to collect as many
data as possible from multiple nodes.

FIND BIAS AND UNBIASED READINGS USING IF

We consider that all sensors in WSN have some error; these errors are modeled by the Gaussian distribution random
variable with a sensor bias as bs and with sensor variance as s , ~N(bs , s 2 ). Let us consider rt the true value of the
signal at time t. In order to justify our constraints, it is obvious that if the mean of the bias of all sensors is non zero,
then there is no way to account for it on the basis of sensor readings. In other case, bias of sensors under normal
circumstances can be imperfect in manufacture and calibration of sensors. Or it can be deployed in places that have a
different environmental circumstances and the sensed scalar might have slight different value. Since we are interested
in finding a most reliable estimate of an average value of the variable sensed, it is considered to assume the mean bias
of all sensors is zero (without faults or malicious attacks).
To identify bias and unbiased readings through Iterative Filtering method is specific. In order to formulate a solution
for such vulnerability through an initial trust estimate is based on a robust estimation of errors of individual sensors.
When the nature of the error is stochastic, such kinds of errors are essentially represent as an approximation of the
error parameters of sensor nodes in WSN called as bias and variance.

SECURE DATA AGGREGATION USING IF WITH INITIAL VALUES

According to the attack scenario that is proposed, the attacker tests the vulnerability of the IF algorithms that originates
because of the wrong assumption on the initial trustworthiness of sensors. Our proposal is to address this shortcoming
is by employing the results of the proposed robust data aggregation technique as the initial reputation for these
algorithms. Besides, the initial weights for all the sensor nodes can be manipulated using the distance of sensors
readings to such an initial reputation.

MLE WITH KNOWN VARIANCE

We implemented a novel approach to estimate the bias and variance of noise for sensors based on their readings. The
bias and the variance of a sensor noise can be defiined as the distance measures of the sensor readings to the true value
of the signal. From a heuristic view, we eliminated the systematic component of the error by subtracting a quantity
that in the case of a stochastic error constitutes to the estimate of bias. This allows us to compute the variability around
such a systematic component of the error. Now we can estimate using MLE formula for the case of zero mean normally
distributed errors, but with estimated rather than true variances. Hence, we assume that the expected value rt of the
measurements is the true value of the quantity measured, and is the only parameter in the function

ITERATIVE FILTERING ALGORITHM

Algorithm: Iterative filtering algorithm. Input: X,n,m.
Output: The reputation vector r l 0;
w (0) 1; Repeat
Compute r (l+1) Compute d;
Compute w (l+1) l l + 1
Until reputation has converged;
We consider a WSN with n sensors and also assume that the aggregator works on one block of reading at a time. Each
block comprises of reading from m consecutive instants. Hence the block of reading is written by matrix X. r
represents the aggregated values and is called as a reputation vector calculated with the sequence of weight w. The
iterative procedure starts by giving equal credibility to all the sensors with Initial value w (0). The value of the
reputation vector r (l+1) in round of iteration l + 1 is attained from the weights of the sensors that are obtained in the
round of iteration l.
The new weight vector w (l+1) to be used in round of iteration l + 1 is then calculated as a function g(d) of the
normalized belief divergence d as the distance between the sensor reading and reputation vector r (l).

Volume 5, Issue 9, September 2017 Page 4

 IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 9, September 2017 ISSN 2321-5992

6.CONCLUSIONAND FUTURE WORK

In this paper, we proposed a collusion attack that occurs against a number of existing Iterative Filtering algorithm. We
propose a modified Iterative Filtering algorithm by providing the foremost conjecture for the trustiness of the sensor
nodes that makes the algorithm collusion robust and also reliable and faster converging. On comparing with both
verification and Iterative Filtering algorithm, the latter is more efficient. In future works based on this objective we can
interrogate if this approach is secure against compromised aggregators. Hence it can also be planned to implement in
the deployed sensor network
REFERENCES
[1]S.Ozedemir and Y.Xiao,(Aug.2009)Secure data aggregation in wireless sensor networks: A comprehensive
overview, Computer Network,vol.53,no.12,pp.2022-2037.
[2]L.Wasserman,All of statistics:a concise course in statistical inference.New York:Springer.
[3]K.Hoffman,D.Zage and C.Nita-Rotaru(Dec.2009), A survey of attack and defence techniques for reputation
systems,ACMComput.Surv,vol.42,no.1,pp.1:1-1:31.
[4]H-S.Lim,Y-S.Moon and E.Bertino(2010) Provenance-based trustworthiness assessment in sensor networks, in
proceedings of seventhInternational Workshop on Data Management for sensor Networks,ser.DMSN,pp.2-7.
[5]Y.Zhou,T.Lei and T.Zhou(2010) A robust ranking algorithm to spamming,CoRR,vol.abs/1012.3793.
[6]P.Laureti,L.Moret,Y-C.Zhang and Y-K.Yu(2006), Information filtering via Iterative Refinement,EPL
(Europhysics Letters),vol75,pp.1006-1012.
[7]R-H.Li,J.X.Yu,X.Huang and H.Cheng(2012),Robust reputation based ranking on bipartite ranking networks, in
SDM12,pp.612-623.
[8]M. C. Vuran and I. F. Akyildiz, Spatial correlationbased collaborative medium access control in wireless sensor
networks, IEEE/ACM Trans.Netw., vol. 14, no. 2, pp. 316-329, Apr. 2006.
[9]S.Ganeriwal, L.K. Balzano ,andM.B.Srivastava, Reputationbasedframework for high integrity sensor networks,
ACM Trans. Sen. Netw., vol. 4,no. 3, pp. 15:1-15:37, Jun. 2008.
[10]M. Li, D. Ganesan, and P. Shenoy, PRESTO: feedback-driven data management in sensor networks, in
Proceedings of the 3rd conference on Networked Systems Design & Implementation Volume 3, ser. NSDI06,
2006, pp. 23-23.
[11] B. Przydatek, D. Song, and A. Perrig, SIA: Secure information aggregation in sensor networks, in Proc. 1st Int.
Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[12] H. Chan, A. Perrig, and D. Song, Secure hierarchical in-network aggregation in sensor networks, in Proc. ACM
Conf. Computer and Communications Security (CCS), 2006.
[13] K. B. Frikken and J. A. Dougherty, An efficient integrity-preserving scheme for hierarchical sensor aggregation,
in Proc. 1st ACM Conf.Wireless Network Security(WiSec), 2008.
[14] Y. Yang, X. Wang, S. Zhu, and G. Cao, SDAP: A secure hop-by-hop data aggregation protocol for sensor
networks, in Proc. Seventh ACMInt. Symp.Mobile Ad Hoc Networking and Computing (MobiHoc), 2006. [15] S.
Nath, H. Yu, and H. Chan, Secure outsourced aggregation via one-way chains, in Proc. 35th SIGMOD Int. Conf.
Management of Data, 2009.
[16] L. Hu and D. Evans, Secure aggregation for wireless networks, in Proc. Workshop Security and Assurance in Ad
hoc Networks, 2003.
[17] H. Yu, Secure and highly-available aggregation queries in large-scale sensor networks via set sampling, in Proc.
Int. Conf. Information Processing in Sensor Networks, 2009.
[18] S. Roy, S. Setia, and S. Jajodia, Attack-resilient hierarchical data aggregation in sensor networks, in Proc. ACM
Workshop Security of Sensor and Adhoc Networks(SASN), 2006.
[19] A. Perri g, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar, SPINS:Security protocols for sensor networks, in
Proc. Int. Conf. Mobile Computing and Networks(MobiCom), 2001.

Volume 5, Issue 9, September 2017 Page 5