Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
org/ie
*1
Abstract
As a low-powe r adaptive hie rarchical ne twork protocols for
wire less se nsor ne tworks, LEACH assumes that all nodes
can transmit data with the sink node directly and cluster
head nodes transfer the information to the sink node in
multi-hop fashion, the re fore it is significant for using ant
colony optimization algorithm to conve rge multi-hop path
from the cluste r head nodes to the sink node . In the se lection
of cluste r head nodes, with LEAC H protocol it is not been
considere d that the residual e ne rgy of the nodes themse lves
and how to distribute the cluste r head nodes in the ne twork,
so we introduce the e nergy factor and de nsity factor, and
se lect the secondary cluste r head from the cluster heads after
the introduction of the ne ighbor nodes. The MATLAB simulation results show that taking advantage of the improve d
algorithm the time of death of the first node is e xte nde d a nd
ne twork pe rformance and balance of node e nergy consumption are improve d more effective ly in the networks,
which re quire of high coverage .
Keywords
LEACH; Multi-hop; Ant Colony Optimization; Energy Balance
Introduction
LEACH (Low-Energy Adaptive Clustering Hierarchy)
(Heinzelman et al., 2000) is a low-power adaptive
hierarchical routing protocol that is designed for WSN
(Wireless Sensor Networks). In LEACH the basic idea
is that each node is balanced to share the energy
consumption of the network by circulating clustering,
so that it can balance the energy consumption of the
network and extend the lifetime of the network. There
have been many improved algorithm for LEACH till
now. LEACH-C algorithm (Rahmanian et al., 2011) is
one of the most classic LEACH improved algorithm,
and the center control mechanism in the selected
cluster head is introduced to reduce the energy
consumption. pLEACH (Yektaparast et al., 2012) on
the basis of LEACH-C, through the study of the sector
of the entire network division, in every sector in select
high energy cluster head nodes act as the cluster head.
LEACH- D (Pawar et al., 2012) is introduced the
residual energy and density of nodes in the cluster
72
www.se ipub.org/ie
ij (t + 1) = (1 ) ij (t ) + ij (t , t + 1)
(1)
1 2,
dij
ij =
1 4,
dij
d0 =
dij < d 0
dij d 0
(2)
(3)
Eamp
consumption
H
=
N
M
2 dtoBS
(4)
, assume
H
that the first cluster in the center of the cluster area,
cluster area is round, the size of the radius R is
E friss
M2
E ( n) =
Esur (n)
Ea
(5 )
Ea = Et
1 r / rmax
N
(6)
73
www.se ipub.org/ie
D ( n) =
Neighbor (n) H
Nr
start
(7)
E(n)>0
Node
death
] R , n G
[
T (n) = 1 p (r mod(1/ p ))
0
otherwise
,
R = c1 Ea (n) + c2 D(n)
c1 + c2 =
1
(9)
Eelec k + E friss k d 2 , d d 0
ETX (k , d ) =
4
Eelec k + Eamp k d , d d 0
(10)
ERX =
(k ) Eelec k
(11)
(k ) E fuse k
E fuse=
(12)
74
(8 )
E(n)Ea
Rand<T(n)
neighbor(n)
>0
Node i has
maximum
residual
energy
N
Radio
cluster
heads
i is cluster
heads
Y
Next node
FIG. 1 THE FLOWCHART OF SELECTING THE CLUS TER HEATS
Parameters (unit)
Initial energy of sensor nodes (J)
Free space signal amplific ation coeffic ient (pJ/bit/M2 )
S ignal amplific ation coeffic ient for multi-path fading
c hannel (pJ/bit/M4)
Energy consumption for sending the data (J/bit)
Energy consumption for receiving the data (J/bit)
Maximum transmission distance (m)
The biggest r max cycles
Values
0.5
10
0.013
5010 -9
5010 -9
87.7
3500
www.se ipub.org/ie
Conclusions
75
www.se ipub.org/ie
REFERENCES
Ne tworks."
Wire less
Communications,
Ne tworking and Mobile Computing (WiCOM), 7th International Confe re nce on, 1-5, 2011.
Pawar, S., Kasliwal, P. "De sign and Evaluation of En-LEACH
Routing Protocol for Wire less Se nsor Ne twork." CyberEnable d
Distribute d
Computing
and
Knowle dge
se nsor
ne tworks".
Electrical
and
Compute r
76