1.

INTRODUCTION

1.1 Wireless Sensor Networks

The wireless sensor network is ad-hoc network. It consists small light weighted
wireless nodes called sensor nodes, deployed in physical or environmental condition. And
it measured physical parameters such as sound, pressure, temperature, and humidity.
These sensor nodes deployed in large or thousand numbers and collaborate to form an ad
hoc network capable of reporting to data collection sink (base station).
Wireless sensor network have various applications like habitat monitoring,
building monitoring, health monitoring, military survivallance and target tracking.
However wireless sensor network is a resource constraint if we talk about energy,
computation, memory and limited communication capabilities. All sensor nodes in the
wireless sensor network interact with each other or by intermediate sensor nodes.
With advance in technology, sensor networks composed of small and cost
effective sensing devices equipped with wireless radio transceiver for environment
monitoring have become feasible. The key advantage of using these small devices to
monitor the environment is that it does not require infrastructure such as electric mains
for power supply and wired lines for Internet connections to collect data, nor need human
interaction while deploying. These sensor nodes can monitor the environment by
collecting information from their surroundings and work cooperatively to send the data to
a base station, or sink, for analysis.

Figure 1: Architecture of the Sensor network

1
A sensor nodes that generates data, based on its sensing mechanisms observation and
transmit sensed data packet to the base station (sink). This process basically direct
transmission since the base station may locate very far away from sensor nodes needs.
More energy to transmit data over long distances so that a better technique is to have
fewer nodes sends data to the base station. These nodes called aggregator nodes and
processes called data aggregation in wireless sensor network.

1.2 Clustering in WSN

Sensor node are densely deployed in wireless sensor network that means physical
environment would produce very similar data in close by sensor node and transmitting
such type of data is more or less redundant. So all these facts encourage using some kind
of grouping of sensor nodes such that group of sensor node can be combined or compress
data together and transmit only compact data. This can reduce localized traffic in
individual group and also reduce global data. This grouping process of sensor nodes in a
densely deployed large scale sensor node is known as clustering. The way of combing
data and compress data belonging to a single cluster called data fusion (aggregation).

Figure 2: Clustering in WSN

2
 2. DATA AGGREGATION

Data aggregation is a process of aggregating the sensor data using aggregation

approaches. The general data aggregation algorithm works as shown in the below figure.
The algorithm uses the sensor data from the sensor node and then aggregates the data by
using some aggregation algorithms such as centralized approach, LEACH(low energy
adaptive clustering hierarchy),TAG(Tiny Aggregation) etc. This aggregated data is
transfer to the sink node by selecting the efficient path

Figure 3: General architecture of algorithm

3
2.1 Approaches in Data Aggregation

There are five approaches in data aggregation technique .they are In network
aggregation approach, tree based approach, Cluster based approach, multipath approach,
Hybrid approach. Here we mainly discuss about first four approaches.

2.1.1 In-Network Aggregation

E.Fasolo[1] proposed In-network aggregation which means the global process of

gathering and routing information through a multi-hop network, processing data at
intermediate nodes with the objective of reducing resource consumption (in particular
energy), thereby increasing network lifetime.
There are two approaches for in-network aggregation:
 with size reduction : In-network aggregation with size reduction refers to the
process of combining and compressing the data packets received by a node from
its neighbors in order to reduce the packet length to be transmitted or forwarded
towards sink
 without size reduction: In-network aggregation without size reduction refers to
the process merging data packets received from different neighbors in to a single
data packet but without processing the value of data.
2.1.2 Tree Based Approach
The tree based approach is defining aggregation from constructing an aggregation
tree. The form of tree is minimum spanning tree, sink node consider as a root and source
node consider as a leaves.
Information flowing of data start from leaves node up to root means sink(base
station). Disadvantage of this approach, as we know like wireless sensor network are not
free from failure .in case of data packet loss at any level of tree, the data will be lost not
only for single level but for whole related sub tree as well. This approach is suitable for
designing optimal aggregation techniques data centric protocol know as Tiny aggregation

4
(TAG) approach. The working of TAG is depending on two phases distributed phase and
collection phase.

Figure 4: Tree-based aggregation in wireless sensor networks

Distributed Phase: In distributed phase, in which aggregate queries are pushed down
into the network.

Collection Phase: A collection phase, where the aggregate values are continually routed
up from children to parents. Recall that our query semantics partition time into epochs of
duration, and that we must produce a single aggregate value (when not grouping) that
combines the readings of all devices in the network during that epoch.

2.1.3 Cluster-Based Approach

In energy-constrained sensor networks of large size, it is inefficient for sensors to

transmit the data directly to the sink In such scenarios, Cluster based approach is
hierarchical approach. In cluster-based approach, whole network is divided in to several
clusters. Each cluster has a cluster-head which is selected among cluster members.
Cluster-heads do the role of aggregator which aggregate data received from cluster
members locally and then transmit the result to base station (sink). Recently, several
cluster-based network organization and data-aggregation protocols have been proposed
for the wireless sensor network.

5
 Figure 5: Cluster Based sensor networks.
The cluster heads can communicate with the sink directly via long range
transmissions or multi hopping through other cluster heads. K.Dasgupta [2] proposed a
maximum lifetime data aggregation (MLDA) algorithm which finds data gathering
schedule provided location of sensors node and base-station, data packet size, and energy
of each sensor node. A data gathering schedule specifies how data packet are collected
from sensors node and transmitted to base station for each round. A schedule can be
thought of as a collection of aggregation trees. They proposed heuristic-greedy
clustering-based MLDA based on MLDA algorithm. In this they partitioned the network
in to cluster and referred each cluster as super-sensor.
They then compute maximum lifetime schedule for the super-sensors and then use
this schedule to construct aggregation trees for the sensors. W. Choi proposed a two-
phase clustering (TPC) scheme. Phase I of this scheme creates clusters with a cluster-
head and each node within that cluster form a direct connects with cluster-head. Phase I
the cluster-head rotation is localized and is done based on the remaining energy level of
the sensor nodes which minimize time variance of sensors and this lead to energy saving

6
from unnecessary cluster-head rotation. In phase II, each node within the cluster searches
for a neighbor closer than cluster-head which is called data relay point and setup up a
data relay link.

Now the sensor nodes within a cluster either use direct link or data relay link to
send their data to cluster head which is an energy efficient scheme. The data relay point
aggregates data at forwarding time to another data relay point or cluster head. In case of
high network density, TPC phase II will setup unnecessary data relay link between
neighbors as closely deployed sensor will sense same data and this lead to a waste of
energy.
2.1.4 Multi-Path Approach

The drawback of tree based approach is the limited robustness of the

system. To overcome this drawback, a new approach was proposed by many
researchers .in which sending partially aggregated data to single parent node in
aggregation tree, a node could send data over multiple paths. In which each and every
node can send data packets to its possibly multiple neighbor’s. Hence data packet flow
from source node to the sink node along multiple path, lot of intermediate node between
source node to sink node so aggregation done in every intermediate node.

Using this approach we will make the system robust but some extra overhead. The
example of this approach like ring topology, where network is divided in to concentric
circle with defining level according to hop distance from sink. L.Gatani [3] proposed a
new strategy have both issues, energy efficiency and robustness. In which single path to
connect each node to the base station it is energy saving but high risk of link failure. But
on the other head multipath approach would require more nodes to participate with
consequent waste of energy. Authors present a clever use of multi-path only when there is
loss of packet which is implemented by smart caching of data at sensor nodes.
Authors also argue that in many practical situation data may be gathered only
from a particular region, so they use a different approach that relies on a spanning tree
and provides alternative paths only when a malfunctioning is detected. Algorithm adopts
a tree-based approach for forwarding packets through the network. In the ideal situation

7
when no failures occur, this is certainly the best choice, as the minimum number of nodes
is engaged in the transmission phase. In the presence of link or node failures, the
algorithm will discover alternative paths, so as ensure the delivery of as many packets as
possible within the time constraints.

Figure 6: Representation of Multi Path Approach

The problem with this approach is that it may cause the arising of hot spots and nodes
along preferred paths will consume their energy resources quickly, possibly causing
disconnection in the network.

8
 3. DATA AGGREGATION FUNCTIONS AND
PERFORMANCE MEASURES IN WSN

3.1 Data Aggregation Functions

Many effective type of data aggregation function is needed in wireless sensor

network. These functions are closely related to sensor network application. Such as mean
quantile, medium, count, average, max, and min.

3.1.1 Duplicate Sensitive and Duplicate Insensitive

Aggregation function may be average and minimum. If we use average function ,

it take as a duplicate sensitive and minimum function is take as duplicate insensitive
function in wireless sensor network. Data aggregated in the network on that time same
data consider multiple times. We can used duplicate function then the final result depends
on the number of the times and same value has been considered otherwise aggregation
function is said to be duplicate insensitive.

3.1.2 Lossy and Lossless

Data packet can be aggregated with the help of lossy aggregation or by lossless
aggregation. Lossy aggregation approach does not follow a perfect reconstruction but
lossless aggregation ensures a complete recovery of all individual sensor data at base
station (sink).

3.2 Performance Measures

There are very important performance measures of data fusion algorithm. These
performances are highly dependent on the desired application.

9
3.2.1 Energy Efficiency

H.Cam [4] proposed that by the data-aggregation scheme, we can increase the
functionality of the wireless sensor network. In which every sensor nodes should have
spent the same amount of energy in every data gathering round. A data aggregation
scheme is energy efficient if it maximizes the functionality of the network. Network
lifetime, data accuracy, and latency are some of the significant performance measures of
data-aggregation algorithms. The definitions of these measures are highly dependent on
the desired application.

3.2.2 Network lifetime

The network lifetime is defining the number of data fusion rounds. Till the
specified percentage of the total nodes dies and the percentage depend on the
application .If we talk about some application, simultaneously working of the all the
sensor nodes is crucial hence the lifetime of the network is number of round until the first
nodes which improves the energy efficiency of nodes and enhance the lifetime of whole
network.

3.2.3 Latency

Latency is evaluate data of time delay experiences by system, means data send by
sensor nodes and received by base station(sink).basically delay involved in data
transmission, routing and data aggregation. Communication overhead: It evaluates the
communication complexity of the network fusion algorithm.

3.2.4 Data accuracy

It is ratio of the total number of reading received at the base station (sink) to the
total number of generated. There are different types data aggregation protocols like
network architecture based data aggregation protocols, network-flow-based data
aggregation protocols and quality of service (QOS)-aware data-aggregation protocols
designed to guarantee QOS metrics.

10
 4. DATA REPRESENTATION AND IMPACT OF DATA
AGGREGATION IN WSN

4.1 Data Representation

Data representation is the effective way to representation the data. Wireless sensor
network consists of large number of small sensor nodes. These are resource constraint,
due to limited resource constraint it needs to decide whether to store, compress, discard
and transmit data. All this requirement wants a suitable way to represent the information
any type of structure are common to all sensor node in the network.
4.2 Impact
In this paper we discuss the two main factors that affect the performance of data
aggregation methods in wireless sensor network, Such as energy saving and delay. Data
aggregation is the process, in which aggregating the data packet coming from the
different sources; the number of transmission is reduced. With the help of this process we
can save the energy in the network. Delay is the latency connected with aggregation data
from closer sources may have to held back at intermediate nodes in order to combine
them with data from source that are farther away. Basically aggregation method based on
the position of the sources in the network, number of sources and the network topology.

If the examine the factors, we consider the two models of the source placement.
The event radius (ER) model and random source model. The modelling says us that
where the source are clustered near each other or located randomly, significant energy
gains are possible with data aggregation. These gains are greatest when the number of
sources is large, and when the sources are located relatively close to each other and far

11
from base station. The modelling through, also seems to the suggest that aggregation
latency could be non negligible.

5. SECURITY CHALLENGES

There are two type of securities are require for data aggregation in wireless sensor
network, confidentiality and integrity. The basic security issue is data confidentiality, it is
protecting the sensitive data transmission and passive attacks, like eavesdropping. If we
talk about hostile environment so data confidentiality is mainly used because wireless
channel is vulnerable to eavesdropping by cryptography method. The complicated
encryption and decryption operations such as modular multiplication [5]. The security
issues is data integrity with the help of integrity we reduce the compromised sensor
source nodes or aggregator nodes from significantly altering the final aggregation value.
Sensor node in a sensor network is easily to compromised. Compromised nodes have a
capability to modify or discard messages. Method of secure data aggregation: There are
two type of method for securing data hop by hop encryption and end to end encryption,
both methods follows some step.

 Encryption process has to be done by sensing nodes in wireless sensor network.

 Decryption process has to be done by aggregator nodes.
 After that aggregator nodes aggregates the result and then encrypt the result again.
 The sink node gets final aggregated result and decrypts it again.

5.1 Advantages
 With the help of data aggregation process we can enhance the robustness and
accuracy of information which is obtained by entire network, certain redundancy
exists in the data collected from sensor nodes thus data fusion processing is
needed to reduce the redundant information.

12
  Another advantage is those reduces the traffic load and conserve energy of the
sensors.
5.2 Disadvantages
 The cluster head means data aggregator nodes send fuse these data to the base
station .this cluster head or aggregator node may be attacked by malicious
attacker.
 If a cluster head is compromised, then the base station (sink) cannot be ensure the
correctness of the aggregate data that has been send to it.
 Another drawback is existing systems are several copies of the aggregate result
may be sent to the base station (sink) by uncompromised nodes .It increase the
power consumed at these nodes.

13
 CONCLUSION

Wireless sensor network consists of large number of sensor nodes which are
resource constraint. That’s why lifetime of the network is limited. To overcome this
problem data aggregation technique has been proposed. The data which is obtained in
several nodes is aggregated(gathered) into a single data packet and sent to the base
station(sink).Also discussed the various approaches for data aggregation , advantages ,
disadvantages and various performance measures of the data aggregation technique.

14
 REFERENCES

[1]E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, “In-Network Aggregation Techniques

for Wireless Sensor Networks: A Survey”, IEEE Wireless communication 2007.

[2]K. Dasgupta, K. Kalpakis, and P. Namjoshi, “An Efficient Clustering-based Heuristic

for Data Gathering and Aggregation in Sensor Networks”, IEEE 2003.

[3] L. Gatani, G. Lo Re, and M. Ortolani, “Robust and Efficient Data Gathering for
Wireless Sensor Networks”, in Proceeding of the 39th Hawaii International Conference
on System Sciences –2006

[4]H. Cam, S. Ozdemir, P. Nair, and D.Muthuavinashiappan, “ESPDA: Energy-Efficient

and Secure Pattern-based Data Aggregation for Wireless Sensor Networks”, in
proceedings of IEEE Sensor- The Second IEEE Conference on Sensors, Toronto, Canada.

[5] Kiran Maraiya, Kamal Kant, Nitin Gupta, “Wireless Sensor Network: A Review on
Data Aggregation”, International Journal of Scientific & Engineering Research Volume 2,
Issue 4, April -2011

15