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

Vol. 2, No. 1, January 2010

New Clustering protocol for increasing Wireless

Sensor Networks Lifetime
Ahmad Khadem Zadeh1, Ali Hosseinalipour2, Shahram Babaie3
1
Iran Telecommunication Research Center (ITRC)
Zadeh@itrc.ac.ir
2
Islamic Azad University- Tabriz, Iran
Ali.Hosseinalipour@yahoo.com
3
PhD students, Islamic Azad University, Olom VA Tahghighat Branch, Tehran, Iran
Sh.babaie@iaut.ac.ir

Abstract: Clustering in wireless sensor networks is one of LEACH protocol is produced. Section 3 consists of SEP
the crucial methods for increasing of network lifetime. protocol and in section 4 we provide novel protocol. In
There are many algorithms for clustering. One of the cluster section 5, simulation results were presented and finally in
based algorithm in wireless sensor networks is LEACH
part 6, conclusion will be discussed.
algorithm. In this paper we proposed a new clustering
method for increasing of network lifetime. The performance
of the proposed algorithm via computer simulation was 2. LEACH Protocol
evaluated and compared with other clustering algorithms.
LEACH protocol is hierarchical routing algorithm that can
The simulation results show the high performance of the
proposed clustering algorithm.
organize nodes into clusters collections. Each cluster
Keywords: Clustering, Lifetime, wireless Sensor Networks controlled by cluster head. Cluster head has several duties.
First one is gathering data from member cluster and
accumulates them. Second one is directly sending
1. Introduction accumulation data to sink. Used model in LEACH shows in
Recent progress in integrated circuits created a new tiny Figure 1. Third one is scheduling based of Time-Division
generation as a sensor that is cheap and economical. It has Multiple Access (TDMA). In that, each node in cluster
application in management of events, battlefield related to it's time slot could send collection data [1].
surveillance, recognition security, drug identification and
automatic security and space skill [3-5].
Because these sensors have a low battery lifetime, they
announced one-using, to this case, their lifetime was expired
when their energy finished. So energy is scarce source for
wireless sensor networks. We must manage accurate in right
use of energy for increasing sensor lifetime [2]. In wireless
sensor networks all of sensed data must send to base station
that called sink. Sending data to sink can accomplish both
event-driven or periodically.
In hierarchy network like Low-energy Adaptive Clustering
Hierarchy (LEACH) that network divided to separate
clusters that create from member nodes were selected for
clusters and high energy nodes as a Cluster Head (CH). Figure 1: The LEACH Network model
Sending data to sink is by this node. Random choosing of Cluster head announce time slot by uses of distribution
cluster heads in LEACH algorithm basis is probability in property to all members of cluster. Main operations of
some part of network haven't cluster head and other parts LEACH are classify in two separate phase that shows in
have cluster head with amount of density is high. Choosing figure 2 [1]. First phase or initialization phase has two
of cluster heads in this algorithm done randomly and it is process; clustering and cluster head determining. Second
probability low energy nodes was selected as cluster head. phase mean steady-state, that this phase concentrate to
gathering, accumulation and transmit data to sink.
Thus fault has a high probability. This problem was solved
by Stable Election Protocol (SEP) [6].
Proposed protocol that produced in this paper has two
advantages in comparison with LEACH and SEP algorithm.
In proposed method Clustering done balance and the best
node with respect to remained energy and distance of other
nodes in comparing with each that selected as a cluster
Figure 2: The LEACH protocol Phase
head.
The rest of this paper is organized as follows. Section 2
22
First phase as a compared with second one less overhead
impose to protocol. In initialization phase, at first in
choose of cluster head step, randomly allocate number
between zero and one for each node and then compared
with cluster head threshold. A node is chosen for cluster
head if its number is less than threshold. Threshold of
cluster head shows in relation 1.
 n ∉ G
G n ∈ G

Τ (n ) =  P

1 − P  r mod  1 
p  
  
Relation 1: The way of cluster head selection
relation
T (n): Threshold
P: node selection probability in every period
G: the set of unselected nodes
r: number of current period (started from one)
A node as a cluster head, announces new roles to the other
nodes. With this signal other nodes based on straight of
received signal decide to be membership of which cluster. In
every cluster, created time slot by cluster head based on
TDMA, distributed between cluster that contain visual time
slot for each member of cluster. Cluster head use Code-
Division Multiple Access (CDMA) technique too. With
completion of initialization phase, steady-state phase start.
In this phase, nodes in determining time slot, gather data
and sending to the cluster head node. Meanwhile gathering
of data is periodically.
3. SEP Protocol
SEP protocol was improved of LEACH protocol. Main aim
of it was used heterogeneous sensor in wireless sensor
networks. This protocol have operation like LEACH but
with this difference that, in SEP protocol sensors have two
different level of energy. Therefore sensors are not
homogeneous. In this protocol with suppose of some
sensors have high energy therefore probability of these
sensors as cluster head will increased. But in SEP and
LEACH, cluster heads aren’t choose base of energy level
and their position. This is main problem of these methods,
so their operations are static.
4. The Proposed Protocol
In LEACH and SEP Protocol, because of accidentally
choosing cluster head, in some part of network don’t have
cluster head and the other parts have cluster head with
high density is probability. In new algorithm clustering is
done as symmetrical. Also with regard of remaining
energy and distance of nodes, the best node is selected as a
cluster head. We show details of algorithm in below.
Suppose that nodes with determined characteristics are
distribute in environment and simultaneously of
distribution nodes accidentally, we set two NodeA, NodeB
in network with specific characteristic determining only
for other nodes position, also sink characteristic is
specific. After formation of network, nodes sending signal
to NodeA, NodeB and sink simultaneously. NodeA,
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 1, January 2010
NodeB and sink with regard of straight received signal,
distance of each node with these three points are
determined. NodeA, NodeB and sink has table that consist
of information about all nodes. Fields table has number of
nodes and distance of each node to others and etc. After
that NodeA and NodeB full of distance to other nodes in
these fields that send their tables to sink for updating sink
table that shows in table 1.
Table 1: Network information
Probability of cluster heading
Distance with NodeA
Distance with NodeB
Node COORDINATE
Distance with node i
Distance with Sink
Initial energy
Node No.
nj a j bj c j (x j , y j ) di, j 0.5J 0.5
j: Number of nodes.
a j : Distance between NodeA and node n j .
b j : Distance between NodeB and node n j .
c j : Distance between Sink and node n j .
( x j , y j ) : Node coordinator in network environment.
di, j : Distance between nodes nj and node ni .
Now we could determine characteristic of each explained
approach nodes. For example we calculate characteristic of
node D in figure 3. Assume that characteristic of
sink=(x1,y1), NodeA=(x2, y2) & NodeB = (x3, y3).
We want to acquire node D that has distance from sink,
NodeA, NodeB are certain quantity a, b, c.
Assume characteristic of node D is D = (x4, y4). We know
that distance between D and sink is formula 1.
D − Sink = ( x4 − x1)2 + ( y4 − y1)2 = a K(1)
Obtain square and writing of formula 1 for 3 point of three
equation system.
(x4 − x1 )2 + ( y4 − y1 )2 = a 2 K (2)

(x4 − x2 ) + ( y4 − y2 ) = b K (3 )
2 2 2

(x4 − x3 ) + ( y4 − y3 ) = c K (4 )
2 2 2
With explanation of above formula we obtain new formula
that with subtracted formula 3 from formula 4; we have x4
equal to formula 5.
a2 − b2 − x12 + x22 − y12 + y22 − 2 y4 ( y2 − y1 )
x4 = K (5)
2( x2 − x1 )
With putting quantity of x4 in formula 2 and after setting
coefficients of y4 equal powers, we have second degree
equation, that solving it cause create two points are
marked & with putting those in formula 1, two correct
points as an answer were selected. These calculations are
done for all of nodes in sink and characteristics of every
node save in the table. Now, with these characteristic we
could calculate distance of every node from each other and
saved to the same table.
 (IJCNS) International Journal of Computer and Network Security, 23
Vol. 2, No. 1, January 2010

Then, circumference in comparing with area network and
number of sensors divided to equal parts as shows in
figure 3. Each part forms a cluster. Because of that
division a sensor in specific condition to happen on
horizontal line, vertical line or both of them probably; so
we assume three conditions: 1-if sensor is coming in
horizontal line, assumed it member of bottom square. 2-If
it coming in vertical line, we assumed it member of left
square. 3-if it coming in both vertical and horizontal lines,
we suppose it member of left bottom square.
Eni : The ni remained energy.
(x j , y j )
pn i
: the probability of node ni for cluster head.
Note that distance of each node with itself is zero. With
above criterions, some nodes were select as cluster head,
and then cluster head give a time period to member nodes
so every node could send sensed data in its time slot.
Cluster heads after received gathering data from members
send to sink. After ending of period we choose cluster
head for cluster.

5. Simulations Result
We simulate wireless sensor network in area dimension
100*100 with monotonous distribution of one hundred
sensors in MATLAB software randomly. This distribution
shows in figure 5. In this simulation sink placed at the end
of area and NodeA and NodeB proposed with specific
characteristics. We considered every sensors has Initial
energy equal 0/5 Jul. we assume a period of simulation for
1000 cycle and used energy that calculated on the basis of
table 2.

Figure 3: Clustering of nodes

Thus all of the sensors that will be are member of one
square and each square assume is a cluster & choose for
them cluster head.
First we obtain probability of cluster head.

Figure 5: Clustering of nodes

Table 2: used Radio characteristics in our simulations
Operation Energy Dissipated
Transmitter/Receiver Electronics Eelec=50nJ/bit
Figure 4: Cluster Head selection from distance and Data Aggregation EDA=5nJ/bit/signal
remain energy of nodes Transmit Amplifier
Єƒs=10pJ/bit/m2
For this, we acquire average of each node distance from if dmaxtoBS ≤ d0
each other in same cluster from formula 6 and then we put Transmit Amplifier
єmp=0.0013pJ/bit/m4
obtained number from each node in formula 7, so acquire if dmaxtoBS ≥ d0
cluster head probability. For example, we could find In new protocol clustering is done symmetrically. In this
cluster head in figure 4. protocol probability of one sensor be cluster head depends
n

(6)
∑d j
→ (7) P Eni on energy level, distance and density of sensors. But in
mni =
j =1
ni = LEACH and SEP protocol this probability is static and was
n mni
not on the basis of position and energy level of nodes in
n : Number of cluster node network. Simulation result shows that proposed protocol
n has better performance in comparison with LEACH and
∑d
j =1
j
: Sum of node distance with other nodes in same
SEP protocols also can increase network lifetime
significantly. Figure 6 shows the simulation results.
cluster.
ni i th
: Node. 6. Conclusion and Future Work
m ni
: The ni node average distance with other cluster. Finally after simulating we conclude that proposed
nodes. protocol can increase network lifetime and observation of
24 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 1, January 2010

the first dead sensor in network can be delayed in

comparison with SEP protocols 30 percent, in comparison
with LEACH 37 percent. Figure 6 shows that from
observing the first dead sensor until the death of 90
percent of sensors last 200 period of time, so we have over
20 percent improvement.
500

400

300
life tim e

200

100

0
0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200

-100
period

LEACH SEP NEW PROTOCOL

Figure 6: Comparison of clustering protocols

Although in this protocol we didn’t use GPS in sensors –
energy consuming of these sensors are so much, so their
lifetime is less – but we could find geographical position
nodes so easily. It’s clear that if geographical position
specified, sensor routing has done easily, confidently and
quickly.
In future paper we will increase network lifetime and
fault-tolerance with putting high power sensors as a
gateway between cluster head and sink.

Reference
[1] Kazem Sohraby, Daniel Minoli, Taieb Znati " Wireless
Sensor Networks Technology, Protocols, and
Applications" Published by John Wiley & Sons, Inc.,
Hoboken, New Jersey. Published simultaneously in
Canada.2007.
[2] Gaurav Gupta, Mohamed Younis "Fault-Tolerant
Clustering of Wireless Sensor Networks"2003 IEEE
[3] Yongxuan Lai, Hong Chen "Energy-Efficient Fault-
Tolerant Mechanism for Clustered Wireless Sensor
Networks" 2007 IEEE.This work is supported by the
National Natural Science Foundation of China under
Grant.
[4] Ameer Ahmed Abbasi, Mohamed Younis, Saudi
Arabia "A survey on clustering algorithms for wireless
sensor networks" Computer Communications
30(2007)2826-2841 WWW.ScienceDirect.com
[5] Piyakul Tillapart, Sanguan Thammarojsakul,
Thanachai Thumthawatworn, Pratit Santiprabhob”An
Approach to Hybrid Clustering and Routing in
Wireless Sensor Networks” 2005 IEEE.
[6] Georgios Smaragdakis Ibrahim Matta Azer Bestavros”
SEP: A Stable Election Protocol for clustered
heterogeneous wireless sensor networks” Technical
Report BUCS-TR-2004