International Journal of Review in Electronics and Communication Engineering

Volume 3, No 6 December 2015

ZEEHC: Zone-Based Energy Efficient Hierarchal

Clustering Protocol for Wireless Sensor Networks
Ramandeep Kaur1, Nitin Mittal2
1
Student, 2Assistant Professor,
1,2
Chandigarh University,Gharuan
1
Ramandeepk52@gmail.com, 2Mittal.nitin.84@gmail.com
Abstract Wireless Sensor Network (WSN) is an emerging
technology with potential applications in the field of habitat
monitoring and industrial applications. Sensors monitor the
changes in a physical attribute of the surroundings such as
temperature and observe the collected data and transmit it to the
base station (BS). These sensors are mostly unattended, and their
limited battery life makes energy a precious resource that must
be utilized wisely. It is necessary to maintain the sensor network
for longer duration of time in an energy-efficient manner for
collection information. Hence, it is incessantly fascinating to
design protocols that prolong the network lifetime and which are
energy efficient protocol. This paper proposes a protocol refer to
as zone based energy efficient hierarchal clustering (ZEEHC)
protocol that splits the network into small zones and increases
lifetime of network. Multi-hop communication between CHs to
ZHs to base station is introduced to obtain minimum energy
consumption. Further, the results reveal that the proposed
algorithm considerably outperforms existing algorithm in terms
of energy optimization and system network.
Keywords: Clustering, SEECH, ZEEHC, Network lifetime,
Residual energy, WSN.

I. INTRODUCTION
WSN is basically a collection of wireless nodes with
limited energy capabilities that may be static or dynamic and
are placed randomly on an energetically varying environment.
The routing strategies selection is a vital problem for the
efficient delivery of the packets to their destination.
Additionally in such networks, the applied routing strategy
must ensure the minimum energy utilization in order to
maximize the network lifetime [1].
First WSN was implemented in the middle of the 70s by
the military and defense industries. During the Vietnam War,
WSN is used in order to bear the detection of enemies in
remote jungle areas. But their implementations had many
drawbacks including the large sensor size and higher energy
utilization and the limited network capability. Therefore a
large amount of work on the WSNs field has been taken out
resulting in the improvement of the WSNs on a large variety
of applications and systems with hugely varying requirements
and characteristics. In the mean time, various energy-efficient
routing protocols have been implemented and developed for
WSNs in order to maintain efficient data delivery to their
destination. As a result, each energy-efficient routing protocol
may have particular characteristics depending on the
application and network architecture.
Routing protocols are one of the hub technologies in the
WSN. Routing is a complete challenge in WSN [2], due to its
intrinsic characteristics. Clustering is a well-know and
generally used tentative data transmission technique, and is
mainly useful for such applications that require scalability to
hundreds or thousands of nodes [3]. In clustering protocols,
the entire network is subdivided into clusters having cluster
http://ijrece.org

e- ISSN: 2321-3159

members (CMs) and one cluster head (CH). All CMs transmit
their sensed data to CH and CH is responsible for long run
data transmission from cluster to BS. In this way, the energy
consumption using clustering approach is much lower than the
direct transmission. However, in clustering due to overburden
at the CH due to long transmission of data, CHs die out earlier.
In this paper, we propose a Zone based Energy Efficient
hierarchal Clustering (ZEEHC) protocol to maintain the
energy utilization among all nodes. The WSN is divided into
equal size of zone. ZEEHC helps to improve the network
lifetime with low utilization of energy in the WSNs. The
clustering protocols are actually contains cross layering
techniques for scheming energy efficient hierarchal WSNs
[12] where the sensor nodes that belong to a CH and gives
their data to a nearest node to their cluster called CH and then
CH elected the useful data and gives aggregate data to the
relay node in the zone. The aggregated data is then transmitted
to BS by relay node using multi-hop communication. The
clustering schemes can raise network lifetime and better
energy efficiency by decreasing all of the energy consumption
and maintaining utilization belonging the nodes during the
network lifetime [13],[14]. The clustering based protocols are
explained according to the schemes they accept to select
cluster heads as well as communicating the aggregate
information to the base station.
II. RELATED WORK
To transmit gathered information to the BS some protocols
uses single-hop communication and some protocols uses
multi-hop communication. During communication single-hop
communication observed a high quantity of energy and energy
maintaining of nodes in the network may be nodes are farther
to the BS contains large energy due to relation among needed
energy to transmit the information and distance among source
and destination. On other hand, multi-hop scheme also occur
due to energy unmaintained. In this approach the nodes which
are closer to BS have larger traffic load which occur due to
degrading the energy rapidly.
There are many different types of energy efficient
clustering protocols designed among cluster based network
frame. The LEACH[11] protocol defines energy utilization is
same in all the nodes during selection of cluster heads and
non-cluster heads as well as all non-head clusters gives their
data to nearest cluster head. In LEACH protocol cluster head
(CH) decision basically depend on the percentage of CHs for
the network (resolute on priori) and the number of time that
node has been CH so far. This evaluation is taken by the node
n by selecting a random number between 0 and 1.If the
selected number is less than a threshold T (n) ,the node
become Ch for the current round. The Threshold [6, 9] is as:

p- ISSN: 2321-3140

Page 114

Ramandeep Kaur, et al International Journal of Review in Electronics and Communication Engineering [Volume 3, Issue 6, December 2015]
protocol performance using simulation results and finally
section concludes the paper.
The cluster head forward the accumulated data to the sink
or destination. The HEED protocol using a multi-hop
communication scheme in which cluster head selects
according to the residual energy as well as lower power stage
required by a node to transfer the information with its cluster
head and cluster head gives their data to base station [10]. In
EECS, aggressive allotment of clusters takes place which is
established on cluster distance from the main station. The
conclusion is an innovation that dwelling the obstacle that
clusters at a highest distance from the sink lack more power
for communication than those that are nearest. Basically it
contribute same dissemination of power in the networks,
appear in network lifetime. SEECH is a scalable energy
efficient clustering hierarchical protocol which employs a
hierarchal clustering. In SEECH, divide area into three regions
as well as all the nodes are randomly deployed in a given
regions. After that we calculate degree of nodes(degree means
distance between each node according to region).If the
probability of tentative cluster head ( ) and relay head ( )
is less than random value on the basis of degree of node
(nodes with larger degrees are more appropriate choices for
cluster head and relay head ) select as tentative cluster head
and relay head. If the probability of tentative cluster head and
relay head is greater than random value than calculate the
score of all nodes (score is defined as product of distance of all
the nodes from their respective cluster head and relay head)
and nodes having minimum score select as actual cluster head
and relay head. SEECH is a scalable energy efficient
clustering hierarchical protocol which employs a hierarchal
clustering. In SEECH, divide area into three regions as well as
all the nodes are randomly deployed in a given regions. After
that we calculate degree of nodes(degree means distance
between each node according to region).If the probability of
tentative cluster head ( ) and relay head ( ) is less than
random value on the basis of degree of node (nodes with larger
degrees are more appropriate choices for cluster head and
relay head ) select as tentative cluster head and relay head. If
the probability of tentative cluster head and relay head is
greater than random value than calculate the score of all nodes
(score is defined as product of distance of all the nodes from
their respective cluster head and relay head) and nodes having
minimum score select as actual cluster head and relay head.
Eresi Eav (1 )
0

else

pctot =

(1)
(2)

Eresi Eav (1 )
0
prtot =

else

III. ENERGY DISSIPATION RADIO MODEL

We assume a simple model shown in Fig.1. 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.
For the experiments described here only the free space channel
model is used. Thus, to transmit an l-bit message a distance d,
the radio expends energy:
(l,d) = (l

k-bit
messag
e

(6)

Trans
mitter
Circui
try

Trans
mitter
Ampli
fier

Recei
ver
Circui
try

k-bit
messag
e

IV. ZEEHC PROTOCOL

In ZEEHC, area divided into zone and distributing the
nodes in network area, ZEEHC starts working. Our work is
based on the protocol SEECH can be extended to an enhanced
version of SEECH. Basically, we present a technique to grow
energy dissipation and long life of the network. Therefore, the
subsequent changes have made the energy hierarchy scalable
clustering protocol (SEECH) to improve the adaptability and
better the network lifetime.
1.

(4)

e- ISSN: 2321-3159

(5)

(l) = l

http://ijrece.org

d2)

To receive this message, the radio expends energy:

(3)

The remainder of this paper is presented as follows:

Section 1 describes the SEECH protocol. Section 2 describes
network model and assumptions. Section 3 describes the
ZEEHC protocol in detail and Section 4 evaluates the ZEEHC

+l

Model Architecture and Basic Assumptions

Number of nodes is 100, 400, 1000 in the network for
three scenarios.
Homogenous network consist by WSN.
The BS is situated outside WSN.
Sensor nodes have same initial energy.
All sensor nodes are stationary but BS is not
stationary.
All nodes can forward data to ZH.
Data compression is done by ZH.
In first node, exclusive node has probability p of
becoming the ZH.
Nodes which have maximum energy in previous
round become tentative relay.
Nodes which have minimum distance in previous
round become RH.
Energy for transmission and reception is same for all
nodes.
Energy of transmission depend on the distance
(source to destination) and residual energy.

p- ISSN: 2321-3140

Page 115

Ramandeep Kaur, et al International Journal of Review in Electronics and Communication Engineering [Volume 3, Issue 6, December 2015]
2. Proposed Algorithm.
The flowchart for the operation of ZEEHC is shown in Fig.
1. In this, each round repeats periodically having different
phases, as follows:
Phase I Setup Phase: Network is practically separated into
4 zones. Each node generates a random probability(P) at
produce the initation of round and calculate the threshold
value T(n). New node check the energy of all nodes.The node
having maximum energy in previous round elect as RN(relay
node) and check the minimum distance from the BS. After that
the energy of new node in previous round is not equal torelay
node and having minimum distance from BS elect as ZH(zone
head).

16. If (Energy of New node = max. energy of Previous

round )
17. Normal Node relay Node ;
18. If (New node Distance from B.S < Previous ZH
node Distance from B.S )
19. Normal Node
New Node ;
20. end if
21. end if
22. end while
23. // ZH aggregate data sends direct from Node

to the data and send to zone relay node

24. Relay node tx. data to BS using multi-

hopping to other relays.

25.
26.
27.
28.
29.

In the steady-state phase:

After the completion of zone selection process, each
member sends its data and residual energy to the ZH. The ZH
maintains residual energy information of all the member nodes
and further send it to RN.

// check for alive and dead node

If(Energy of node < 0)
Dead node =dead node +1;
end if
Total Alive node = Alive node dead;

V. PERFORMED EVALUATIONS AND RESULTS

Phase I1 Pre-Setup Phase: The relay node sends BS the
maximum residual energ value of nodes beloginig to its our
cluster when the last frame of round completes. BS finds the
maximum residual energy of the network and send back this
value to all ZH nodes in the network. ZH node further send the
highest value to all cluster nodes. Exclusive node save the
value of maximum residual energy for the next competition of
T(n) and the current round is completed.
100
90

In this paper we constraints on energy efficiency. To

evaluate protocol from energy efficiency we employed
lifetime criterion. There are many different kinds of definitions
for lifetime in literature. The simulation model and programs
are developed by MATLAB tool. The proposed scheme is
zone based energy efficiency protocol that improve network
lifetime in three different scene1, scene 2,scene 3.The
performance of ZEEHC is compared to SEECH protocol in
three scenarios with different sizes; small, medium and large.
TABLE 1 defines the parameters of proposed scenes in details.
1.

Simulation Parameters

80

Table 1: Simulation Parameters

70

y-axis(m)

60
50

BS

Parameter

Scene 1

Scene 2

Scene 3

Area

100 100

100 100

200 200

40

No. of Nodes

30

0.5J

20

Radio electronics
energy,
=

10
0

100

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.

20

40

60
80
x-axis(m)

100

120

140

No. of zones=n
Divide into for equal zone
for (zone=;zone>=n; zone++)
Deploy sensor node each Zone
end for
While (normal node = dead node)
// Relay selection
For (zone=;zone>=4;zone++)
If (check node for Maxi. Energy in Previous node)
Tentative relay node
New Node
If (New node Distance from B.S is mini. Previous
round )
Relay Node
New Node
end if
end if
// Selection of Zone head

http://ijrece.org

e- ISSN: 2321-3159

Radio
amplifier
energy,
Radio
amplifier
energy,
Energy for dataaggregation,
Data packet size

400
0.5J

1000
1J

50nJ/bit
10 pJ/bit/
0.0013
pJ/bit/
5 nJ/bit/signal
4000 bits

2. Simulation Results
Energy efficient WSN deployment is not an easy task due
to the large number of parameters i.e. energy parameters, then
selecting the CH for the transmission process and their data.
MATLAB programming platform is used to encode the
SEECH and ZEEHC Ultimately, the comparative performance
of each algorithm is explained. The performance of ZEEHC
p- ISSN: 2321-3140
Page 116

Ramandeep Kaur, et al International Journal of Review in Electronics and Communication Engineering [Volume 3, Issue 6, December 2015]
-4

x 10

4.3
4.2

Energy Consumption

protocol is explained in terms of network lifetime and stability

period space (the time internal or the rounds before first node
dead) against the SEECH protocol.
In this subsection is shown a comparison of the number of
alive nodes in scene 1, scene 2, and scene 3 for SEECH
Protocol and ZEEHC Protocol is presented. The CH
distribution is needed in clustered WSN application. The intracluster delay is maximum and proportionate to the size of the
biggest cluster therefore maintaining cluster avoid increase of
delay and avoid large-distant communication between CH and
cluster member. To measure the quality of distribution for
CHs we use energy dissipation.

A. Energy Consumption

4.1
4
3.9
3.8
3.7

-4

SEECH
ZEEHC

3.6

x 10
4.4

500

1000

1500

2000

2500

Round

Energy consumption of protocol for scene 3

4.2

B. Alive nodes
4.1

Alive nodes are those nodes whose battery is not

completely depleted. The evaluated results are shown below:

100

3.9
90

3.8

80

3.7

SEECH
ZEEHC

3.6
500

1000

1500

2000

2500

Round

Energy consumption of protocol for scene 1

Number of Nodes Alive

Energy Consumption

4.3

70
60
50
40
30
20
SEECH
ZEEHC

10

-4

x 10

4.4

500

1000

1500

2000

2500

Round

4.3

The lifetime evaluation of protocol for scene 1

400

4.1

350

300

Number of Nodes Alive

Energy Consumption

4.2

3.9
3.8
3.7

SEECH
ZEEHC
500

1000

1500

2000

2500

Round

150
100
SEECH
ZEEHC

500

1000

1500

2000

2500

Round

Energy consumption of protocol for scene 2

http://ijrece.org

200

50

3.6
0

250

e- ISSN: 2321-3159

The lifetime evaluation of protocol for scene 2

p- ISSN: 2321-3140

Page 117

Ramandeep Kaur, et al International Journal of Review in Electronics and Communication Engineering [Volume 3, Issue 6, December 2015]
5000

900

4000
Rounds

1000

Number of Nodes Alive

800
700

3000
2000

ZEEHC

1000

SEECH

600
500

400

FND

300

LND

Scene 2

200
SEECH
ZEEHC

100
0

AND

500

The lifetime of ZEEHC in Scene (2)

1000

1500

2000

2500

Round

5000
The lifetime evaluation of protocol for scene 3

4000
Rounds

C. Network Lifetime:
When any node in the network is dead, it is no longer the
part of that network. This implies that if a dead node occurs in
early rounds of algorithm, it will affect the network. This may
also lead towards the early dead of all the nodes in the
network. In this simulation we have observed the first dead
node by keeping the base station position at (100,200) with
4000 packet size. Table 2 shows the values and Fig. 3
concludes that ZEEHC is better compared to LEACH
protocol.

Scene 2
(400 Node)
Scene 3
(1000
Node)

LND

Scene 3
The lifetime of ZEEHC in Scene (3)

SEECH

REFERENCES

LND
1220
2320
1702
2406
1921

ZEEHC

2045

2368

2786

4000
3000
Rounds

AND

ZEEHC

AND
1248
2066
1562
2105
1710

The lifetime of ZEEHC in Scene 1,Sene 2, scene 3,

2000
1000

[1]

0
LND

[2]

Scene 1
The lifetime of ZEEHC in Scene (1)

http://ijrece.org

SEECH

In Smart Space and Extreme environment intensity-aware

distributed sensor monitoring and data clustering is relevant to
save power. In WSNs, the important design issues in the
research of routing protocols are energy utilization and
network lifetime. A major challenge is to high the stability
period in order to preserve the coverage area. In this paper, as
a zone three layers based intensity efficient hierarchy Protocol
(ZEEHC) clustering was proposed the member nodes where
the network nodes, cluster heads and relay head categorized.
ZEEHC proposed protocol is a simple message of low
overhead approach for periodic information accumulated
applications in harsh and remote environments that extend
network lifetime more than SEECH protocols where network
longevity studied three scenarios. The simulation results
showed that ZEEHC protocol, the web of life is better than
SEECH. Also results showed that suits ZEEHC used for large
scale networks, which is a relevant issue for space and degree
of use. Simulation results demonstrated that for ZEEHC
protocol, the network lifetime is 13%, 38%, 54% better than
SEECH protocol.

FND
832
1163
1138
1568
1479

AND

1000

VI. CONCLUSION

Protocol
SEECH
ZEEHC
SEECH
ZEEHC
SEECH

FND

ZEEHC

FND

Dead, Last Node Dead)

Scene 1
(100 Node)

2000

Table 2: Network Lifetime (First Node Dead, Average Node

SCENE

3000

e- ISSN: 2321-3159

[3]

K. V. Shukla, Chandaben Mohan Bahi, Energy efficient routing

protocol LEACH for wireless sensor network, IEEE Communications
Surveys, vol.15,no.2, pp. 551-591, 2013.
W. B.Heinzelman, A. P. Chandrakasan and H. Bala krishnan, An
application-specific protocol architecture for wireless micro sensor
networks, IEEE Transactions on Wireless Communication., vol. 1, no.
4, pp. 660670.
V. Loci, G. Moabite, and S. Marino, A two-level hierarchy for low
energy adaptive clustering hierarchy, IEEE Transaction Parallel
Distributed System, vol. 3, no.2, pp. 18091813.

p- ISSN: 2321-3140

Page 118

Ramandeep Kaur, et al International Journal of Review in Electronics and Communication Engineering [Volume 3, Issue 6, December 2015]
[4]

[5]

[6]

[7]

[8]

[9]

[9]

Chi-Stun Cheng, C. K. Toe and F. C. M. Lau, A clustering algorithm

for wireless sensor networks based on social insect colonies, IEEE
Sensors Journals, vol. 11, no. 3, pp. 711721, 2011.
N. Dimokas, D. Katsaros and Y. Manolopoulos, Energy-efficient
distributed clustering in wireless sensor networks, IEEE Transactions
on Parallel and Distributed Systems, vol. 70, no. 4, pp. 371385, 2010.
N. A. Pantazis, S. A. Nikolakakos, and D. D. Vergados, Energyefficient routing protocols in wireless sensor networks: A survey, IEEE
Communication Surveys, vol. 15, no. 2, pp. 551591, 2013.
Asaduzzaman and H. Y. Kong, Energy efficient cooperative LEACH
protocol for wireless sensor networks, Journal of Communications and
Networks, vol. 12, no. 4, pp. 358365, 2010.
P. Gun, T. Jiang, K. Zhang, and H.-H. Chen, Clustering algorithm in
initialization of multi-hop wireless sensor networks, IEEE transactions
on Wireless Communications, vol. 8, no. 12, pp. 57135717,2009.
Chi-Stun Cheng and F. C. M. Lau, An energy-aware scheduling scheme
for wireless sensor networks, IEEE Transaction wireless Technology,
vol. 59, no. 7, pp. 34273444, 2010.
Ossama Younis and Sonia Fahmy, HEED: A Hybrid, Energy-Efficient,
Distributed Clustering Approach for Ad-hoc Sensor Networks,
International Symposium on Parallel Architectures, Algorithms, and
Networks (I-SPAN), vol. 1, no. 4, pp. 660670, 2002.

http://ijrece.org

e- ISSN: 2321-3159

[10] M. Pope, O. Protean and A. S. Pope, A classification of solutions for

the energy limitation in wireless sensor networks, 9th IEEE
International Conference Computer Cyber (ICCC),vol.11,no.3,pp. 293
297.
[11] S. Lin, J. Zhang, G. Zhou, J. A. Stankovic and T. Hein, ATPC:
Adaptive transmission power control for wireless sensor
networks,4thInternational Conference Embedded Network Sensor
System, vol.13, no. 2, pp. 223236, 2006.
[12] S. H. Kang and T. Nguyen, Distance based thresholds for cluster head
selection in wireless sensor networks, IEEE Communication letters,
vol. 16, no. 9, pp. 13961399, 2012.
[13] N.Ahmed, .S.Kanhere, S.Jha, The Holes Problem in Wireless Sensor
Networks: A Survey, Mobile Computing and Communications Review,
vol.1, no.2, pp. 1-14.
[14] H. Wing, Y. Chen, H. Wu and G. Chen, Correlated data gathering with
double trees in wireless sensor networks, IEEE International
Conference Wireless Mobile Computing, Networking Communication,
vol. 12, no. 5, pp. 11471156, 2012.
[15] M. Chu, H. Haussecker, and F. Zhao, "Scalable Information-Driven
Sensor Querying and Routing for ad hoc Heterogeneous Sensor
Networks, The International Journal of High Performance Computing
Applications, Vol. 16, No. 3, August 2002.

p- ISSN: 2321-3140

Page 119