LIU Yong-chao, ZHANG Yue-xia, MIAO Min. Regional cluster head selection routing algorithm for WSNs based on energy and distance[J]. 2015, 34(1): 124-127.
LIU Yong-chao, ZHANG Yue-xia, MIAO Min. Regional cluster head selection routing algorithm for WSNs based on energy and distance[J]. 2015, 34(1): 124-127. DOI: 10.13873/J.1000-9787(2015)01-0124-04.
基于能量和距离的分区域选择簇首WSNs路由算法
摘要
LEACH路由算法是能量有效、基于层次结构的经典路由算法
但它存在簇首选择不合理和能耗不均衡等缺点。针对这些缺点
提出了一种分区域分簇的路由改进算法A-LEACH。根据节点到基站的距离对节点进行区域划分
然后在特定区域用新的阈值来选择簇首
最后采用多跳的方式进行信息传输。分析和仿真结果表明:与经典路由算法LEACH相比
改进算法能够更有效延长网络的生命周期
均衡网络的能量分布和节省网路的能量。
Abstract
LEACH is one of the classic hierarchical structure routing algorithms which is energy-efficient
but there are some shortcomings
such as unreasonable selection of cluster heads and unbalanced energy consumption.Aiming at these shortcomings of LEACH
a regional clustering routing algorithm
A-LEACH
based on energy and distance is proposed. Nodes are divided into parts according to their distance to base station
cluster heads are selected in specific region through new threshold
and information is transmitted with mode of multiple hops.Analysis and simulation results show that compared with classical routing algorithm LEACH
A-LEACH can prolong lifetime of the network
balance network energy distribution and save network energy more effectively.