International Journal of Emerging Technologies and Engineering (IJETE)

Volume 2 Issue 4, April 2015, ISSN 2348 8050

An Efficient and Reliable Data Routing for In-Network

Aggregation in Wireless Sensor Network
Shivakumar A B#1, Jagadeesha R#2, Ananda Babu J#3, Rashmi K R#4
#1, 4

#2, 3

(PG scholar, CSE, Kalpataru Institute of Technology, Tiptur, India)

(Assistant professor, CSE, Kalpataru Institute of Technology, Tiptur, India)

ABSTRACT
The main key issue in Wireless Sensor Networks
(WSNs) is energy conservation in nodes. WSNs are
used in many applications for precise monitoring. These
contain high density of nodes which lead to redundant
data while sensing an event in network. Data
aggregation or data fusion is utilized to reduce and save
energy in network. The size and number of exchanged
messages is reduced by aggregating data at intermediate
nodes it helps reduce the duplicates of data. These will
be reducing data communication costs and energy data
consumption in WSN. Data Routing for In-Network
Aggregation is proposed, it contains some key aspects
like depleted number of messages for setting up a
routing tree, maximized number of super-imposed
routes, high data aggregation rate, and reliable
aggregation and transmission of data. The proposed
system is best aggregation quality in WSNs.
Keywords Data aggregation, Data fusion, In-network
aggregation, Wireless sensor network.

I. INTRODUCTION
Wireless sensor networks (WSNs) consists of
distributed autonomous devices sense physical or
environmental conditions such as temperature, sound,
vibration, motion, pressure, or pollutants at different
locations. Due to high density of nodes, it is likely that
redundant data will be detected by nearby nodes while
sensing an event. Since energy conservation is a key
issue in WSNs, data aggregation or data fusion is to
save energy. Redundant data is aggregated at
intermediate nodes, reducing the size and data of
exchanged messages, thus reducing the data
communication cost and energy consumption. A WSN
extends our capability to explore, monitor and control
in the physical world. It is especially useful in
catastrophic or emergency scenario where human
participation may not occur because of is too dangerous
in nature. Data logging is done in WSN. Wireless
sensor networks are also used for the collection of data
for monitoring of environmental information; this can
be as simple as the monitoring of the temperature in a

fridge to the level of water in overflow tanks in nuclear

power plants.
Achieving maximum lifetime in WSNs by
optimally use the energy within sensor nodes has been
the subject of significant researches in the last recent
years. A WSN is a number of low-powered, energyconstrained sensor nodes with sensing, data processing
and wireless communication components. Therefore,
minimizing energy consumption is an important issue
in the design of WSNs protocol.
Data funneling and aggregation [1] may address the
problem to some extent, but cannot eliminate the
problem either. The main objective of our work is to
provide a long-term continuous connectivity. They
attempt to address the problem by designing a poweraware topology management scheme. Major attention is
given to the connectivity of the network as purposes of
sensing coverage.Classifications of routing protocol in
WSN are routing Protocol is used to find true valid
routes between communicating nodes. The routing
protocols could be broadly classified as follows:
Node centric Routing Protocols
In node centric routing protocol the destination is
specified based on the numerical addresses as in
identifiers of the nodes. But it is not commonly
expected communication type.
Data Centric Routing Protocols
In data centric routing, the sink sends queries to
certain region and waits for data from the sensor
located in the selected regions. Since the data is being
requested through queries, attribute based naming is
necessary to specify the properties data. Here data is
usually transmitted from every sensor node within the
deployment region with significant redundancy.
Location Aware Routing Protocols
The nodes know where they are in the geographical
region in location aware routing protocol. Location
information can be used to improve the performance in
routing and provide new type of services.
QoS based Routing Protocols
In Qos based routing protocol, data delivery ratio,
latency and energy consumption is mainly considered.
To get a good quality of service, the routing protocol
104

www.ijete.org

International Journal of Emerging Technologies and Engineering (IJETE)

Volume 2 Issue 4, April 2015, ISSN 2348 8050

must possess more data delivery ratio, less latency and

less energy consumption.
Hierarchical Routing Protocols
In hierarchical (cluster) protocol, different nodes are
grouped to form clusters and data from nodes belonging
to single cluster can be combined (aggregated). The
cluster based approach has several advantages, like
scalable, energy efficient in finding routes and easy to
manage.

In addition, a timeout may be used for the case of some

childrens packet being lost.
Periodic per-hop adjusted aggregation
The transmission time of a node is adjusted
according to this nodes position in the gathering tree.
The choice of the timing strategy strongly affects the
design of the routing protocol as well as its
performance.

III. DATA AGGREGATION

II. IN-NETWORK DATA AGGREGATION
In WSNs, in-network data aggregation refers to the
different ways intermediate nodes forward data packets
toward the sink node while combining the data gathered
from different source nodes. Data aggregation requires
a forwarding paradigm that is different from the classic
routing, which typically involves the shortest path in
relation to some specific metric to forward data toward
the sink node. In data aggregation aware routing
algorithms, nodes route packets based on their content
and choose the next hop that maximizes the overlap of
routes in order to promote in-network data aggregation.
In-network aggregation is 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 and without size reduction. Innetwork aggregation with size reduction refers to the
process of combining & 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. 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.
A key aspect of in-network data aggregation is the
synchronization of data transmission among the nodes.
In these algorithms, a node usually does not send data
as soon as it is available since waiting for data from
neighbouring nodes may lead to better data aggregation
opportunities. This in turn, will improve the
performance of the algorithm and save energy.
A. Main timing strategies.
Periodic simple aggregation
Each node requires waiting for a predefined period
of time while aggregating all received data packet and,
then forward a single packet with the result of the
aggregation.
Periodic per-hop aggregation
The aggregated data packet is transmitted as soon as
the node hears from all of its children. This approach
requires each node to know the number of its children.

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 1. 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.
General architecture of the data aggregation
algorithm as shown in figure 1, There are many types of
aggregation techniques are present some of them are
listed below.
Centralized Approach
This is an address centric approach where each node
sends data to a central node via the shortest possible
route using a multihop wireless protocol. The sensor
nodes simply send the data packets to a leader, which is
the powerful node. The leader aggregates the data
which can be queried. Each intermediate node has to
send the data packets addressed to leader from the child
nodes. So a large number of messages have to be
transmitted for a query in the best case equal to the sum
of external path lengths for each node.
Tree-Based Approach
In the tree-based approach perform aggregation by
constructing an aggregation tree, which could be a
minimum spanning tree, rooted at sink and source
nodes are considered as leaves. Each node has a parent
node to forward its data. Flow of data starts from leaves
nodes up to the sink and there in the aggregation done
by parent nodes.
Cluster-Based 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. Clusterheads do the role of aggregator which aggregate data
received from cluster members locally and then
transmit the result to sink

105
www.ijete.org

International Journal of Emerging Technologies and Engineering (IJETE)

Volume 2 Issue 4, April 2015, ISSN 2348 8050

Fig. 1, General architecture of the data aggregation

algorithm

IV. LITERATURE SURVEY

The energy saving concept of wireless sensor
network is discussed in [2] [3] [4] [5] [6].
In [2], L. Villas, A. Boukerche, R.B. de Araujo, and
A.A.F.Loureiro, proposed the data will be aggregated
while flowing from multiple sources to a specific node
named sink. The construction of routing trees aware of
the data aggregation has a considerable cost and
solutions in the literature are not efficient for scenarios
where the events are of short duration. This paper
presents the Dynamic Data-Aggregation Aware
Routing Protocol (DDAARP) for WSN. It reduces the
number of messages necessary to set up a routing tree,
maximize the number of overlapping routes, selects
routes with the highest aggregation rate, and performs
reliable data aggregation transmission.
In [3], F. Hu, X. Cao, and C. May, proposed the
Optimized Scheduling for Data Aggregation in
Wireless Sensor Networks, an intelligent timer and
some high-level knowledge of the network to
implement an efficient aggregation timing control
protocol. Our protocol aims to dynamically change the
data aggregation period according to the aggregation
quality. A request from the data sink will include the
maximum latency for a certain number of reports. If
this number of reports can be returned in less time than
the maximum, then the maximum time will not be
reached.
In [4], C. Efthymiou by a detailed analysis the
author precisely estimates the probabilities for each
propagation choice in order to guarantee energy
balance. The need of estimation can easily be
performed by current sensors using simple to obtain
information. Under some assumptions, the papers also
derive a closed form for these probabilities. In [5], I.
Chatzigiannakis has done the research on smart dust

from a basic algorithmic point of view. "Sleep-Awake"

protocol is used for information propagation that
explicitly uses the energy saving features (i.e. the
alteration of sleeping and awake time periods) of the
smart dust particles. It is noted that the study of the
interplay of these parameters allows us to program the
smart dust network characteristics accordingly.
In [6], Heinzelman W.B, Chandrakasan, A.P
Balakrishnan H, Proposed the application specific
protocol architecture for wireless Microsensor
networks, IEEE Transition on Wireless Communication
2002. Robust wireless communication protocols that
are energy efficient and provide low latency, develop
and analyze low-energy adaptive clustering hierarchy
(LEACH), it is a protocol architecture for Microsensor
networks that combines the ideas of energy-efficient
cluster-based routing and media access together with
application-specific data aggregation to achieve good
performance in terms of system lifetime, latency, and
application-perceived quality. The LEACH includes a
distributed cluster formation technique that enables
self-organization of large numbers of nodes, algorithms
for adapting clusters and rotating cluster head positions
to evenly distribute the energy load among all the
nodes, and techniques to enable distributed signal
processing to save communication resources. Our
results show that LEACH can improve system lifetime
by an order of magnitude compared with generalpurpose multihop approaches.
LEACH the following techniques to achieve the
design goals: 1) randomized, adaptive, self-configuring
cluster formation; 2) localized control for data transfers;
3) low-energy media access control (MAC); and 4)
application-specific data processing, such as data
aggregation or compression. LEACH provides the high
performance,
Suitable for wider range of wireless
micro sensor networks. LEACH is not as efficient as
LEACH-C, The utilization of bandwidth is not
efficient, and the assumption made that all Nodes are
within communication range of scalability of the
protocol.

V. PROPOSED SYSTEM.
An efficient & reliable routing using data fusion
and aggregation technique is used for best aggregation
quality is achieved. It maximizes the number of
overlapping routes, high aggregation rate, reliable data
aggregation and transmission in WSNs. It reduces the
number of messages for setting up a routing tree. The
main goal of our proposed Data Routing for In-Network
Aggregation is to build a routing tree with the shortest
paths that connect all source nodes to the sink while
maximizing data aggregation. The proposed system can
be divided into three phases, and High level diagram for
event occurrence as shown in figure 2.
106

www.ijete.org

International Journal of Emerging Technologies and Engineering (IJETE)

Volume 2 Issue 4, April 2015, ISSN 2348 8050

Date packets per processed data. It is the rate

between the total packets transmitted (data and control
packets) and the number of data received by the sink.
Routing tree cost.
The total number of edges in the routing tree
structure built by the algorithm.
Loss of aggregated data.
Number of aggregated data packets lost during the
routing. In this metric, if a packet contains S
aggregated packets and if this packet is lost, it is
accounted the loss of S packets.
Transmissions number.
Number of transmissions: Sum of control overhead
and data transmissions, i.e., the total packets
transmitted.

VII. CONCLUSION

Fig. 2, High level diagram for event occurrence

Phase 1, the hop tree from the sensor nodes to the
sink node is built. In this phase, the sink node starts
building the hop tree that will be used by Coordinators
for data forwarding purposes.
Phase 2, it consists of cluster formation and cluster
head election among the nodes that detected the
occurrence of a new event in the network. Finally,
Phase 3 is responsible for both setting up a new
route for the reliable delivering of packets and updating
the hop tree.
The proposed system considers the following roles
in the routing infrastructure creation in WSNs.
Collaborator: A node that detects an event and reports
the gathered data to a coordinator node.
Coordinator: A node that also detects an event and is
responsible for gathering all the gathered data sent by
collaborator nodes, aggregating them and sending the
result toward the sink node.
Sink: A node interested in receiving data from a set of
coordinator and collaborator nodes.
Relay: A node that forwards data toward the sink.

VI. PERFORMANCE EVALUATION

We evaluate the Data Routing for In-Network
Aggregation performance under the following metrics:
Data Packet delivery rate.
Number of data packets that reach to the sink node.
This metric indicates the quality of the routing tree built
by the algorithms is the lower the packet delivery rate,
the greater the aggregation rate of the built tree.
Control packet overhead.
Number of control messages used to build the
routing tree including the overhead to both create the
clusters and set up all the routing parameters for each
algorithm.
Efficiency (packets per processed data).

Data Routing for In-Network Aggregation is a

routing infra-structure tends to maximize the
aggregation points and use fewer control packets to
build the routing tree. This proposed system does not
flood a message to the whole network whenever a new
event occurs. This proposed system controls network
traffic in data transmission of sensor nodes in networks,
energy efficient by using data aggregation and data
fusion, and provides reliability in WSNs

REFERENCES
[1] D. Petrovic, R. C. Shah, K. Ramchandran, and J.
Rabaey, Data Funneling: Routing with aggregation
and compression for wireless sensor networks, in
Proceedings of IEEE Sensor Network Protocols and
Applications (SNPA), 2003.
[2] L. Villas, A. Boukerche, R. B. de Araujo, and
A.A.F.Loureiro, Highly Dynamic Routing Protocol for
Data Aggregation in Sensor Networks, Proc. IEEE
Symp
Computers
and
Comm.(ISCC),
http://dx.doi.org/10.1109/ISCC.2010.5546580, 2010.
[3] F. Hu, X. Cao, and C. May, Optimized Scheduling
for Data Aggregation in Wireless Sensor Networks,
Proc. Intl Conf. Information Technology: Coding and
Computing (ITCC 05), pp. 557- 561, 2005.
[4] C. Efthymiou, S. Nikoletseas, and J. Rolim, Energy
Balanced Data Propagation Wireless Sensor Networks,
Wireless Networks, vol. 12, no.6, pp. 691-707, 2006.
[5] I. Chatzigiannakis, S. Nikoletseas, and P.G.
Spirakis, Efficient and Robust Protocols for Local
Detection and Propagation in Smart Dust Networks,
Mobile Networks and Applications, vol. 10, nos. 1/2,
pp. 133-149, 2005.
[6] Heinzelman, W B. Chandrakasan, A.P.;
Balakrishnan, H. Application specific protocol
architecture for wireless microsensor networks. IEEE
Trans. Wirel. Commun 2002, 1, 660-670.
107

www.ijete.org