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

Vol. 2, No. 4, April 2010

New Power Aware Energy Adaptive protocol with

Hierarchical Clustering for WSN
Mehdi Golsorkhtabar1, Mehdi Hosinzadeh2, Mir Javad Heydari1, Saeed Rasouli1
1
Islamic Azad University, Tabriz Branch, Department of Computer Engineering,
Tabriz, Iran
{m.golsorkhtabar;m.heydari;s.rasouli}@iaut.ac.ir
2
Science and Research Branch, Islamic Azad University,
Tehran, Iran
hosseinzadeh@srbiau.ac.ir

Abstract: In recent years, progress in wireless communication

has made possible the development of low cost wireless sensor
networks. Clustering sensor nodes is an effective topology
control approach. In this paper, we propose a new routing
algorithm which can increase the network lifetime. We assume
that each node can estimate its residual energy and then a new
clustering method will be proposed for increase of network
lifetime. This assumption is similar to many other proposed
routing algorithms for WSN and is a possible assumption. In the
new algorithm, the predefined numbers of nodes which have the
maximum residual energy are selected as cluster-heads based on
special threshold value first and then the members of each
cluster are determined based on the distances between the node
and the cluster head and also between the cluster head and base
station. At last, the simulation results show that our method
achieves longer lifespan and reduce energy consumption in
wireless sensor networks.
Keywords: wireless sensor networks; clustering algorithm;
energy adaptive; network lifetime
1. Introduction
Wireless Sensor Network (WSN) comprises of micro
sensor nodes, which are usually battery operated sensing
devices with limited energy resources. In most cases,
replacing the batteries is not an option. [1-2].
Wireless sensor network, usually, are heterogeneous. The
protocols should be design for the typical of heterogeneous
wireless sensor networks. Most of the clustering algorithms
are designed for homogeneous wireless sensor networks and
they are not optimized when network's nodes is in
heterogeneous state such as [3-4].
In this paper, we propose and evaluate PEAP, (new Power
aware Energy adaptive Protocol with hierarchical clustering
for WSN). In considered wireless sensor network, nodes
send sensing information to a cluster-head and then the CH
transmit data to base station. The certain clustering
algorithms with special method periodically electing cluster-
heads then cluster-heads aggregate the data of their cluster
nodes and send it to the base station. We assume that all the
nodes of the network are spread heterogeneous, at first all
nodes battery power is equal, all sensor nodes have limited
energy and the base station is fixed and not located between
sensor nodes and most of them are static and only a few are
mobile.
2. Related work
In recent years, many protocol and algorithm for clustering
have been proposed. Usually there are many differences
between CH selection and clustering organism. But
generally some of these clustering schemes applied in
homogeneous networks and some others clustering
algorithms applied in heterogeneous networks. Therefore,
most of the current popular clustering algorithms are not
fault tolerant, such as LEACH [3], PEGASIS [4] and HEED
[5].
LEACH is the most popular clustering algorithm. Many of
CH selection algorithms are based on LEACH’s
architecture. [6] is proposed to elect the CHs according to
the energy remaining in each node. We call this clustering
protocol LEACH-E. In the rest of this section, we review
LEACH algorithm and discuss its limitations, because
LEACH is very popular in wireless sensor network
clustering protocols.
2.1 LEACH (Low Energy Adaptive Clustering
Hierarchy)
In LEACH protocol, energy efficiency are achieved by
being CH in turn, and then distributing impartially the total
networks energy to unique node, thus lowing energy
consuming and increasing network lifespan. CH election
depends on the whole numbers of CH in networks and times
that nodes have been CH until now. Principles scenarios for
this protocol are:
• The base station fixed in nowhere near of the sensor
nodes.
• All the nodes in the wireless sensor network have the
same initial battery power and are homogeneous in all other
ways.
In first phase, algorithm chooses a node stochastically,
the principal will be explained in the following: all sensor
nodes compute a value T(n ) according to the following
formula at the beginning of all rounds:
 p
 n∈G
T (n) = 1 − p(r mod(1 p )) (1)
0
 others
Where in this equation P describes desired percentage of
 (IJCNS) International Journal of Computer and Network Security, 39
CHs (e.g. P=0.05) current round, and G is the set of nodes
that have not been CH in the last 1/P rounds, r is the
number of the current round.
For each node, a random number between 0 and 1
is generated. If this random number is less than T(n ) , this
sensor node will become a cluster head in this round and
broadcast an advertisement message to other sensor
nodes near it.
When each node has elected as cluster head itself for the
current round broadcasts an advertisement message to the
rest of the nodes in the network. All the non-cluster head
nodes, after receiving this advertisement message, decide on
the cluster to which they will belong for this round. This
decision is based on the received signal strength of the
advertisement messages. After cluster head receives all the
messages from the nodes that would like to be included in
the cluster and based on the number of nodes in the cluster,
the cluster head creates a TDMA schedule and assigns each
node a time slot when it can transmit [3].
Despite many advantages in using of the LEACH protocol
for cluster organization, CH selection and incising network
lifetime, there are a few features that the protocol does not
support. LEACH assumes nodes power energies
homogeneously. In a real, wireless sensor networks
scenario, sensor nodes energy spread in heterogeneous
manner.
3. The New Protocol
In this section, the details of PEAP are introduced. The
major application of a wireless sensor network is to
monitoring of a remote environment. Data of individual
nodes are usually not very important. Since the data of
sensor nodes are correlated with their neighbor nodes, data
aggregation can increase reliability of the measured
parameter and decrease the amount of traffic to the base
station. PEAP uses this observation to increase the efficiency
of the network. In order to develop the PEAP, some
assumptions are made about sensor nodes and the
underlying network model. For sensor nodes, it is assumed
that all nodes are able to transmit with enough power to
reach the BS if needed, that the nodes can adjust the amount
of transmit power, and each node can support different
Medium Access Control (MAC) protocols and perform
signal processing functions. These assumptions are
reasonable due to the technological advances in radio
hardware and low-power computing [3]. For the network, it
is assumed that nodes have always data to send to the end
user and the nodes located close to each other have
correlated data.
Such as LEACH, in first phase, PEAP chooses a node
stochastically, , the principal will be explained in the
following: all sensor nodes compute a value T(n )
according to the following formula at the beginning of all
rounds.
E  En _ current 
 n _ current 
T(n) = p* * 1 −  (2)
 E  E n _ max 
 n _ max  
Vol. 2, No. 4, April 2010
Where in this equation P = the desired percentage of CHs
(e.g. P=0.05) the current round, and En_current is the current
energy and En_max the initial energy of the node, with r s as
the number of consecutive rounds in which a node has not
been CH. Thus, the chance of node n to become cluster head
increases because of a higher threshold. A possible blockade
of the network is solved. Additionally, r s is reset to 0 when a
node becomes CH. Thus, we ensure that data is transmitted
to the base station as long as nodes are alive [6].
Our clustering model is based on confidence value
associated with broadcast from CHs. Confidence value of a
CH is a function of some parameters (1) distance between
the CH, the node and (2) the CH current battery power and
(3) number of nodes already were a member of this CH.
Basically, our model checks first if, with the current battery
power the CH has, it would be able to support the current
members at maximum data broadcast rate. A node decides
to join a CH if the head can still support the node with its
rest power. Confidence value given by:
Cv (i) = Bp
(3)
Cm* Dc
Where in this equation BP is the battery power of given
node, Cm is number of nodes already a member of given CH,
Dc is distance between the CH and the node.
Like LEACH, in order to reduce the probability of
collision among joint-REQ messages during the setup phase,
CSMA (Carrier Sense Multiple Access) is utilized as the
MAC layer protocol. When a cluster head has data to send,
it must sense the channel to see if anyone else is
transmitting using the BS spreading code. If so, the cluster
head waits to transmit the data. Otherwise, the cluster head
sends the data using the BS spreading code [3].
4. Simulation Results
In order to evaluate the performance of the PEAP protocol,
the simulator, specific to the needs of our model, was coded
in PHP with Apache HTTP server version 2.2 and uses
PHP/SWF Charts for its graphical needs.
We assume a simple model for the radio hardware energy
dissipation where the transmitter dissipates energy to run
the radio electronics and the power amplifier, and the
receiver dissipates energy to run the radio electronics, as
shown in Fig. 1. For the experiments described here, both
the free space (d2 power loss) and the multi path fading (d4
power loss) channel models were used, depending on the
distance between the transmitter and receiver [7]. Power
control can be used to invert this loss by appropriately
setting the power amplifier. If the distance is less than a
threshold do, the free space (fs) model is used; otherwise, the
multi path (mp) model is used. Thus, to transmit l-bit
message a distance, the radio expends
lEelec +lεfsd 2 , d <do
ETx(l,d) = ETx-elec (l ) + ETx-amp (l, d ) =  (3)
lEelec +lεmp d ,
4
d ≥do
And to receive this message, the radio expends:
40 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 4, April 2010

Fig. 3 presents the number of nodes dead when using of

ERx (l) = ERx - elec (l ) = lEelec (4) clustering protocols. This result is closely related to the
network lifetime of the wireless sensor networks.

The electronics energy, Eelec, depends on factors such as

the digital coding, modulation, filtering, and spreading of
the signal, whereas the amplifier energy, εfsd2 or εmpd4,
depends on the distance to the receiver and the acceptable
bit-error rate.
We consider a wireless sensor network with N=100 nodes
randomly distributed in a 300m * 300m field. We assumed
the base station to be fixed and located at the origin (0, 0) of
the coordinate system. The radio parameters used in our
simulations are shown in Table (1).

Figure 3.Total nodes transmitting (N= 100).

Figure 1.Total nodes transmitting (N= 100).

5. Conclusion
In wireless sensor networks, the energy consumption and
the network lifetime are important issues for the research of
Table 1: Parameters used in simulations
the route protocol. This paper introduces PEAP, a new
Parameter Value power aware energy adaptive protocol with hierarchical
Eelec 50 nJ/bit clustering for wireless sensor networks that distributes loads
among more powerful nodes. Compared to the existing
ε£s 10 pJ/ bit/m2
clustering protocols, PEAP has better performance in CH
εmp 0.0013 pJ/bit/m4 election and forms adaptive power efficient and adaptive
E0 3J clustering hierarchy. The simulation results presented that
PEAP significantly improves the lifespan and the energy
EDA 5 nJ/bit/message consumption of the wireless sensor networks compared with
d0 70 m existing clustering protocols. Further directions of this study
will be deal with clustered sensor networks with more than
Message size 8192 bits
three parameters with in threshold calculating and more
parameters to confidence value calculating.
Fig. 2 present the energy consumption of the clustering
protocols when the amount of nodes spread in network is
100. The x-axis indicates the number of rounds while y-axis
References
indicates the mean residual energy of each node. The results [1] C. Buratti, A. Conti, D. Dardari,R. Verdone, “An
demonstrate that the energy consumption of our algorithm is Overview on Wireless Sensor Networks Technology
and Evolution” , Sensors 2009, 9, 6869-6896;
generally smaller than LEACH and LEACH-E. doi:10.3390/s90906869.
[2] I. F. Akyildiz, W. Su, and Y. Sankarasubramaniam, “A
survey on sensor networks”, IEEE Communications
Magazine, 2002, 40(8), pp.102-114.
[3] W.R. Heinzelman, A.P. Chandrakasan, H.
Balakrishnan, “An application-specific protocol
architecture for wireless microsensor net- works”,
IEEE Transactions on Wireless Communications 1
(4) (2002) 660–670.
[4] S. Lindsey, C.S. Raghavenda, “PEGASIS: power
efficient gathering in sensor information systems”,
Proceeding of the IEEE Aerospace Conference, Big
Sky, Montana, March 2002.
[5] O. Younis, S. Fahmy, “HEED: A hybrid, energy-
efficient, distributed clustering approach for ad hoc
sensor networks”, IEEE Transactions on Mobile
Computing 3 (4) (2004) 660–669.
[6] M.J. Handy, M. Haase, D. Timmermann,“Low energy
clustering hierarchy with deterministic cluster head
selection”, Proceedings of IEEE MWCN, 2002.
[7] T. Rappaport, Wireless Communications: Principles &
Figure 2.Total network energy (N= 100) Practice. Englewood Cliffs, NJ: Prentice-Hall, 1996.