Académique Documents
Professionnel Documents
Culture Documents
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
k-bit
messag
e
(6)
Trans
mitter
Circui
try
Trans
mitter
Ampli
fier
Recei
ver
Circui
try
k-bit
messag
e
(4)
e- ISSN: 2321-3159
(5)
(l) = l
http://ijrece.org
d2)
(3)
+l
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).
Simulation Parameters
80
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
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
4.2
B. Alive nodes
4.1
100
3.9
90
3.8
80
3.7
SEECH
ZEEHC
3.6
500
1000
1500
2000
2500
Round
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
4.1
350
300
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
http://ijrece.org
200
50
3.6
0
250
e- ISSN: 2321-3159
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
800
700
3000
2000
ZEEHC
1000
SEECH
600
500
400
FND
300
LND
Scene 2
200
SEECH
ZEEHC
100
0
AND
500
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
2000
1000
[1]
0
LND
[2]
Scene 1
The lifetime of ZEEHC in Scene (1)
http://ijrece.org
SEECH
FND
832
1163
1138
1568
1479
AND
1000
VI. CONCLUSION
Protocol
SEECH
ZEEHC
SEECH
ZEEHC
SEECH
FND
ZEEHC
FND
Scene 1
(100 Node)
2000
SCENE
3000
e- ISSN: 2321-3159
[3]
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]
http://ijrece.org
e- ISSN: 2321-3159
p- ISSN: 2321-3140
Page 119