一种基于LEACH改进的均匀分簇路由算法

Improved Uniform Clustering Routing Algorithm Based on LEACH

针对LEACH分簇算法簇头分布位置不均匀以及节点耗能不均衡等缺点,提出一种双SINK节点均匀分簇算法DSUC。该算法首先利用无信标节点ABC定位算法,计算出每个节点的坐标位置,再根据理论得出的最佳簇头数将整个无线网络区域尽可能地划分成均等的区域,然后SINK节点通过各节点坐标选举各区域内离质心最近的节点作为第一轮簇头节点。在区域的对称位置上设置2个SINK节点,轮流交替工作,能有效解决"热区"问题。

In order to solve the problems that the position of cluster nodes distribute uneven and the nodes energy consumption imbalance, a uniform clustering algorithm with double SINK nodes （DSUC） is proposed. This algorithm includes three steps. Firstly, the no beacon node positioning algorithm ABC is used to calculating coordinate for each node. Then, according to the optimal cluster head nodes from survey papers, the entire wireless area di- vided into several small areas as much as possible the measure of each area is equal. Finally, the SINK node chose the node which is closest to the cen- troid of each small area as cluster head node in first round. In the region of the symmetric position two SINK nodes are set down, the two SINK nodes can effectively solve the problem of unbalanced energy consumption by work alternate.