(IJCNS) International Journal of Computer and Network Security, 87

Vol. 2, No. 9, September 2010

Data Aggregation Trees based Algorithm using

Genetic Algorithm in Wireless Sensor Networks
Mehdi Dabbaghian1, Abolfazl Kalanaki2, Hamed Taghvaei3, Faezeh Sadat Babamir 4 and Seyed Mehrdad
Babamir5
1
Islamic Azad University Abhar Branch,
Member of Young Researchers Club, Abhar Branch, Abhar, Iran
m.dabbaghian@engineer.com
2
University of Tehran,
Faculty of Management, Tehran, Iran
info@kalanaki.com
3
Islamic Azad University Arak Branch,
Arak, Iran
taghvaei24@ymail.com
4
Shahid Beheshti University of Tehran,
Evin 1983963113, Tehran, Iran
f.babamir@mail.sbu.ac.ir
5
Sharif University of Technology,
Electrical Engineering Faculty, Tehran, Iran
smbabamir@ee.shrif.ir

redundant ones then aggregate them according to the data

Abstract: This study investigates balanced and energy efficient
data collecting spanning tree in order to propose Genetic
Algorithm (GA) based approach. Optimum solution from GA,
consumes lowest possible energy to transmitting data from
random placed nodes to the Base Station (BS). As a result,
monitoring and sending data are intensively energy consuming.
Using an algorithm which is able to balance residual energy
among nodes can help the network to withstand more and
consequently extend its own lifetime. The GA and data
aggregation tree simulation shows that balancing operation
practically increases the network lifetime.
Keywords: Wireless Sensor Networks, Data Aggregation,
Genetic Algorithm
1. Introduction
Now-a-day, wireless sensor network are appeared every
where especially in ubiquitous and pervasive applications.
These kinds of networks consist of number of small, low
power, certain communication range sensing nodes which
cooperatively monitor environment and transmit data to the
Base Station (BS) or sink. This task is seriously energy
consuming so that due to limited power nodes, intelligent
data dissemination with energy efficient protocols are
attended. The lifetime of network is defined as exchanged
message toward sink with a network in which has minimum
required active nodes [1]. Intelligent optimum energy
consumption protocols can extend the network lifetime and
consequently withstand long transmission periods.
In this study, sensor nodes monitor data and remove
aggregation spanning tree and just then they send packet
data to the appropriate neighbors. BS is a powerful station
which has connection between WSN and IP network. The
proposed technique would be suitable for a homogeneous
WSN with some spatial correlation in the collected data.
Genetic Algorithm (GA) is classified as heuristic functions
which can obtain optimum solution, using investigating
search space. In this paper, a GA based algorithm is used to
create an efficient data aggregation tree in which any node
has value property. Consequently, any chromosome consists
of some genes or nodes that index of gene indicates the node
and corresponding value identifies parent node. We apply,
single point crossover to generate future population where
corrupted individuals are distinguished by selection process.
The fitness function assigns individuals suitable value on
the basis of residual energy, number of transmission and
receive data packet. Number of iteration and population size
determined according to the network size.
Following, we organize the paper with section 2: brief
description of literature, section 3: problem discussing,
section 4: giving more detail about usage of GA to create
data aggregation tree, section 5: providing simulation results
and finally, section 6: conclusion and future work.
2. Related Work
During 2000’s, there are many researches have been
devoted. For instance, Kalpakis et al. [2] propose MLDA
(Maximum Lifetime Data gathering Algorithm). In fact,
MLDA finds edge capacities that flow maximum
88 (IJCNS) International Journal of Computer and Network Security,
transmission by running a linear program. This algorithm is
able to maximum lifetime of network with certain location
of each node and base station.
One year later, Dasgupta et al. [3] extend MLDA with
applying cluster based heuristic algorithm called CMLDA
where nodes are grouped into several clusters with pre-
defined size. The energy summation of cluster member
nodes is their cluster’s energy. The distance between
clusters is computed by maximum distance between every
pair of nodes of two clusters. From cluster formation on
then, MLDA is applied.
Ten at al. [4] study two spanning tresses so that aggregate
scheme and data gathering have been applied to extend
network lifetime. In this paper, generally, two methods are
considered to manage power among nodes. The first, power
aware version (PEDAP) which have an attempt to extend
lifetime, balancing the energy consumption among nodes,
unlike second method, PEDAP, non power aware version
which minimizing the total energy consumed from the
system in each data gathering round [1]. This method
extends the lifetime of the last node. The edge cost is
calculated in different ways. In PEDAP, edge cost is the
same summation of energy mounts for transmission and
receiving while PEDAPPA, dividing PEDAP edge cost with
transmitter residual energy results asymmetric
communication costs. A node with higher cost is considered
later in the tree as it has few incoming. After determining of
edge costs, Prime’s minimum spanning tree rooted at the
BS, will be formed for routing of packets. This calculation is
computed per every 100 iterations. Being active for all nodes
and awareness of node locations at the BS also are their
assumptions.
Jin et al. [5] utilize GA to fulfill energy consumption
reduction. This algorithm gets a primary number of pre-
defined independent clusters and then biases them toward
optimal solution with minimum communication distance by
the iterations of generation. They come to conclusion that
the number of cluster heads is reduced about 10 percentage
of the total number of nodes. They also show cluster based
methods decrease 80 percentage of communication distance
as compare to direct transmission distance.
In 2005, Ferentinos et al. [6] improve the proposed Jin et al.
algorithm with extended fitness parameter. They investigate
energy consumption optimization and uniformity
measurement point, using a fitness function involved status
of sensor nodes, network clustering with the suitable cluster
heads, and also the selection between two signal ranges
from normal sensor nodes.
3. Problem Statement
In this study, we suppose that every node firstly has pre-
defined energy for receiving multi data packets as it is able
to monitor environment in addition to transmit children
packets as well as sending single one to parent or BS. This
task periodically will be continued as long as possible.
In our algorithm, at first, all nodes send a sample certain
packet to the BS once they are at ready. Just then minimum
Vol. 2, No. 9, September 2010
spanning tree or the same an aggregation tree rooted at BS
is formed. In this paper, the network lifetime is credited
until all nodes are active.
4. Genetic Algorithm
In this study, GA is applied in order to obtain balanced and
energy efficient spanning trees. Every chromosome
represents a tree where gene index indicates node and
contained value point out corresponding parent. Using
standard GA, the optimum minimum spanning tree will be
resulted.
4.1 Gene and Chromosome
A chromosome is the collection of genes or nodes which
have fixed length according to the number of former nodes.
3 0 5 1 2 0
1
5
0
2
4 3
Figure 1. Chromosome and corresponding Tree Example
4.2 Crossover
The main step to produce new generation is crossover or
reproduction process. In fact, it is a simulation of the sexual
reproductive process that the inheritance characteristics
naturally are transferred into the new population. To
generate new offspring, crossover selects a pair of
individuals as parents from the collection formed by
selection process for breeding. This process will continue
until the certain size of new population is obtained. In
general, there are various crossover operations which have
been developed for different aims. The simplest method is
single-point in which a random point is chosen whereby two
parents exchange their characteristics. Table 1 shows an
example of mating of two chromosomes in single point way.
Table 1: Single point method at random point 6
First Second
Parents 101101’01101101 011110’10001011
Offsprin 101101’10001011 011110’01101101
g
4.3 Fitness Function
Fitness function is a procedure which scores any
chromosome. This value helps us to compare the whole ones
to each other to survival or death. Below, we propose a
fitness function where N is the number of nodes and setup
energy is considered for calculating electrical power.
Echildren is required energy to sending data packet received
from children.
 (IJCNS) International Journal of Computer and Network Security, 89
ETotal = ESend + EMonitor + EChildren + ESetup
(1)
ETotal
F (i ) =
N
Above, we try to compute average energy mount with
division to the number of nodes. Each individual is assessed
by selection function where the better fitness value; the more
chance to participate in the next generation.
5. Simulation
5.1 Network Properties
The simulation parameters for the experienced sensor
network are: 1) The network dimension is 100*100 m2, 2)
Initial energy of each node is .8 J, 3) Random nodes
placement is considered, 4) Each tree is used just for 15
periods, 5) each scenario is simulated for 5 times that
average one is reported 6) BS is situated at the center of
resource 7) Wireless sensor network simulator, a free
software is utilized for simulation.
5.2 Genetic Algorithm parameters
The simulation for our heuristic algorithm is as follows: 1)
Population size is 500 equal to network nodes, 2) number of
generation is 200, 3) mutation and crossover rate is 0.7.
Figure 2 represents the network under experience in early
setup where little white point is the data packet while they
are transmitting among nodes and green circles are active
nodes at that moment. The light ones are transmitting while
dark ones transmitted at this near time.
Hereinabove shows the network with fewer active nodes but
it is not out of order as the required paths for transmitting
are credited.
At last, Figure 4 indicates our experienced network at its
later lifetime. According to this fig, just a few nodes are
valid for transmitting children and monitored data. In this
status, the network is being to be out of order.
Figure 2. Network status in early setup
Figure 3. Failing some nodes after several periods
Vol. 2, No. 9, September 2010
Figure 4. Network status in later lifetime
As a result, these figures indicate that using proposed
algorithm, the network has most withstanding to transmit
data packet, as minimum spanning tree intelligently selects
an affordable routing leading to extend lifetime.
6. Conclusion
According to the simulation, we came to conclusion that
proposed algorithm extends network lifetime as compared to
PEDAPPA. In future, the fitness function and other GA
parameters can be improved to present more efficient
algorithm. Furthermore, we would like to investigate tree
which can efficiently adapt with network structure.
References
[1] O. Islam, S. Hussain, and Haiyi Zhang, “Genetic
algorithm for data aggregation trees in wireless
sensor networks,” In Proceedings of 3rd International
Conference on Intelligent Environments, pp. 312-316,
September 2007.
[2] K. Kalpakis, K. Dasgupta, and P. Namjoshi,
“Maximum lifetime data gathering and aggregation in
wireless sensor networks”, In Proceedings of IEEE
International Conference on Networking, pp. 685–696,
August 2002.
[3] K. Dasgupta, K. Kalpakis, and P. Namjoshi, “An
efficient clustering-based heuristic for data gathering
and aggregation in sensor networks”, In Proceeding of
IEEE Wireless Communications and Networking
Conference, pp. 1948 - 1953 vol.3, March 2003.
[4] H. O. Tan and I. Körpeoğlu, “Power efficient data
gathering and aggregation in wireless sensor
networks”, In SIGMOD Rec, Volume 32, Issue 4,
pp.66–71, 2003.
[5] S. Jin, M. Zhou, and A. S. Wu, “Sensor network
optimization using a genetic algorithm”, In
Proceedings of the 7th World Multiconference on
Systemics, Cybernetics and Informatics, pp. 1031-
1051, Nov 2003.
[6] K. P. Ferentinos, T. A. Tsiligiridis, and K. G.
Arvanitis, “Energy optimization of wirless sensor
networks for environmental measurements”, In
Proceedings of the International Conference on
Computational Intelligence for Measurment Systems
and Applicatons (CIMSA), pp. 250 – 255, July 2005.