World of Computer Science and Information Technology Journal (WCSIT)

ISSN: 2221-0741
Vol. 2, No. 2, 74-78, 2012

A Novel Approach for Energy Optimization of

Wireless Sensors Network by Adaptive Clustering

Rufaida Muhammad Shamroukh Aryaf Abdullah Aladwan Ana’am Abdullah Aladwan

Computer Engineering dept. Computer Engineering dept. Information Systems & Technology dept.
Faculty of Engineering Technology Faculty of Engineering Technology University of Banking and Financial
Al-Balqa’ Applied University Al-Balqa’ Applied University Sciences
Amman , Jordan Amman , Jordan Amman , Jordan

Abstract—Energy optimization has a major role in modern researches. While, energy optimization of wireless sensors
network is the most important, because of the limitations of the battery energy of the wireless sensor. This paper concentrate
on energy optimization by introducing a novel and an adaptive clustering algorithm that is fuzzy logic based. The result of
our work minimizes the interval between the first node (sensor) death and the last one. The dead node interval minimization
to a value near to zero increases the efficiency of energy and saves 93% of traditional clustering of wireless sensors network.
This paper compares the result of this novel approach to LEACH, LEACH-M, and LEACH-L algorithms.

Keywords-Wireless Sensors Network; LEACH; Energy Efficient; Fuzzy Clustering.

d is the transmission data cost function

I. INTRODUCTION tq is the energy slop of transmission data.
Wireless Sensor Networks can collect reliable and k is the battery self leakage.
accurate information in distant and hazardous environments,
and can be used in National Defense, Military Affairs,
Industrial Control, Environmental Monitor, Traffic d(p, q) = d(p, q) = √∑n((qi – pi)2) ….. (2)
Management, Medical Care, Smart Home, etc. The sensor i=1
whose resources are limited is cheap, and depends on battery
to supply electricity, so it’s important for Routing to
efficiently utilize its power. Where: d(p,q) is the coordinates of the nodes,
P1, q1 is the first node
P2, q2 is the second node or the head of cluster
This paper proposes an advanced modification on [1].
The modification is fuzzy logic based clustering algorithm The sensors in different areas use different frequencies
which can be described as follows: calculate a potential of and gaps to communicate with BS. In the last part, a
all nodes which is given in equation 1. Start determining the comparison with LEACH, LEACH-M, and LEACH-L is
cluster head by fuzzy c-mean algorithm directly. The shown. The overall work is done using MATLAB.
clusters which are selected by the new modified algorithm
depend on the potential of nodes. Equi-potenial clusters are
assumed in this paper. The simulation experiments indicate that the new
contributed approach can prolong the whole network
lifetime for an interested scale.
P = 1/Eq + 1/Er - d * tq – k .… (1)

Where: P is the potential. II. RELATED WORKS

Eq is the Euclidean distance, given in equation 2
Er is the total remaining energy in the sensors A main issue in the design of wireless sensor networks is
the power dissipation scheme, hence the wireless node has a
battery.

47
 WCSIT 2 (2), 74 -78, 2012

limited energy tag battery and has no backup power source III. FUZZY CLUSTERING
until node death, thus, researches consider the design of low- Fuzzy C-Mean (FCM) algorithm is a away to show how
power signal processing architectures, low power sensing data can be classified and clustered in organization or in any
interfaces, energy efficient wireless media access control application such as cellular, but it’s important to observe that
and routing protocols, which revolves around energy data has some attributes such as distance between points of
balancing and management process. data, weight and potential value for data points that makes it
difficult to understand how to cluster data points in such
away to achieve better classification and use of data points.
LEACH is one of the first hierarchical routing FCM algorithm divide data for different size cluster by using
approaches for sensors networks, which attempts to improve fuzzy system depending on many criteria like distances
energy and routing efficiency of such networks. The idea between one data point and other’s, center points and
proposed in LEACH has been an inspiration for many membership function. Thus, the clusters don’t have accurate
hierarchical routing protocols, although some protocols have sizes.
been independently developed.

FCM algorithm puts each point into a cluster that is near

The main target research that this paper aims to compare to it by measuring the distance between point and clusters.
with is [1]. That paper focuses on reducing the power Our algorithm has a new criterion – rather than distance, to
consumption of a wireless sensors network, its algorithm decide if any point will be included to any cluster or not.
called LEACH-L. Our work differ from that paper in that,
this research is supposed to determine the original centers of
all clusters using fuzzy logic based clustering, in addition, If a specified data point included in two clusters or more
the centers of all clusters are dynamically changeable over the problem is how to decide in which cluster it can be used?
the time, also, the cluster sizes is qui-potential clusters, the This problem is so important in the proposed application;
cluster arrangement may change over the time thus, the because of that, any point located between two clusters can
potential will be equal over the running time and the life be excluded or included by those clusters. In this paper, the
time. balance of cluster means that, making all cluster sizes equal
by adding or excluding one point (node), two points, or three
points. The balance of clusters depends on the points that are
In [3], the author puts forward energy-LEACH and located in between two or more clusters with semi-equal
multihop-LEACH protocols called LEACH-M. Energy- potential.
LEACH protocol improves the choice method of the cluster
head, makes some nodes which have more resi- dual energy
as cluster heads in next round. Multihop- LEACH protocol The traditional clustering using FCM algorithm puts all
improves communication mode from single hop to multi- points into a specified cluster, resulting in different clusters
hop between cluster head and sink. Simulation results show sizes. This paper relates the points to its cluster depending
both energy-LEACH and our results in this paper. Our on its potential regardless of it’s arrange.
simulated results are much better than LEACH protocols.

In [4], author proposes a novel energy efficient IV. METHODOLOGY

clustering scheme for single-hop wireless sensor networks. This paper’s methodology is divided into three
A novel cost function is introduced to balance the load procedures; the first is clustering the data depending on
among the cluster heads and prolongs the network life-time fuzzy c-mean clustering algorithm in order to determine
significantly against the other clustering protocols such as initial head of clusters. All nodes will be distributed in
LEACH. Our algorithm arranges and manages the potential clusters depending on the initial potential of all nodes which
of nodes to semi-equal, thus, the death of all nodes happens is calculated by equation 1, and on the head of clusters
in the same interval, which maximizes the life time of whom achieved by fuzzy logic.
overall network.

The second procedure is start transmitting data from the

In [5], a novel multicast protocol, uCast is proposed for cell nodes to the base station across the head of the cluster.
energy efficient content distribution in sensor net-works.
The uCast support a large number of multicast sessions, Energy of all nodes will be changed after the
especially when the number of destinations in a session is transmission process. The amount of energy that the node
small. Our paper supports large number of data with loses in each transmission process is called “energy slope”.
relatively low computational time and power.

47
 WCSIT 2 (2), 74 -78, 2012

The third procedure is to re-select all head of clusters by This few change will got at least 3% life time extend for
using equation 3, and re-distribute the overall nodes on the the overall node.
clusters to ensure that all clusters have equal potentials over
the whole life time.
Nodes death interval can be long as LEACH or LEACH-
M approaches. When a first node is dead, the data collection
Pc = min (Pco ∑ (Pco – 1) + (Pco +1) ) …… (3)
of that sensor will be stopped as long as gathering and
logging. In addition, transmission of information will be
Where Pc is the next cluster head potential (goal) and interrupted for some processes. The nodes death interval is
Pco is the current cluster head potential. the period from the first node death to the last node death in
the network. This period should be as small as possible.
This topology is dynamic and the clusters is changed
every transmitting process. The long interval of nodes death is a big deal in wireless
sensors network. It results in either energy losses or data
losses. There are many approaches aim to deal with that
Figure 1 shows a sample topology after clustering. The interval. This paper aims to minimize that interval in the
nodes which have two colors (i.e. blue and black) is located best way.
in between two clusters (i.e. the nodes that have blue and
black colors, can be added to the blue cluster or even to the
black one). Including a single node to a cluster will not The developed system in [1] minimizes the interval of
cause a big change, but it will balance the cluster potential. nodes death in LEACH-L algorithm which results in a non
negligible ratio of total energy saving. But still has an
interval of node death that causes losses in the transmitted
Figure 1 shows four clusters; Black, Green, Blue and data in addition to the losses in energy over a relatively wide
Red. The bold large node is the cluster head. The in between time.
points (that have two colors) are transient points which can
transmit between two clusters continuously every new
clustering process. Our algorithm developed more efficient system than
LEACH-L algorithm. It contributes a modification that
minimizes the time of nodes death interval to most known
The potential of all clusters will not get exactly equal, shortest interval. Hence, this algorithm distributes the nodes
but it will be goes to appear equal, hence, the difference on clusters those has equal potential, which minimizes the
between clusters potential is very small and may be load on many nodes and ensures symmetric energy slope.
negligible. Otherwise, the size of those clusters will be
different.
An addition, considering the head of cluster to be the
maximum potential node will minimize the consumed
The size of clusters doesn’t take place in this proposed energy of some nodes.
algorithm.

Actually, selecting the head of cluster in a non-optimal

way may consume its energy in a very short time while the
proposed technique is saving the head of cluster energy.

However, there is still a difference in the remaining

energy of the actual nodes in each transmission process; this
will be clear when testing on large transmission scale of
data. That difference will represent real challenges for future
researches because it needs to develop a new algorithm.

V. RESULTS
This paper developed an algorithm using MATLAB to
Figure 1. Sample of the proposed topology for wireless sensor network.
experiment and simulate the proposed procedure. The

47
 WCSIT 2 (2), 74 -78, 2012

parameters of test conditions and experiments are shown in Figure 3 shows the received packet number of LEACH,
Table I. LEACH-M, and LEACH-L over a round of 300 x 300m,
and also, it shows the same data with respect to the proposed
approach. It ensures the keeping of packet transmission in
In the simulation, we have used the same parameters and addition to longest packet amount.
conditions that were used in [1], in order to make the
comparison meaningful. The new modification and
improvement of results, especially energy, is clarified by the
following figures.

TABLE I. SIMULATION PARAMETERS.

Parameter Scene 1 Scene 2
The scope 300 x 300 m 500 x 500 m
The number of sensors 900 2500
The initial energy 0.5 J 0.5 J
E 1J 1J
The length of packets 4000 4000
ETX 5 x 10-8 5 x 10-8
ERX 5 x 10-8 5 x 10-8
εfs 10-11 10-11
εmp 1.3 x 10-15 1.3 x 10-15
EDA 5 x 10-9 5 x 10-9
P 0.1 0.1
M 0.1 0.1
D 70 m 70 m
Restriction_distance 30 m 70 m
Max_distance 87 m 87 m Figure 3. Received packets over round 300 x 300 among LEACH,
LEACH-M, LEACH-L versus the Proposed Algorithm.
Figure 2 shows the life time cycle over round of 300 by
300m. It shows the node death scheme for LEACH, Figure 4, 5, and 6 shows the energy consumption of
LEACH-M, and LEACH-L, and also, it shows the results of LEACH, LEACH-M and LEACH-L, over round of 300 x
the proposed system which results in saving energy and 300m, and 500 x 500m respectively, in addition to the same
extending the life time of the nodes. Minimizing the interval results of the proposed algorithm.
of overall nodes death is clear from the figure.

Figure 4. Energy consumption among LEACH, LEACH-M, and LEACH-

Figure 2. Dead nodes over round of 300 x 300, among LEACH, LEACH- L over round of 300 x 300 versus the Proposed Algorithm.
M, LEACH-L versus the Proposed Algorithm.

44
 WCSIT 2 (2), 74 -78, 2012

VI. CONCLUSION
The wireless sensor network has a structure that needs a
specified energy balancing design and optimization.

It’s clear from our research that, the energy can be

optimized in clustering and managing the data transfer
across over all process. Energy management can be done by
typical distribution of nodes with respect to clusters and
optimal selection of the head of cluster.

This paper introduces and implements a new

methodology of clustering and managing the transfer
amount on the potential of each node and the overall
potential of each cluster, with varying cluster head over
time.

Figure 5. Energy consumption among LEACH, LEACH-M, and LEACH- The results show that the energy losses have been
L over round of 500 x 500. decreased and thus the life time of all nodes increased in an
interested amount. Hence, all nodes will be dead at the same
time which means that there is no data lose.

The use of fuzzy logic in clustering makes the system

design simpler and got better fast results, in addition to
minimizing the mathematics complexity of the system’s
design.
REFERENCES
[1] Fengjun Shang, Yang Lei, “An Energy-Balanced Clustering
Routing Algorithm for Wireless Sensor Network”, scientific
research, 2010.
[2] Yue Yafan; Zeng Dayou; Hong Lei , “Improving Fuzzy C-
Means Clustering by a Novel Feature-Weight Learning”, Dept.
of Fundamental Sci., North China Inst. Of Aerosp. Eng.,
Langfang ; Computational Intelligence and Industrial
Application, 2008. PACIIA '08. Pacific-Asia Workshop; Dec.
2008.
[3] N. Fan and Y. L. Song, “Improvement on LEACH Pro- tocol of
Wireless Sensor Networks,” Proceedings of 2007 International
Conference on Sensor Technologies and Applications,
Valencia, 2007, pp. 260-264.
Figure 6. Energy consumption among this paper over round of 500 x 500. [4] M. Ye, C. F. Li, G. Chen and J. Wu, “EECS: An Energy
Efficient Clustering Scheme,” 24th IEEE International
These figures show that the energy amount is extended Performance, Computing, and Communications Confer-ence,
over a longest time. Hence, the battery backup energy that Phoenix, 2005, pp. 535-540.
the sensors hold is constant in all approaches (this paper [5] Q. Cao, T. He and T. F. AbdelZaher, “uCast: Unified Con-
approach and the old approaches) then, the energy can nectionless Multicast for Energy Efficient Content Dis-tribution
in Sensor Networks,” IEEE Transactions on Parallel and
extend over a time instead of consuming it over a short Distributed Systems, Vol. 18, No. 2, 2007, pp. 240-250.
period. [6] V. Reddy R. Srinath and R. Srinivasan. “Cluster based secure
routing protocol for wsn”. In Third International Conference on
Networking and Services, page 45, Washington, DC, USA,
Figure 5 and 6 shows that this approach uses less energy 2007.
in time unit and thus, extends the total backup energy
holding in the sensor over the time.

47