LEACH-REC
算法的研究及实现
葛咏
;
陈玮
【期刊名称】
《计算机应用与软件》
【年
(
卷
),
期】
2012(029)012
【摘要】
LEACH (Low Energy Adaptive Clustering Hierarchy) is a popular
clustering
routing
algorithm
in
WSN.
This
paper
proposes
a
new
algorithm of LEACH based on residual energy and region centralisation,
LEACH-REC. This algorithm makes the improvements from two aspects.
In
the
phase
of
round
setup,
the
cluster
head
is
selected
according
to
node' s residual energy and location; In the phase of data transmission ,
the cluster heads will be divided into different regions. A cluster head in
certain
related
region
selects
next
hop
based
on
the
function
value
weight (i,j) , until the data has been transmitted to sink node. Simulation
experiment
shows
that
compared
with
LEACH
and
LEACHED
,
in
algorithm LEACH-REC the life cycle of wireless sensor network extends
about 600 and 400 rounds respectively, and the services quality of the
network
improves
remarkably.%LEACH(
低功耗自适应集簇分层协议
)
是无线
传感器网络中常用的分簇路由算法
.
在
LEACH
算法的基础上
,
提出一种基于节点
剩余能量和区域中心化的算法
(LEACH-REC).
该算法从两个方面进行改进
,
在回
合的建立阶段
,
根据节点的剩余能量和位置选择簇首;在数据传输阶段
,
将簇首分
成不同的区域
,
某个区域的簇首节点根据
weight(i,j)
的值选择下一跳
,
直到数据传
输到
sink
节点
.
模拟实验表明
,
对比
LEACH
和
LEACH-ED,
该算法
(LEACH-REC)